searching the database
Your data matches 379 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St001274
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
St001274: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> 0
[1,0,1,0]
=> 1
[1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> 2
Description
The number of indecomposable injective modules with projective dimension equal to two.
Matching statistic: St000237
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00023: Dyck paths āto non-crossing permutationā¶ Permutations
Mp00239: Permutations āCorteelā¶ Permutations
St000237: Permutations ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00239: Permutations āCorteelā¶ Permutations
St000237: Permutations ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0
[1,0,1,0]
=> [1,2] => [1,2] => 0
[1,1,0,0]
=> [2,1] => [2,1] => 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => 1
[1,1,0,1,0,0]
=> [2,3,1] => [3,2,1] => 0
[1,1,1,0,0,0]
=> [3,2,1] => [2,3,1] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,3,2] => 0
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,3,4,2] => 2
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,2,1,4] => 0
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,2,3,1] => 0
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,2,4,1] => 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,3,1,4] => 2
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [2,4,3,1] => 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,3,4,1] => 3
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [3,4,1,2] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,4,5,3] => 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,4,3,5,2] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,3,4,2,5] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,3,5,4,2] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,3,4,5,2] => 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,4,5,2,3] => 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,4,5,3] => 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => 0
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => 0
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [4,2,3,5,1] => 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,2,4,1,5] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [3,2,5,4,1] => 0
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,2,4,5,1] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [4,2,5,1,3] => 0
Description
The number of small exceedances.
This is the number of indices $i$ such that $\pi_i=i+1$.
Matching statistic: St001479
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
Mp00100: Dyck paths ātouch compositionā¶ Integer compositions
Mp00184: Integer compositions āto threshold graphā¶ Graphs
St001479: Graphs ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00100: Dyck paths ātouch compositionā¶ Integer compositions
Mp00184: Integer compositions āto threshold graphā¶ Graphs
St001479: Graphs ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => ([],1)
=> 0
[1,0,1,0]
=> [1,0,1,0]
=> [1,1] => ([(0,1)],2)
=> 1
[1,1,0,0]
=> [1,1,0,0]
=> [2] => ([],2)
=> 0
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 0
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,2] => ([(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> 2
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,2] => ([(1,2)],3)
=> 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [3] => ([],3)
=> 0
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 0
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 0
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => ([(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => ([(2,3)],4)
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => ([(2,3)],4)
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => ([],4)
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => ([(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => ([(2,4),(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,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => ([(3,4)],5)
=> 1
Description
The number of bridges of a graph.
A bridge is an edge whose removal increases the number of connected components of the graph.
Matching statistic: St001615
Mp00025: Dyck paths āto 132-avoiding permutationā¶ Permutations
Mp00065: Permutations āpermutation posetā¶ Posets
Mp00206: Posets āantichains of maximal sizeā¶ Lattices
St001615: Lattices ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00065: Permutations āpermutation posetā¶ Posets
Mp00206: Posets āantichains of maximal sizeā¶ Lattices
St001615: Lattices ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 0
[1,0,1,0]
=> [2,1] => ([],2)
=> ([],1)
=> 0
[1,1,0,0]
=> [1,2] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,0]
=> [3,2,1] => ([],3)
=> ([],1)
=> 0
[1,0,1,1,0,0]
=> [2,3,1] => ([(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0]
=> [3,1,2] => ([(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,0,1,0,0]
=> [2,1,3] => ([(0,2),(1,2)],3)
=> ([],1)
=> 0
[1,1,1,0,0,0]
=> [1,2,3] => ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 2
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([],4)
=> ([],1)
=> 0
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => ([(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(1,2),(2,3)],4)
=> ([(0,2),(2,1)],3)
=> 2
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,3),(1,2)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => ([(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(1,2),(2,3)],4)
=> ([(0,2),(2,1)],3)
=> 2
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => ([(0,3),(1,3),(3,2)],4)
=> ([],1)
=> 0
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 3
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([],5)
=> ([],1)
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => ([(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => ([(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => ([(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(2,3),(3,4)],5)
=> ([(0,2),(2,1)],3)
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => ([(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(1,4),(2,3)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => ([(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => ([(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => ([(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(2,3),(3,4)],5)
=> ([(0,2),(2,1)],3)
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => ([(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => ([(1,4),(2,4),(4,3)],5)
=> ([],1)
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(1,4),(3,2),(4,3)],5)
=> ([(0,3),(2,1),(3,2)],4)
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(1,4),(2,3)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(1,4),(2,3)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => ([(0,4),(1,4),(2,3)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(1,4),(4,2)],5)
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => ([(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => ([(0,4),(1,4),(2,3)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => ([(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => ([(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => ([(0,4),(1,3),(2,3),(3,4)],5)
=> ([],1)
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(0,2),(2,1)],3)
=> 2
Description
The number of join prime elements of a lattice.
An element $x$ of a lattice $L$ is join-prime (or coprime) if $x \leq a \vee b$ implies $x \leq a$ or $x \leq b$ for every $a, b \in L$.
Matching statistic: St001617
Mp00025: Dyck paths āto 132-avoiding permutationā¶ Permutations
Mp00065: Permutations āpermutation posetā¶ Posets
Mp00206: Posets āantichains of maximal sizeā¶ Lattices
St001617: Lattices ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00065: Permutations āpermutation posetā¶ Posets
Mp00206: Posets āantichains of maximal sizeā¶ Lattices
St001617: Lattices ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 0
[1,0,1,0]
=> [2,1] => ([],2)
=> ([],1)
=> 0
[1,1,0,0]
=> [1,2] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,0]
=> [3,2,1] => ([],3)
=> ([],1)
=> 0
[1,0,1,1,0,0]
=> [2,3,1] => ([(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0]
=> [3,1,2] => ([(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,0,1,0,0]
=> [2,1,3] => ([(0,2),(1,2)],3)
=> ([],1)
=> 0
[1,1,1,0,0,0]
=> [1,2,3] => ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 2
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([],4)
=> ([],1)
=> 0
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => ([(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(1,2),(2,3)],4)
=> ([(0,2),(2,1)],3)
=> 2
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,3),(1,2)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => ([(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(1,2),(2,3)],4)
=> ([(0,2),(2,1)],3)
=> 2
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => ([(0,3),(1,3),(3,2)],4)
=> ([],1)
=> 0
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 3
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([],5)
=> ([],1)
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => ([(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => ([(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => ([(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(2,3),(3,4)],5)
=> ([(0,2),(2,1)],3)
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => ([(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(1,4),(2,3)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => ([(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => ([(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => ([(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(2,3),(3,4)],5)
=> ([(0,2),(2,1)],3)
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => ([(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => ([(1,4),(2,4),(4,3)],5)
=> ([],1)
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(1,4),(3,2),(4,3)],5)
=> ([(0,3),(2,1),(3,2)],4)
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(1,4),(2,3)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(1,4),(2,3)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => ([(0,4),(1,4),(2,3)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(1,4),(4,2)],5)
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => ([(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => ([(0,4),(1,4),(2,3)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => ([(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => ([(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => ([(0,4),(1,3),(2,3),(3,4)],5)
=> ([],1)
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(0,2),(2,1)],3)
=> 2
Description
The dimension of the space of valuations of a lattice.
A valuation, or modular function, on a lattice $L$ is a function $v:L\mapsto\mathbb R$ satisfying
$$
v(a\vee b) + v(a\wedge b) = v(a) + v(b).
$$
It was shown by Birkhoff [1, thm. X.2], that a lattice with a positive valuation must be modular. This was sharpened by Fleischer and Traynor [2, thm. 1], which states that the modular functions on an arbitrary lattice are in bijection with the modular functions on its modular quotient [[Mp00196]].
Moreover, Birkhoff [1, thm. X.2] showed that the dimension of the space of modular functions equals the number of subsets of projective prime intervals.
Matching statistic: St001622
Mp00025: Dyck paths āto 132-avoiding permutationā¶ Permutations
Mp00065: Permutations āpermutation posetā¶ Posets
Mp00206: Posets āantichains of maximal sizeā¶ Lattices
St001622: Lattices ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00065: Permutations āpermutation posetā¶ Posets
Mp00206: Posets āantichains of maximal sizeā¶ Lattices
St001622: Lattices ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 0
[1,0,1,0]
=> [2,1] => ([],2)
=> ([],1)
=> 0
[1,1,0,0]
=> [1,2] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,0]
=> [3,2,1] => ([],3)
=> ([],1)
=> 0
[1,0,1,1,0,0]
=> [2,3,1] => ([(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0]
=> [3,1,2] => ([(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,0,1,0,0]
=> [2,1,3] => ([(0,2),(1,2)],3)
=> ([],1)
=> 0
[1,1,1,0,0,0]
=> [1,2,3] => ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 2
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([],4)
=> ([],1)
=> 0
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => ([(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(1,2),(2,3)],4)
=> ([(0,2),(2,1)],3)
=> 2
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,3),(1,2)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => ([(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => ([(0,3),(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(1,2),(2,3)],4)
=> ([(0,2),(2,1)],3)
=> 2
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => ([(0,3),(1,3),(3,2)],4)
=> ([],1)
=> 0
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 3
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([],5)
=> ([],1)
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => ([(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => ([(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => ([(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(2,3),(3,4)],5)
=> ([(0,2),(2,1)],3)
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => ([(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(1,4),(2,3)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => ([(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => ([(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => ([(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(2,3),(3,4)],5)
=> ([(0,2),(2,1)],3)
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => ([(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => ([(1,4),(2,4),(4,3)],5)
=> ([],1)
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(1,4),(3,2),(4,3)],5)
=> ([(0,3),(2,1),(3,2)],4)
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(1,4),(2,3)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(1,4),(2,3)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => ([(0,4),(1,4),(2,3)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(1,4),(4,2)],5)
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => ([(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => ([(0,4),(1,4),(2,3)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => ([(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => ([(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => ([(0,4),(1,3),(2,3),(3,4)],5)
=> ([],1)
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => ([(0,4),(1,2),(2,3),(3,4)],5)
=> ([(0,2),(2,1)],3)
=> 2
Description
The number of join-irreducible elements of a lattice.
An element $j$ of a lattice $L$ is '''join irreducible''' if it is not the least element and if $j=x\vee y$, then $j\in\{x,y\}$ for all $x,y\in L$.
Matching statistic: St001640
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00031: Dyck paths āto 312-avoiding permutationā¶ Permutations
Mp00067: Permutations āFoata bijectionā¶ Permutations
Mp00254: Permutations āInverse fireworks mapā¶ Permutations
St001640: Permutations ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00067: Permutations āFoata bijectionā¶ Permutations
Mp00254: Permutations āInverse fireworks mapā¶ Permutations
St001640: Permutations ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1] => 0
[1,0,1,0]
=> [1,2] => [1,2] => [1,2] => 1
[1,1,0,0]
=> [2,1] => [2,1] => [2,1] => 0
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,2,3] => 2
[1,0,1,1,0,0]
=> [1,3,2] => [3,1,2] => [3,1,2] => 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => [2,1,3] => 1
[1,1,0,1,0,0]
=> [2,3,1] => [2,3,1] => [1,3,2] => 0
[1,1,1,0,0,0]
=> [3,2,1] => [3,2,1] => [3,2,1] => 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 3
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [4,1,2,3] => [4,1,2,3] => 2
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [3,1,2,4] => [3,1,2,4] => 2
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,1,4,2] => [2,1,4,3] => 0
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [4,3,1,2] => [4,3,1,2] => 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 2
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [4,2,1,3] => [4,2,1,3] => 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [2,3,1,4] => [1,3,2,4] => 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [2,3,4,1] => [1,2,4,3] => 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [4,2,3,1] => [4,1,3,2] => 0
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [3,2,1,4] => [3,2,1,4] => 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [3,2,4,1] => [2,1,4,3] => 0
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => [3,4,2,1] => [1,4,3,2] => 0
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 4
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [5,1,2,3,4] => [5,1,2,3,4] => 3
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [4,1,2,3,5] => [4,1,2,3,5] => 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [4,1,2,5,3] => [3,1,2,5,4] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [5,4,1,2,3] => [5,4,1,2,3] => 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [3,1,2,4,5] => [3,1,2,4,5] => 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [5,3,1,2,4] => [5,3,1,2,4] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,1,4,2,5] => [2,1,4,3,5] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [3,1,4,5,2] => [2,1,3,5,4] => 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [5,3,1,4,2] => [5,2,1,4,3] => 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [4,3,1,2,5] => [4,3,1,2,5] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [4,3,1,5,2] => [3,2,1,5,4] => 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => [4,5,1,3,2] => [2,5,1,4,3] => 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [5,4,3,1,2] => [5,4,3,1,2] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => 3
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [5,2,1,3,4] => [5,2,1,3,4] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [4,2,1,3,5] => [4,2,1,3,5] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [4,2,1,5,3] => [3,2,1,5,4] => 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [5,4,2,1,3] => [5,4,2,1,3] => 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [2,3,1,4,5] => [1,3,2,4,5] => 2
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [5,2,3,1,4] => [5,1,3,2,4] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [2,3,4,1,5] => [1,2,4,3,5] => 2
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [2,3,4,5,1] => [1,2,3,5,4] => 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [5,2,3,4,1] => [5,1,2,4,3] => 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [4,2,3,1,5] => [4,1,3,2,5] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [4,2,3,5,1] => [3,1,2,5,4] => 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => [4,2,5,3,1] => [2,1,5,4,3] => 0
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [5,4,2,3,1] => [5,4,1,3,2] => 0
Description
The number of ascent tops in the permutation such that all smaller elements appear before.
Matching statistic: St001826
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
Mp00100: Dyck paths ātouch compositionā¶ Integer compositions
Mp00184: Integer compositions āto threshold graphā¶ Graphs
St001826: Graphs ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00100: Dyck paths ātouch compositionā¶ Integer compositions
Mp00184: Integer compositions āto threshold graphā¶ Graphs
St001826: Graphs ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => ([],1)
=> 0
[1,0,1,0]
=> [1,0,1,0]
=> [1,1] => ([(0,1)],2)
=> 1
[1,1,0,0]
=> [1,1,0,0]
=> [2] => ([],2)
=> 0
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 0
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,2] => ([(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> 2
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,2] => ([(1,2)],3)
=> 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [3] => ([],3)
=> 0
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 0
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 0
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => ([(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => ([(2,3)],4)
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => ([(2,3)],4)
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => ([],4)
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => ([(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => ([(2,4),(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,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => ([(3,4)],5)
=> 1
Description
The maximal number of leaves on a vertex of a graph.
Matching statistic: St000011
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
Mp00032: Dyck paths āinverse zeta mapā¶ Dyck paths
Mp00228: Dyck paths āreflect parallelogram polyominoā¶ Dyck paths
St000011: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00032: Dyck paths āinverse zeta mapā¶ Dyck paths
Mp00228: Dyck paths āreflect parallelogram polyominoā¶ Dyck paths
St000011: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 1 + 1
Description
The number of touch points (or returns) of a Dyck path.
This is the number of points, excluding the origin, where the Dyck path has height 0.
Matching statistic: St000026
Mp00099: Dyck paths ābounce pathā¶ Dyck paths
Mp00229: Dyck paths āDelest-Viennotā¶ Dyck paths
Mp00121: Dyck paths āCori-Le Borgne involutionā¶ Dyck paths
St000026: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Mp00229: Dyck paths āDelest-Viennotā¶ Dyck paths
Mp00121: Dyck paths āCori-Le Borgne involutionā¶ Dyck paths
St000026: Dyck paths ā¶ ā¤Result quality: 100% āvalues known / values provided: 100%ādistinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> 2 = 1 + 1
[1,1,0,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2 = 1 + 1
Description
The position of the first return of a Dyck path.
The following 369 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000053The number of valleys of the Dyck path. St000991The number of right-to-left minima of a permutation. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St000203The number of external nodes of a binary tree. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St000502The number of successions of a set partitions. St000504The cardinality of the first block of a set partition. St000031The number of cycles in the cycle decomposition of a permutation. St000306The bounce count of a Dyck path. St000069The number of maximal elements of a poset. St000654The first descent of a permutation. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St000052The number of valleys of a Dyck path not on the x-axis. St000326The position of the first one in a binary word after appending a 1 at the end. St000711The number of big exceedences of a permutation. St000297The number of leading ones in a binary word. St000932The number of occurrences of the pattern UDU in a Dyck path. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St000382The first part of an integer composition. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000117The number of centered tunnels of a Dyck path. St000921The number of internal inversions of a binary word. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001910The height of the middle non-run of a Dyck path. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000681The Grundy value of Chomp on Ferrers diagrams. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001280The number of parts of an integer partition that are at least two. St001432The order dimension of the partition. St000873The aix statistic of a permutation. St000215The number of adjacencies of a permutation, zero appended. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St000068The number of minimal elements in a poset. St000444The length of the maximal rise of a Dyck path. St000895The number of ones on the main diagonal of an alternating sign matrix. St000989The number of final rises of a permutation. St000221The number of strong fixed points of a permutation. St000241The number of cyclical small excedances. St000338The number of pixed points of a permutation. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001061The number of indices that are both descents and recoils of a permutation. St000478Another weight of a partition according to Alladi. St000245The number of ascents of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000383The last part of an integer composition. St000996The number of exclusive left-to-right maxima of a permutation. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St000354The number of recoils of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St001489The maximum of the number of descents and the number of inverse descents. St000470The number of runs in a permutation. St000542The number of left-to-right-minima of a permutation. St000619The number of cyclic descents of a permutation. St000260The radius of a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000871The number of very big ascents of a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000742The number of big ascents of a permutation after prepending zero. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St000137The Grundy value of an integer partition. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001587Half of the largest even part of an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000993The multiplicity of the largest part of an integer partition. St000442The maximal area to the right of an up step of a Dyck path. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000658The number of rises of length 2 of a Dyck path. St000674The number of hills of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000693The modular (standard) major index of a standard tableau. St000744The length of the path to the largest entry in a standard Young tableau. St000946The sum of the skew hook positions in a Dyck path. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{nā1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001480The number of simple summands of the module J^2/J^3. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St000648The number of 2-excedences of a permutation. St000234The number of global ascents of a permutation. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000668The least common multiple of the parts of the partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000708The product of the parts of an integer partition. St000929The constant term of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000941The number of characters of the symmetric group whose value on the partition is even. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001128The exponens consonantiae of a partition. St000352The Elizalde-Pak rank of a permutation. St000007The number of saliances of the permutation. St000441The number of successions of a permutation. St000287The number of connected components of a graph. St000247The number of singleton blocks of a set partition. St000475The number of parts equal to 1 in a partition. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St000546The number of global descents of a permutation. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000732The number of double deficiencies of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000703The number of deficiencies of a permutation. St000451The length of the longest pattern of the form k 1 2. St000454The largest eigenvalue of a graph if it is integral. St001062The maximal size of a block of a set partition. St000308The height of the tree associated to a permutation. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001557The number of inversions of the second entry of a permutation. St001811The Castelnuovo-Mumford regularity of a permutation. St001948The number of augmented double ascents of a permutation. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000259The diameter of a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St000314The number of left-to-right-maxima of a permutation. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St000456The monochromatic index of a connected graph. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St000015The number of peaks of a Dyck path. St001461The number of topologically connected components of the chord diagram of a permutation. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St000021The number of descents of a permutation. St000039The number of crossings of a permutation. St000083The number of left oriented leafs of a binary tree except the first one. St000121The number of occurrences of the contiguous pattern [.,[.,[.,[.,.]]]] in a binary tree. St000155The number of exceedances (also excedences) of a permutation. St000292The number of ascents of a binary word. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St000061The number of nodes on the left branch of a binary tree. St000062The length of the longest increasing subsequence of the permutation. St000084The number of subtrees. St000157The number of descents of a standard tableau. St000164The number of short pairs. St000239The number of small weak excedances. St000291The number of descents of a binary word. St000325The width of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000331The number of upper interactions of a Dyck path. St000390The number of runs of ones in a binary word. St000443The number of long tunnels of a Dyck path. St000990The first ascent of a permutation. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St000236The number of cyclical small weak excedances. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001180Number of indecomposable injective modules with projective dimension at most 1. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St000686The finitistic dominant dimension of a Dyck path. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St000646The number of big ascents of a permutation. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000837The number of ascents of distance 2 of a permutation. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000460The hook length of the last cell along the main diagonal of an integer partition. St000667The greatest common divisor of the parts of the partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001389The number of partitions of the same length below the given integer partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001525The number of symmetric hooks on the diagonal of a partition. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001933The largest multiplicity of a part in an integer partition. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001118The acyclic chromatic index of a graph. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000080The rank of the poset. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St000528The height of a poset. St000907The number of maximal antichains of minimal length in a poset. St000911The number of maximal antichains of maximal size in a poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001782The order of rowmotion on the set of order ideals of a poset. St001651The Frankl number of a lattice. St000439The position of the first down step of a Dyck path. St001596The number of two-by-two squares inside a skew partition. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000225Difference between largest and smallest parts in a partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000618The number of self-evacuating tableaux of given shape. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000781The number of proper colouring schemes of a Ferrers diagram. St001175The size of a partition minus the hook length of the base cell. St001176The size of a partition minus its first part. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001383The BG-rank of an integer partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001568The smallest positive integer that does not appear twice in the partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001657The number of twos in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001961The sum of the greatest common divisors of all pairs of parts. St000145The Dyson rank of a partition. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000054The first entry of the permutation. St000455The second largest eigenvalue of a graph if it is integral. St000284The Plancherel distribution on integer partitions. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000706The product of the factorials of the multiplicities of an integer partition. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000928The sum of the coefficients of the character polynomial of an integer partition. St000934The 2-degree of an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000944The 3-degree of an integer partition. St001248Sum of the even parts of a partition. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St001712The number of natural descents of a standard Young tableau. St000066The column of the unique '1' in the first row of the alternating sign matrix. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000940The number of characters of the symmetric group whose value on the partition is zero. St001889The size of the connectivity set of a signed permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001862The number of crossings of a signed permutation. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001618The cardinality of the Frattini sublattice of a lattice. St001060The distinguishing index of a graph. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000649The number of 3-excedences of a permutation. St001403The number of vertical separators in a permutation. St000740The last entry of a permutation. St001566The length of the longest arithmetic progression in a permutation. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000910The number of maximal chains of minimal length in a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001613The binary logarithm of the size of the center of a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001330The hat guessing number of a graph. St000022The number of fixed points of a permutation. St000295The length of the border of a binary word. St000567The sum of the products of all pairs of parts. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001050The number of terminal closers of a set partition. St000505The biggest entry in the block containing the 1. St000971The smallest closer of a set partition. St000392The length of the longest run of ones in a binary word. St000982The length of the longest constant subword. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001462The number of factors of a standard tableaux under concatenation. St001730The number of times the path corresponding to a binary word crosses the base line. St000942The number of critical left to right maxima of the parking functions. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001904The length of the initial strictly increasing segment of a parking function. St001937The size of the center of a parking function. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000461The rix statistic of a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000894The trace of an alternating sign matrix. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000702The number of weak deficiencies of a permutation. St000710The number of big deficiencies of a permutation. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{nā1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001434The number of negative sum pairs of a signed permutation. St000051The size of the left subtree of a binary tree. St000200The row of the unique '1' in the last column of the alternating sign matrix. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St000056The decomposition (or block) number of a permutation. St000335The difference of lower and upper interactions. St000838The number of terminal right-hand endpoints when the vertices are written in order. St001133The smallest label in the subtree rooted at the sister of 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001134The largest label in the subtree rooted at the sister of 1 in the leaf labelled binary unordered tree associated with the perfect matching. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001372The length of a longest cyclic run of ones of a binary word. St001530The depth of a Dyck path. St000025The number of initial rises of a Dyck path. St000675The number of centered multitunnels of a Dyck path. St000738The first entry in the last row of a standard tableau. St001621The number of atoms of a lattice. St000534The number of 2-rises of a permutation. St001115The number of even descents of a permutation. St000035The number of left outer peaks of a permutation. St000647The number of big descents of a permutation. St000834The number of right outer peaks of a permutation. St001096The size of the overlap set of a permutation.
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!