Identifier
- St000844: Permutations ⟶ ℤ
Values
[1,2] => 1
[2,1] => 2
[1,2,3] => 1
[1,3,2] => 2
[2,1,3] => 2
[2,3,1] => 3
[3,1,2] => 3
[3,2,1] => 3
[1,2,3,4] => 1
[1,2,4,3] => 2
[1,3,2,4] => 2
[1,3,4,2] => 3
[1,4,2,3] => 3
[1,4,3,2] => 3
[2,1,3,4] => 2
[2,1,4,3] => 2
[2,3,1,4] => 3
[2,3,4,1] => 4
[2,4,1,3] => 4
[2,4,3,1] => 4
[3,1,2,4] => 3
[3,1,4,2] => 4
[3,2,1,4] => 3
[3,2,4,1] => 4
[3,4,1,2] => 4
[3,4,2,1] => 4
[4,1,2,3] => 4
[4,1,3,2] => 4
[4,2,1,3] => 4
[4,2,3,1] => 4
[4,3,1,2] => 4
[4,3,2,1] => 4
[1,2,3,4,5] => 1
[1,2,3,5,4] => 2
[1,2,4,3,5] => 2
[1,2,4,5,3] => 3
[1,2,5,3,4] => 3
[1,2,5,4,3] => 3
[1,3,2,4,5] => 2
[1,3,2,5,4] => 2
[1,3,4,2,5] => 3
[1,3,4,5,2] => 4
[1,3,5,2,4] => 4
[1,3,5,4,2] => 4
[1,4,2,3,5] => 3
[1,4,2,5,3] => 4
[1,4,3,2,5] => 3
[1,4,3,5,2] => 4
[1,4,5,2,3] => 4
[1,4,5,3,2] => 4
[1,5,2,3,4] => 4
[1,5,2,4,3] => 4
[1,5,3,2,4] => 4
[1,5,3,4,2] => 4
[1,5,4,2,3] => 4
[1,5,4,3,2] => 4
[2,1,3,4,5] => 2
[2,1,3,5,4] => 2
[2,1,4,3,5] => 2
[2,1,4,5,3] => 3
[2,1,5,3,4] => 3
[2,1,5,4,3] => 3
[2,3,1,4,5] => 3
[2,3,1,5,4] => 3
[2,3,4,1,5] => 4
[2,3,4,5,1] => 5
[2,3,5,1,4] => 5
[2,3,5,4,1] => 5
[2,4,1,3,5] => 4
[2,4,1,5,3] => 5
[2,4,3,1,5] => 4
[2,4,3,5,1] => 5
[2,4,5,1,3] => 5
[2,4,5,3,1] => 5
[2,5,1,3,4] => 5
[2,5,1,4,3] => 5
[2,5,3,1,4] => 5
[2,5,3,4,1] => 5
[2,5,4,1,3] => 5
[2,5,4,3,1] => 5
[3,1,2,4,5] => 3
[3,1,2,5,4] => 3
[3,1,4,2,5] => 4
[3,1,4,5,2] => 5
[3,1,5,2,4] => 5
[3,1,5,4,2] => 5
[3,2,1,4,5] => 3
[3,2,1,5,4] => 3
[3,2,4,1,5] => 4
[3,2,4,5,1] => 5
[3,2,5,1,4] => 5
[3,2,5,4,1] => 5
[3,4,1,2,5] => 4
[3,4,1,5,2] => 5
[3,4,2,1,5] => 4
[3,4,2,5,1] => 5
[3,4,5,1,2] => 5
[3,4,5,2,1] => 5
[3,5,1,2,4] => 5
[3,5,1,4,2] => 5
[3,5,2,1,4] => 5
>>> 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 size of the largest block in the direct sum decomposition of a permutation.
A component of a permutation $\pi$ is a set of consecutive numbers $\{a,a+1,\dots, b\}$ such that $a\leq \pi(i) \leq b$ for all $a\leq i\leq b$.
This statistic is the size of the largest component which does not properly contain another component.
A component of a permutation $\pi$ is a set of consecutive numbers $\{a,a+1,\dots, b\}$ such that $a\leq \pi(i) \leq b$ for all $a\leq i\leq b$.
This statistic is the size of the largest component which does not properly contain another component.
Code
def statistic(pi):
a = 0
m = 0
u = []
for i in range(len(pi)):
u.append(pi[i])
if max(u) == len(u):
m = max(m, len(u)-a)
a = len(u)
return m
Created
Jun 08, 2017 at 18:31 by Martin Rubey
Updated
Jun 08, 2017 at 18:31 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!