Identifier
-
Mp00152:
Graphs
—Laplacian multiplicities⟶
Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000015: Dyck paths ⟶ ℤ (values match St000053The number of valleys of the Dyck path., St001068Number of torsionless simple modules in the corresponding Nakayama algebra., St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra.)
Values
([],1) => [1] => [1,0] => [1,1,0,0] => 1
([],2) => [2] => [1,1,0,0] => [1,1,1,0,0,0] => 1
([(0,1)],2) => [1,1] => [1,0,1,0] => [1,1,0,1,0,0] => 2
([],3) => [3] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => 1
([(1,2)],3) => [1,2] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => 2
([(0,2),(1,2)],3) => [1,1,1] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => 3
([(0,1),(0,2),(1,2)],3) => [2,1] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 2
([],4) => [4] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => 1
([(2,3)],4) => [1,3] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => 2
([(1,3),(2,3)],4) => [1,1,2] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => 3
([(0,3),(1,3),(2,3)],4) => [1,2,1] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => 3
([(0,3),(1,2)],4) => [2,2] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => 2
([(0,3),(1,2),(2,3)],4) => [1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 4
([(1,2),(1,3),(2,3)],4) => [2,2] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => 2
([(0,3),(1,2),(1,3),(2,3)],4) => [1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 4
([(0,2),(0,3),(1,2),(1,3)],4) => [1,2,1] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => 3
([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [2,1,1] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => 3
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [3,1] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => 2
([],5) => [5] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => 1
([(3,4)],5) => [1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => 2
([(2,4),(3,4)],5) => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => 3
([(1,4),(2,4),(3,4)],5) => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => 3
([(0,4),(1,4),(2,4),(3,4)],5) => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => 3
([(1,4),(2,3)],5) => [2,3] => [1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => 2
([(1,4),(2,3),(3,4)],5) => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 4
([(0,1),(2,4),(3,4)],5) => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 4
([(2,3),(2,4),(3,4)],5) => [2,3] => [1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => 2
([(0,4),(1,4),(2,3),(3,4)],5) => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 5
([(1,4),(2,3),(2,4),(3,4)],5) => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 4
([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => 4
([(1,3),(1,4),(2,3),(2,4)],5) => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5) => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 5
([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => 3
([(0,4),(1,3),(2,3),(2,4),(3,4)],5) => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 5
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 5
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5) => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => 4
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => 3
([(0,4),(1,3),(2,3),(2,4)],5) => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 5
([(0,1),(2,3),(2,4),(3,4)],5) => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => 3
([(0,3),(1,2),(1,4),(2,4),(3,4)],5) => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 5
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5) => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => 4
([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => 3
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5) => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 5
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5) => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 5
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5) => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 5
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [3,2] => [1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => 4
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5) => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 5
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5) => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => 3
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [4,1] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 2
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 number of peaks of a Dyck path.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
Laplacian multiplicities
Description
The composition of multiplicities of the Laplacian eigenvalues.
Let λ1>λ2>… be the eigenvalues of the Laplacian matrix of a graph on n vertices. Then this map returns the composition a1,…,ak of n where ai is the multiplicity of λi.
Let λ1>λ2>… be the eigenvalues of the Laplacian matrix of a graph on n vertices. Then this map returns the composition a1,…,ak of n where ai is the multiplicity of λi.
Map
bounce path
Description
The bounce path determined by an integer composition.
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!