Identifier
-
Mp00023:
Dyck paths
—to non-crossing permutation⟶
Permutations
Mp00241: Permutations —invert Laguerre heap⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000771: Graphs ⟶ ℤ
Values
[1,0] => [1] => [1] => ([],1) => 1
[1,1,0,0] => [2,1] => [2,1] => ([(0,1)],2) => 1
[1,1,0,1,0,0] => [2,3,1] => [3,1,2] => ([(0,2),(1,2)],3) => 1
[1,1,1,0,0,0] => [3,2,1] => [3,2,1] => ([(0,1),(0,2),(1,2)],3) => 2
[1,1,0,1,0,1,0,0] => [2,3,4,1] => [4,1,2,3] => ([(0,3),(1,3),(2,3)],4) => 2
[1,1,0,1,1,0,0,0] => [2,4,3,1] => [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 2
[1,1,1,0,0,1,0,0] => [3,2,4,1] => [4,1,3,2] => ([(0,3),(1,2),(1,3),(2,3)],4) => 1
[1,1,1,0,1,0,0,0] => [4,2,3,1] => [3,1,4,2] => ([(0,3),(1,2),(2,3)],4) => 1
[1,1,1,1,0,0,0,0] => [4,3,2,1] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 3
[1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5) => 3
[1,1,0,1,0,1,1,0,0,0] => [2,3,5,4,1] => [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,1,0,1,1,0,0,1,0,0] => [2,4,3,5,1] => [5,1,2,4,3] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,1,0,1,1,0,1,0,0,0] => [2,5,3,4,1] => [4,1,2,5,3] => ([(0,4),(1,4),(2,3),(3,4)],5) => 1
[1,1,0,1,1,1,0,0,0,0] => [2,5,4,3,1] => [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 3
[1,1,1,0,0,1,0,1,0,0] => [3,2,4,5,1] => [5,1,3,2,4] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,1,1,0,0,1,1,0,0,0] => [3,2,5,4,1] => [5,4,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,1,1,0,1,0,0,1,0,0] => [4,2,3,5,1] => [5,1,3,4,2] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 1
[1,1,1,0,1,0,1,0,0,0] => [5,2,3,4,1] => [4,1,3,5,2] => ([(0,4),(1,3),(2,3),(2,4),(3,4)],5) => 1
[1,1,1,0,1,1,0,0,0,0] => [5,2,4,3,1] => [4,3,1,5,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5) => 1
[1,1,1,1,0,0,0,1,0,0] => [4,3,2,5,1] => [5,1,4,3,2] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 2
[1,1,1,1,0,0,1,0,0,0] => [5,3,2,4,1] => [4,1,5,3,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5) => 1
[1,1,1,1,0,1,0,0,0,0] => [5,3,4,2,1] => [4,2,1,5,3] => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5) => 1
[1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 4
[1,1,0,1,0,1,0,1,0,1,0,0] => [2,3,4,5,6,1] => [6,1,2,3,4,5] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => 4
[1,1,0,1,0,1,0,1,1,0,0,0] => [2,3,4,6,5,1] => [6,5,1,2,3,4] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 3
[1,1,0,1,0,1,1,0,0,1,0,0] => [2,3,5,4,6,1] => [6,1,2,3,5,4] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 3
[1,1,0,1,0,1,1,0,1,0,0,0] => [2,3,6,4,5,1] => [5,1,2,3,6,4] => ([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => 2
[1,1,0,1,0,1,1,1,0,0,0,0] => [2,3,6,5,4,1] => [6,5,4,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 3
[1,1,0,1,1,0,0,1,0,1,0,0] => [2,4,3,5,6,1] => [6,1,2,4,3,5] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 3
[1,1,0,1,1,0,0,1,1,0,0,0] => [2,4,3,6,5,1] => [6,5,1,2,4,3] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,0,1,1,0,1,0,0,1,0,0] => [2,5,3,4,6,1] => [6,1,2,4,5,3] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,0,1,1,0,1,0,1,0,0,0] => [2,6,3,4,5,1] => [5,1,2,4,6,3] => ([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => 1
[1,1,0,1,1,0,1,1,0,0,0,0] => [2,6,3,5,4,1] => [5,4,1,2,6,3] => ([(0,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,0,1,1,1,0,0,0,1,0,0] => [2,5,4,3,6,1] => [6,1,2,5,4,3] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,0,1,1,1,0,0,1,0,0,0] => [2,6,4,3,5,1] => [5,1,2,6,4,3] => ([(0,5),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6) => 1
[1,1,0,1,1,1,0,1,0,0,0,0] => [2,6,4,5,3,1] => [5,3,1,2,6,4] => ([(0,3),(1,4),(1,5),(2,4),(2,5),(3,5),(4,5)],6) => 1
[1,1,0,1,1,1,1,0,0,0,0,0] => [2,6,5,4,3,1] => [6,5,4,3,1,2] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 4
[1,1,1,0,0,1,0,1,0,1,0,0] => [3,2,4,5,6,1] => [6,1,3,2,4,5] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 3
[1,1,1,0,0,1,0,1,1,0,0,0] => [3,2,4,6,5,1] => [6,5,1,3,2,4] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,0,0,1,1,0,0,1,0,0] => [3,2,5,4,6,1] => [6,1,3,2,5,4] => ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => 2
[1,1,1,0,0,1,1,0,1,0,0,0] => [3,2,6,4,5,1] => [5,1,3,2,6,4] => ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => 1
[1,1,1,0,0,1,1,1,0,0,0,0] => [3,2,6,5,4,1] => [6,5,4,1,3,2] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 3
[1,1,1,0,1,0,0,1,0,1,0,0] => [4,2,3,5,6,1] => [6,1,3,4,2,5] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,0,1,0,0,1,1,0,0,0] => [4,2,3,6,5,1] => [6,5,1,3,4,2] => ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,0,1,0,1,0,0,1,0,0] => [5,2,3,4,6,1] => [6,1,3,4,5,2] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,0,1,0,1,0,1,0,0,0] => [6,2,3,4,5,1] => [5,1,3,4,6,2] => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,1,0,1,0,1,1,0,0,0,0] => [6,2,3,5,4,1] => [5,4,1,3,6,2] => ([(0,5),(1,3),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,1,0,1,1,0,0,0,1,0,0] => [5,2,4,3,6,1] => [6,1,4,3,5,2] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,1,0,1,1,0,0,1,0,0,0] => [6,2,4,3,5,1] => [5,1,4,3,6,2] => ([(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,1,0,1,1,0,1,0,0,0,0] => [6,2,4,5,3,1] => [5,3,1,4,6,2] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6) => 1
[1,1,1,0,1,1,1,0,0,0,0,0] => [6,2,5,4,3,1] => [5,4,3,1,6,2] => ([(0,5),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,0,0,0,1,0,1,0,0] => [4,3,2,5,6,1] => [6,1,4,3,2,5] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,0,0,0,1,1,0,0,0] => [4,3,2,6,5,1] => [6,5,1,4,3,2] => ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,0,0,1,0,0,1,0,0] => [5,3,2,4,6,1] => [6,1,4,5,3,2] => ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,0,0,1,0,1,0,0,0] => [6,3,2,4,5,1] => [5,1,4,6,3,2] => ([(0,5),(1,3),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,1,1,0,0,1,1,0,0,0,0] => [6,3,2,5,4,1] => [5,4,1,6,3,2] => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,0,1,0,0,0,1,0,0] => [5,3,4,2,6,1] => [6,1,4,2,5,3] => ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,1,1,0,1,0,0,1,0,0,0] => [6,3,4,2,5,1] => [5,1,4,2,6,3] => ([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,1,1,0,1,0,1,0,0,0,0] => [6,3,4,5,2,1] => [5,2,1,4,6,3] => ([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => 1
[1,1,1,1,0,1,1,0,0,0,0,0] => [6,3,5,4,2,1] => [5,4,2,1,6,3] => ([(0,3),(1,2),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,1,0,0,0,0,1,0,0] => [5,4,3,2,6,1] => [6,1,5,4,3,2] => ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 3
[1,1,1,1,1,0,0,0,1,0,0,0] => [6,4,3,2,5,1] => [5,1,6,4,3,2] => ([(0,5),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 2
[1,1,1,1,1,0,0,1,0,0,0,0] => [6,4,3,5,2,1] => [5,2,1,6,4,3] => ([(0,1),(0,5),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6) => 1
[1,1,1,1,1,0,1,0,0,0,0,0] => [6,5,3,4,2,1] => [4,2,1,6,5,3] => ([(0,1),(0,5),(1,5),(2,3),(2,4),(3,4),(4,5)],6) => 2
[1,1,1,1,1,1,0,0,0,0,0,0] => [6,5,4,3,2,1] => [6,5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 5
[1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [2,3,4,5,6,7,1] => [7,1,2,3,4,5,6] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => 5
[1,1,0,1,0,1,0,1,0,1,1,0,0,0] => [2,3,4,5,7,6,1] => [7,6,1,2,3,4,5] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 4
[1,1,0,1,0,1,0,1,1,0,0,1,0,0] => [2,3,4,6,5,7,1] => [7,1,2,3,4,6,5] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => 4
[1,1,0,1,0,1,0,1,1,0,1,0,0,0] => [2,3,4,7,5,6,1] => [6,1,2,3,4,7,5] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(5,6)],7) => 3
[1,1,0,1,0,1,0,1,1,1,0,0,0,0] => [2,3,4,7,6,5,1] => [7,6,5,1,2,3,4] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 3
[1,1,0,1,0,1,1,0,0,1,0,1,0,0] => [2,3,5,4,6,7,1] => [7,1,2,3,5,4,6] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => 4
[1,1,0,1,0,1,1,0,0,1,1,0,0,0] => [2,3,5,4,7,6,1] => [7,6,1,2,3,5,4] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 3
[1,1,0,1,0,1,1,0,1,0,0,1,0,0] => [2,3,6,4,5,7,1] => [7,1,2,3,5,6,4] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 3
[1,1,0,1,0,1,1,0,1,0,1,0,0,0] => [2,3,7,4,5,6,1] => [6,1,2,3,5,7,4] => ([(0,6),(1,6),(2,6),(3,5),(4,5),(4,6),(5,6)],7) => 2
[1,1,0,1,0,1,1,0,1,1,0,0,0,0] => [2,3,7,4,6,5,1] => [6,5,1,2,3,7,4] => ([(0,4),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 2
[1,1,0,1,0,1,1,1,0,0,0,1,0,0] => [2,3,6,5,4,7,1] => [7,1,2,3,6,5,4] => ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 3
[1,1,0,1,0,1,1,1,0,0,1,0,0,0] => [2,3,7,5,4,6,1] => [6,1,2,3,7,5,4] => ([(0,6),(1,6),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7) => 2
[1,1,0,1,0,1,1,1,0,1,0,0,0,0] => [2,3,7,5,6,4,1] => [6,4,1,2,3,7,5] => ([(0,4),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,6),(5,6)],7) => 2
[1,1,0,1,0,1,1,1,1,0,0,0,0,0] => [2,3,7,6,5,4,1] => [7,6,5,4,1,2,3] => ([(0,3),(0,4),(0,5),(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 4
[1,1,0,1,1,0,0,1,0,1,0,1,0,0] => [2,4,3,5,6,7,1] => [7,1,2,4,3,5,6] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => 4
[1,1,0,1,1,0,0,1,0,1,1,0,0,0] => [2,4,3,5,7,6,1] => [7,6,1,2,4,3,5] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 3
[1,1,0,1,1,0,0,1,1,0,0,1,0,0] => [2,4,3,6,5,7,1] => [7,1,2,4,3,6,5] => ([(0,6),(1,6),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7) => 3
[1,1,0,1,1,0,0,1,1,0,1,0,0,0] => [2,4,3,7,5,6,1] => [6,1,2,4,3,7,5] => ([(0,6),(1,6),(2,3),(3,6),(4,5),(4,6),(5,6)],7) => 2
[1,1,0,1,1,0,0,1,1,1,0,0,0,0] => [2,4,3,7,6,5,1] => [7,6,5,1,2,4,3] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 3
[1,1,0,1,1,0,1,0,0,1,0,1,0,0] => [2,5,3,4,6,7,1] => [7,1,2,4,5,3,6] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 3
[1,1,0,1,1,0,1,0,0,1,1,0,0,0] => [2,5,3,4,7,6,1] => [7,6,1,2,4,5,3] => ([(0,5),(0,6),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 2
[1,1,0,1,1,0,1,0,1,0,0,1,0,0] => [2,6,3,4,5,7,1] => [7,1,2,4,5,6,3] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 2
[1,1,0,1,1,0,1,0,1,0,1,0,0,0] => [2,7,3,4,5,6,1] => [6,1,2,4,5,7,3] => ([(0,6),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,0,1,1,0,1,0,1,1,0,0,0,0] => [2,7,3,4,6,5,1] => [6,5,1,2,4,7,3] => ([(0,4),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 2
[1,1,0,1,1,0,1,1,0,0,0,1,0,0] => [2,6,3,5,4,7,1] => [7,1,2,5,4,6,3] => ([(0,6),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 2
[1,1,0,1,1,0,1,1,0,0,1,0,0,0] => [2,7,3,5,4,6,1] => [6,1,2,5,4,7,3] => ([(0,6),(1,6),(2,5),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,0,1,1,0,1,1,0,1,0,0,0,0] => [2,7,3,5,6,4,1] => [6,4,1,2,5,7,3] => ([(0,5),(1,5),(1,6),(2,4),(2,6),(3,4),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,0,1,1,0,1,1,1,0,0,0,0,0] => [2,7,3,6,5,4,1] => [6,5,4,1,2,7,3] => ([(0,3),(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 3
[1,1,0,1,1,1,0,0,0,1,0,1,0,0] => [2,5,4,3,6,7,1] => [7,1,2,5,4,3,6] => ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 3
[1,1,0,1,1,1,0,0,0,1,1,0,0,0] => [2,5,4,3,7,6,1] => [7,6,1,2,5,4,3] => ([(0,5),(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 2
[1,1,0,1,1,1,0,0,1,0,0,1,0,0] => [2,6,4,3,5,7,1] => [7,1,2,5,6,4,3] => ([(0,6),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 2
[1,1,0,1,1,1,0,0,1,0,1,0,0,0] => [2,7,4,3,5,6,1] => [6,1,2,5,7,4,3] => ([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,0,1,1,1,0,0,1,1,0,0,0,0] => [2,7,4,3,6,5,1] => [6,5,1,2,7,4,3] => ([(0,5),(0,6),(1,5),(1,6),(2,3),(2,4),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,0,1,1,1,0,1,0,0,0,1,0,0] => [2,6,4,5,3,7,1] => [7,1,2,5,3,6,4] => ([(0,6),(1,6),(2,5),(2,6),(3,4),(3,6),(4,5),(4,6),(5,6)],7) => 2
[1,1,0,1,1,1,0,1,0,0,1,0,0,0] => [2,7,4,5,3,6,1] => [6,1,2,5,3,7,4] => ([(0,6),(1,6),(2,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 1
[1,1,0,1,1,1,0,1,0,1,0,0,0,0] => [2,7,4,5,6,3,1] => [6,3,1,2,5,7,4] => ([(0,5),(1,5),(1,6),(2,4),(2,6),(3,4),(3,6),(4,6),(5,6)],7) => 1
>>> Load all 197 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 largest multiplicity of a distance Laplacian eigenvalue in a connected graph.
The distance Laplacian of a graph is the (symmetric) matrix with row and column sums $0$, which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue.
For example, the cycle on four vertices has distance Laplacian
$$ \left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right). $$
Its eigenvalues are $0,4,4,6$, so the statistic is $2$.
The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore statistic $1$.
The distance Laplacian of a graph is the (symmetric) matrix with row and column sums $0$, which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue.
For example, the cycle on four vertices has distance Laplacian
$$ \left(\begin{array}{rrrr} 4 & -1 & -2 & -1 \\ -1 & 4 & -1 & -2 \\ -2 & -1 & 4 & -1 \\ -1 & -2 & -1 & 4 \end{array}\right). $$
Its eigenvalues are $0,4,4,6$, so the statistic is $2$.
The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore statistic $1$.
Map
to non-crossing permutation
Description
Sends a Dyck path $D$ with valley at positions $\{(i_1,j_1),\ldots,(i_k,j_k)\}$ to the unique non-crossing permutation $\pi$ having descents $\{i_1,\ldots,i_k\}$ and whose inverse has descents $\{j_1,\ldots,j_k\}$.
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to $n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to $n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
Map
graph of inversions
Description
The graph of inversions of a permutation.
For a permutation of $\{1,\dots,n\}$, this is the graph with vertices $\{1,\dots,n\}$, where $(i,j)$ is an edge if and only if it is an inversion of the permutation.
For a permutation of $\{1,\dots,n\}$, this is the graph with vertices $\{1,\dots,n\}$, where $(i,j)$ is an edge if and only if it is an inversion of the permutation.
Map
invert Laguerre heap
Description
The permutation obtained by inverting the corresponding Laguerre heap, according to Viennot.
Let $\pi$ be a permutation. Following Viennot [1], we associate to $\pi$ a heap of pieces, by considering each decreasing run $(\pi_i, \pi_{i+1}, \dots, \pi_j)$ of $\pi$ as one piece, beginning with the left most run. Two pieces commute if and only if the minimal element of one piece is larger than the maximal element of the other piece.
This map yields the permutation corresponding to the heap obtained by reversing the reading direction of the heap.
Equivalently, this is the permutation obtained by flipping the noncrossing arc diagram of Reading [2] vertically.
By definition, this map preserves the set of decreasing runs.
Let $\pi$ be a permutation. Following Viennot [1], we associate to $\pi$ a heap of pieces, by considering each decreasing run $(\pi_i, \pi_{i+1}, \dots, \pi_j)$ of $\pi$ as one piece, beginning with the left most run. Two pieces commute if and only if the minimal element of one piece is larger than the maximal element of the other piece.
This map yields the permutation corresponding to the heap obtained by reversing the reading direction of the heap.
Equivalently, this is the permutation obtained by flipping the noncrossing arc diagram of Reading [2] vertically.
By definition, this map preserves the set of decreasing runs.
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!