Identifier
- St001663: Permutations ⟶ ℤ
Values
[1] => 0
[1,2] => 0
[2,1] => 0
[1,2,3] => 0
[1,3,2] => 1
[2,1,3] => 0
[2,3,1] => 0
[3,1,2] => 0
[3,2,1] => 0
[1,2,3,4] => 0
[1,2,4,3] => 1
[1,3,2,4] => 1
[1,3,4,2] => 0
[1,4,2,3] => 0
[1,4,3,2] => 0
[2,1,3,4] => 0
[2,1,4,3] => 0
[2,3,1,4] => 0
[2,3,4,1] => 0
[2,4,1,3] => 0
[2,4,3,1] => 1
[3,1,2,4] => 0
[3,1,4,2] => 0
[3,2,1,4] => 0
[3,2,4,1] => 0
[3,4,1,2] => 0
[3,4,2,1] => 0
[4,1,2,3] => 0
[4,1,3,2] => 1
[4,2,1,3] => 0
[4,2,3,1] => 0
[4,3,1,2] => 0
[4,3,2,1] => 0
[1,2,3,4,5] => 0
[1,2,3,5,4] => 1
[1,2,4,3,5] => 1
[1,2,4,5,3] => 0
[1,2,5,3,4] => 0
[1,2,5,4,3] => 0
[1,3,2,4,5] => 1
[1,3,2,5,4] => 1
[1,3,4,2,5] => 0
[1,3,4,5,2] => 0
[1,3,5,2,4] => 0
[1,3,5,4,2] => 1
[1,4,2,3,5] => 0
[1,4,2,5,3] => 0
[1,4,3,2,5] => 0
[1,4,3,5,2] => 0
[1,4,5,2,3] => 0
[1,4,5,3,2] => 0
[1,5,2,3,4] => 0
[1,5,2,4,3] => 1
[1,5,3,2,4] => 0
[1,5,3,4,2] => 0
[1,5,4,2,3] => 0
[1,5,4,3,2] => 0
[2,1,3,4,5] => 0
[2,1,3,5,4] => 1
[2,1,4,3,5] => 0
[2,1,4,5,3] => 0
[2,1,5,3,4] => 0
[2,1,5,4,3] => 0
[2,3,1,4,5] => 0
[2,3,1,5,4] => 0
[2,3,4,1,5] => 0
[2,3,4,5,1] => 0
[2,3,5,1,4] => 0
[2,3,5,4,1] => 1
[2,4,1,3,5] => 0
[2,4,1,5,3] => 0
[2,4,3,1,5] => 1
[2,4,3,5,1] => 1
[2,4,5,1,3] => 0
[2,4,5,3,1] => 0
[2,5,1,3,4] => 0
[2,5,1,4,3] => 0
[2,5,3,1,4] => 0
[2,5,3,4,1] => 0
[2,5,4,1,3] => 0
[2,5,4,3,1] => 0
[3,1,2,4,5] => 0
[3,1,2,5,4] => 0
[3,1,4,2,5] => 0
[3,1,4,5,2] => 0
[3,1,5,2,4] => 0
[3,1,5,4,2] => 0
[3,2,1,4,5] => 0
[3,2,1,5,4] => 0
[3,2,4,1,5] => 0
[3,2,4,5,1] => 0
[3,2,5,1,4] => 0
[3,2,5,4,1] => 0
[3,4,1,2,5] => 0
[3,4,1,5,2] => 0
[3,4,2,1,5] => 0
[3,4,2,5,1] => 0
[3,4,5,1,2] => 0
[3,4,5,2,1] => 0
[3,5,1,2,4] => 0
[3,5,1,4,2] => 0
>>> Load all 1200 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The number of occurrences of the Hertzsprung pattern 132 in a permutation.
A Hertzsprung occurrence of the pattern τ=(τ1,…,τk) in a permutation π is a factor πi,πi+1,…,πi+k−1 of π such that πi+j−1−τj is constant for 1≤j≤k.
A Hertzsprung occurrence of the pattern τ=(τ1,…,τk) in a permutation π is a factor πi,πi+1,…,πi+k−1 of π such that πi+j−1−τj is constant for 1≤j≤k.
References
[1] Myers, A. N. Counting permutations by their rigid patterns MathSciNet:1917026
[2] Claesson, A. From Hertzsprung's problem to pattern-rewriting systems arXiv:2012.15309
[2] Claesson, A. From Hertzsprung's problem to pattern-rewriting systems arXiv:2012.15309
Code
def hertzsprung_occurrences(pi, tau):
k = len(tau)
c = 0
for i in range(len(pi)-len(tau)+1):
d = pi[i] - tau[0]
if all(pi[i+j] - tau[j] == d for j in range(1, k)):
c += 1
return c
def statistic(pi):
return hertzsprung_occurrences(pi, [1,3,2])
Created
Jan 01, 2021 at 13:15 by Martin Rubey
Updated
May 02, 2021 at 22:02 by Martin Rubey
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!