Identifier
- St001468: Permutations ⟶ ℤ
Values
[1] => 1
[1,2] => 1
[2,1] => 3
[1,2,3] => 1
[1,3,2] => 1
[2,1,3] => 3
[2,3,1] => 4
[3,1,2] => 4
[3,2,1] => 2
[1,2,3,4] => 1
[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] => 3
[2,1,4,3] => 5
[2,3,1,4] => 4
[2,3,4,1] => 5
[2,4,1,3] => 5
[2,4,3,1] => 3
[3,1,2,4] => 4
[3,1,4,2] => 5
[3,2,1,4] => 2
[3,2,4,1] => 2
[3,4,1,2] => 5
[3,4,2,1] => 5
[4,1,2,3] => 5
[4,1,3,2] => 3
[4,2,1,3] => 2
[4,2,3,1] => 2
[4,3,1,2] => 5
[4,3,2,1] => 5
[1,2,3,4,5] => 1
[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] => 1
[1,3,4,2,5] => 1
[1,3,4,5,2] => 1
[1,3,5,2,4] => 1
[1,3,5,4,2] => 1
[1,4,2,3,5] => 1
[1,4,2,5,3] => 1
[1,4,3,2,5] => 1
[1,4,3,5,2] => 1
[1,4,5,2,3] => 1
[1,4,5,3,2] => 1
[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] => 1
[1,5,4,3,2] => 1
[2,1,3,4,5] => 3
[2,1,3,5,4] => 3
[2,1,4,3,5] => 5
[2,1,4,5,3] => 6
[2,1,5,3,4] => 6
[2,1,5,4,3] => 4
[2,3,1,4,5] => 4
[2,3,1,5,4] => 6
[2,3,4,1,5] => 5
[2,3,4,5,1] => 6
[2,3,5,1,4] => 6
[2,3,5,4,1] => 4
[2,4,1,3,5] => 5
[2,4,1,5,3] => 6
[2,4,3,1,5] => 3
[2,4,3,5,1] => 3
[2,4,5,1,3] => 6
[2,4,5,3,1] => 6
[2,5,1,3,4] => 6
[2,5,1,4,3] => 4
[2,5,3,1,4] => 3
[2,5,3,4,1] => 3
[2,5,4,1,3] => 6
[2,5,4,3,1] => 6
[3,1,2,4,5] => 4
[3,1,2,5,4] => 6
[3,1,4,2,5] => 5
[3,1,4,5,2] => 6
[3,1,5,2,4] => 6
[3,1,5,4,2] => 4
[3,2,1,4,5] => 2
[3,2,1,5,4] => 2
[3,2,4,1,5] => 2
[3,2,4,5,1] => 2
[3,2,5,1,4] => 2
[3,2,5,4,1] => 2
[3,4,1,2,5] => 5
[3,4,1,5,2] => 6
[3,4,2,1,5] => 5
[3,4,2,5,1] => 6
[3,4,5,1,2] => 6
[3,4,5,2,1] => 6
[3,5,1,2,4] => 6
[3,5,1,4,2] => 4
>>> 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 smallest fixpoint of a permutation.
A fixpoint of a permutation of length $n$ if an index $i$ such that $\pi(i) = i$, and we set $\pi(n+1) = n+1$.
A fixpoint of a permutation of length $n$ if an index $i$ such that $\pi(i) = i$, and we set $\pi(n+1) = n+1$.
Code
def statistic(pi):
pi = list(pi) + [len(pi)+1]
for i in range(len(pi)):
if pi[i] == i+1:
return i+1
Created
Sep 08, 2019 at 10:12 by Christian Stump
Updated
Sep 08, 2019 at 12:45 by Christian Stump
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!