Identifier
-
Mp00132:
Dyck paths
—switch returns and last double rise⟶
Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000422: Graphs ⟶ ℤ
Values
[1,0] => [1,0] => [1] => ([],1) => 0
[1,0,1,0] => [1,0,1,0] => [1,2] => ([],2) => 0
[1,1,0,0] => [1,1,0,0] => [2,1] => ([(0,1)],2) => 2
[1,0,1,0,1,0] => [1,0,1,0,1,0] => [1,2,3] => ([],3) => 0
[1,1,0,0,1,0] => [1,1,0,0,1,0] => [2,1,3] => ([(1,2)],3) => 2
[1,1,0,1,0,0] => [1,0,1,1,0,0] => [1,3,2] => ([(1,2)],3) => 2
[1,1,1,0,0,0] => [1,1,1,0,0,0] => [3,2,1] => ([(0,1),(0,2),(1,2)],3) => 4
[1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => ([],4) => 0
[1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => ([(2,3)],4) => 2
[1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => ([(2,3)],4) => 2
[1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => ([(2,3)],4) => 2
[1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4) => 4
[1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => ([(0,3),(1,2)],4) => 4
[1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4) => 4
[1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => 6
[1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => ([],5) => 0
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5) => 4
[1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 6
[1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => ([(3,4)],5) => 2
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => ([(3,4)],5) => 2
[1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => ([(3,4)],5) => 2
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => ([(3,4)],5) => 2
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => ([(2,3),(2,4),(3,4)],5) => 4
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => ([(1,4),(2,3)],5) => 4
[1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => ([(1,4),(2,3)],5) => 4
[1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => ([(2,3),(2,4),(3,4)],5) => 4
[1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => ([(1,4),(2,3)],5) => 4
[1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5) => 4
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 6
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => ([(0,1),(2,3),(2,4),(3,4)],5) => 6
[1,1,1,1,0,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => ([(0,1),(2,3),(2,4),(3,4)],5) => 6
[1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => 6
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [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) => 8
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => ([],6) => 0
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => [2,3,4,5,1,6] => ([(1,5),(2,5),(3,5),(4,5)],6) => 4
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,3,4,5,6,2] => ([(1,5),(2,5),(3,5),(4,5)],6) => 4
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,1,0,1,0,0,0,1,0] => [5,2,3,4,1,6] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 6
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,6,3,4,5,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 6
[1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6] => ([(4,5)],6) => 2
[1,1,0,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => ([(4,5)],6) => 2
[1,1,0,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => ([(4,5)],6) => 2
[1,1,0,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => ([(4,5)],6) => 2
[1,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => ([(4,5)],6) => 2
[1,1,1,0,0,0,1,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => [3,2,1,4,5,6] => ([(3,4),(3,5),(4,5)],6) => 4
[1,1,1,0,0,1,0,0,1,0,1,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [2,1,4,3,5,6] => ([(2,5),(3,4)],6) => 4
[1,1,1,0,0,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [2,1,3,5,4,6] => ([(2,5),(3,4)],6) => 4
[1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => [2,1,3,4,6,5] => ([(2,5),(3,4)],6) => 4
[1,1,1,0,1,0,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => ([(3,4),(3,5),(4,5)],6) => 4
[1,1,1,0,1,0,0,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => ([(2,5),(3,4)],6) => 4
[1,1,1,0,1,0,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => ([(2,5),(3,4)],6) => 4
[1,1,1,0,1,0,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => ([(3,4),(3,5),(4,5)],6) => 4
[1,1,1,0,1,0,1,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => ([(2,5),(3,4)],6) => 4
[1,1,1,0,1,0,1,0,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => ([(3,4),(3,5),(4,5)],6) => 4
[1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => [4,3,2,1,5,6] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 6
[1,1,1,1,0,0,0,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [3,2,1,5,4,6] => ([(1,2),(3,4),(3,5),(4,5)],6) => 6
[1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => [3,2,1,4,6,5] => ([(1,2),(3,4),(3,5),(4,5)],6) => 6
[1,1,1,1,0,0,1,0,0,0,1,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [2,1,5,4,3,6] => ([(1,2),(3,4),(3,5),(4,5)],6) => 6
[1,1,1,1,0,0,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [2,1,4,3,6,5] => ([(0,5),(1,4),(2,3)],6) => 6
[1,1,1,1,0,0,1,0,1,0,0,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => [2,1,3,6,5,4] => ([(1,2),(3,4),(3,5),(4,5)],6) => 6
[1,1,1,1,0,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,5,4,3,2,6] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 6
[1,1,1,1,0,1,0,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => ([(1,2),(3,4),(3,5),(4,5)],6) => 6
[1,1,1,1,0,1,0,0,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => ([(1,2),(3,4),(3,5),(4,5)],6) => 6
[1,1,1,1,0,1,0,1,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 6
[1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => [5,4,3,2,1,6] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 8
[1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [4,3,2,1,6,5] => ([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 8
[1,1,1,1,1,0,0,0,1,0,0,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => [3,2,1,6,5,4] => ([(0,4),(0,5),(1,2),(1,3),(2,3),(4,5)],6) => 8
[1,1,1,1,1,0,0,1,0,0,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,5,4,3] => ([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 8
[1,1,1,1,1,0,1,0,0,0,0,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,6,5,4,3,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => 8
[1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [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) => 10
[1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6,7] => ([],7) => 0
[1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0,1,0,1,0] => [2,3,4,5,1,6,7] => ([(2,6),(3,6),(4,6),(5,6)],7) => 4
[1,0,1,0,1,0,1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,1,0,1,0,0,1,0] => [1,3,4,5,6,2,7] => ([(2,6),(3,6),(4,6),(5,6)],7) => 4
[1,0,1,0,1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,1,0,1,0,1,0,0] => [1,2,4,5,6,7,3] => ([(2,6),(3,6),(4,6),(5,6)],7) => 4
[1,0,1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,0,0,0,1,0,1,0] => [5,2,3,4,1,6,7] => ([(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 6
[1,0,1,0,1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,1,0,1,0,0,0,1,0] => [1,6,3,4,5,2,7] => ([(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 6
[1,0,1,0,1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,1,0,1,0,0,0] => [1,2,7,4,5,6,3] => ([(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 6
[1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6,7] => ([(5,6)],7) => 2
[1,1,0,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,0,1,1,0,1,0,1,0,1,0,0] => [2,1,4,5,6,7,3] => ([(0,1),(2,6),(3,6),(4,6),(5,6)],7) => 6
[1,1,0,0,1,0,1,1,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,1,0,1,0,0,0] => [2,1,7,4,5,6,3] => ([(0,1),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 8
[1,1,0,1,0,0,1,0,1,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => [1,3,2,4,5,6,7] => ([(5,6)],7) => 2
[1,1,0,1,0,1,0,0,1,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => [1,2,4,3,5,6,7] => ([(5,6)],7) => 2
[1,1,0,1,0,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,3,5,4,6,7] => ([(5,6)],7) => 2
[1,1,0,1,0,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,4,6,5,7] => ([(5,6)],7) => 2
[1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,5,7,6] => ([(5,6)],7) => 2
[1,1,0,1,0,1,0,1,1,0,0,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,1,0,0] => [2,3,4,5,1,7,6] => ([(0,1),(2,6),(3,6),(4,6),(5,6)],7) => 6
[1,1,0,1,0,1,1,1,0,0,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0,1,1,0,0] => [5,2,3,4,1,7,6] => ([(0,1),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => 8
[1,1,1,0,0,0,1,0,1,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0] => [3,2,1,4,5,6,7] => ([(4,5),(4,6),(5,6)],7) => 4
[1,1,1,0,0,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0] => [2,1,4,3,5,6,7] => ([(3,6),(4,5)],7) => 4
[1,1,1,0,0,1,0,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => [2,1,3,5,4,6,7] => ([(3,6),(4,5)],7) => 4
[1,1,1,0,0,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => [2,1,3,4,6,5,7] => ([(3,6),(4,5)],7) => 4
[1,1,1,0,0,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => [2,1,3,4,5,7,6] => ([(3,6),(4,5)],7) => 4
[1,1,1,0,0,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,1,1,0,0,1,1,0,0,0] => [3,2,5,4,7,6,1] => ([(0,5),(0,6),(1,4),(1,6),(2,3),(2,6),(3,6),(4,6),(5,6)],7) => 10
[1,1,1,0,1,0,0,0,1,0,1,0,1,0] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0] => [1,4,3,2,5,6,7] => ([(4,5),(4,6),(5,6)],7) => 4
[1,1,1,0,1,0,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0] => [1,3,2,5,4,6,7] => ([(3,6),(4,5)],7) => 4
[1,1,1,0,1,0,0,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0] => [1,3,2,4,6,5,7] => ([(3,6),(4,5)],7) => 4
[1,1,1,0,1,0,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0] => [1,3,2,4,5,7,6] => ([(3,6),(4,5)],7) => 4
[1,1,1,0,1,0,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0] => [1,2,5,4,3,6,7] => ([(4,5),(4,6),(5,6)],7) => 4
[1,1,1,0,1,0,1,0,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0] => [1,2,4,3,6,5,7] => ([(3,6),(4,5)],7) => 4
[1,1,1,0,1,0,1,0,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0] => [1,2,4,3,5,7,6] => ([(3,6),(4,5)],7) => 4
[1,1,1,0,1,0,1,0,1,0,0,0,1,0] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,3,6,5,4,7] => ([(4,5),(4,6),(5,6)],7) => 4
[1,1,1,0,1,0,1,0,1,0,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,3,5,4,7,6] => ([(3,6),(4,5)],7) => 4
>>> Load all 145 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 energy of a graph, if it is integral.
The energy of a graph is the sum of the absolute values of its eigenvalues. This statistic is only defined for graphs with integral energy. It is known, that the energy is never an odd integer [2]. In fact, it is never the square root of an odd integer [3].
The energy of a graph is the sum of the energies of the connected components of a graph. The energy of the complete graph $K_n$ equals $2n-2$. For this reason, we do not define the energy of the empty graph.
The energy of a graph is the sum of the absolute values of its eigenvalues. This statistic is only defined for graphs with integral energy. It is known, that the energy is never an odd integer [2]. In fact, it is never the square root of an odd integer [3].
The energy of a graph is the sum of the energies of the connected components of a graph. The energy of the complete graph $K_n$ equals $2n-2$. For this reason, we do not define the energy of the empty graph.
Map
switch returns and last double rise
Description
An alternative to the Adin-Bagno-Roichman transformation of a Dyck path.
This is a bijection preserving the number of up steps before each peak and exchanging the number of components with the position of the last double rise.
This is a bijection preserving the number of up steps before each peak and exchanging the number of components with the position of the last double rise.
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.
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!