Identifier
- St001269: Permutations ⟶ ℤ
Values
[1] => 0
[1,2] => 0
[2,1] => 1
[1,2,3] => 0
[1,3,2] => 1
[2,1,3] => 1
[2,3,1] => 1
[3,1,2] => 1
[3,2,1] => 1
[1,2,3,4] => 0
[1,2,4,3] => 1
[1,3,2,4] => 1
[1,3,4,2] => 1
[1,4,2,3] => 1
[1,4,3,2] => 1
[2,1,3,4] => 1
[2,1,4,3] => 2
[2,3,1,4] => 1
[2,3,4,1] => 1
[2,4,1,3] => 2
[2,4,3,1] => 1
[3,1,2,4] => 1
[3,1,4,2] => 2
[3,2,1,4] => 1
[3,2,4,1] => 1
[3,4,1,2] => 2
[3,4,2,1] => 2
[4,1,2,3] => 1
[4,1,3,2] => 1
[4,2,1,3] => 1
[4,2,3,1] => 1
[4,3,1,2] => 2
[4,3,2,1] => 2
[1,2,3,4,5] => 0
[1,2,3,5,4] => 1
[1,2,4,3,5] => 1
[1,2,4,5,3] => 1
[1,2,5,3,4] => 1
[1,2,5,4,3] => 1
[1,3,2,4,5] => 1
[1,3,2,5,4] => 2
[1,3,4,2,5] => 1
[1,3,4,5,2] => 1
[1,3,5,2,4] => 2
[1,3,5,4,2] => 1
[1,4,2,3,5] => 1
[1,4,2,5,3] => 2
[1,4,3,2,5] => 1
[1,4,3,5,2] => 1
[1,4,5,2,3] => 2
[1,4,5,3,2] => 2
[1,5,2,3,4] => 1
[1,5,2,4,3] => 1
[1,5,3,2,4] => 1
[1,5,3,4,2] => 1
[1,5,4,2,3] => 2
[1,5,4,3,2] => 2
[2,1,3,4,5] => 1
[2,1,3,5,4] => 2
[2,1,4,3,5] => 2
[2,1,4,5,3] => 2
[2,1,5,3,4] => 2
[2,1,5,4,3] => 2
[2,3,1,4,5] => 1
[2,3,1,5,4] => 2
[2,3,4,1,5] => 1
[2,3,4,5,1] => 1
[2,3,5,1,4] => 2
[2,3,5,4,1] => 1
[2,4,1,3,5] => 2
[2,4,1,5,3] => 2
[2,4,3,1,5] => 1
[2,4,3,5,1] => 1
[2,4,5,1,3] => 2
[2,4,5,3,1] => 2
[2,5,1,3,4] => 2
[2,5,1,4,3] => 2
[2,5,3,1,4] => 2
[2,5,3,4,1] => 1
[2,5,4,1,3] => 2
[2,5,4,3,1] => 2
[3,1,2,4,5] => 1
[3,1,2,5,4] => 2
[3,1,4,2,5] => 2
[3,1,4,5,2] => 2
[3,1,5,2,4] => 2
[3,1,5,4,2] => 2
[3,2,1,4,5] => 1
[3,2,1,5,4] => 2
[3,2,4,1,5] => 1
[3,2,4,5,1] => 1
[3,2,5,1,4] => 2
[3,2,5,4,1] => 1
[3,4,1,2,5] => 2
[3,4,1,5,2] => 2
[3,4,2,1,5] => 2
[3,4,2,5,1] => 2
[3,4,5,1,2] => 2
[3,4,5,2,1] => 2
[3,5,1,2,4] => 2
[3,5,1,4,2] => 2
>>> 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 sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation.
References
[1] Spiro, S. Ballot Permutations, Odd Order Permutations, and a New Permutation Statistic arXiv:1810.00993
Code
def statistic(pi):
M = 0
for c in pi.to_cycles():
cycasc = 0
cycdes = 0
for i in range(len(c)-1):
if c[i] < c[i+1]:
cycasc += 1
else:
cycdes += 1
if c[-1] < c[0]:
cycasc += 1
else:
cycdes += 1
M += min(cycasc, cycdes)
return M
Created
Oct 08, 2018 at 05:58 by Martin Rubey
Updated
Oct 08, 2018 at 05:58 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!