Identifier
- St000953: Dyck paths ⟶ ℤ
Values
=>
Cc0005;cc-rep
[1,0]=>2
[1,0,1,0]=>2
[1,1,0,0]=>2
[1,0,1,0,1,0]=>4
[1,0,1,1,0,0]=>4
[1,1,0,0,1,0]=>4
[1,1,0,1,0,0]=>2
[1,1,1,0,0,0]=>4
[1,0,1,0,1,0,1,0]=>2
[1,0,1,0,1,1,0,0]=>2
[1,0,1,1,0,0,1,0]=>2
[1,0,1,1,0,1,0,0]=>4
[1,0,1,1,1,0,0,0]=>2
[1,1,0,0,1,0,1,0]=>2
[1,1,0,0,1,1,0,0]=>2
[1,1,0,1,0,0,1,0]=>4
[1,1,0,1,0,1,0,0]=>4
[1,1,0,1,1,0,0,0]=>4
[1,1,1,0,0,0,1,0]=>2
[1,1,1,0,0,1,0,0]=>4
[1,1,1,0,1,0,0,0]=>4
[1,1,1,1,0,0,0,0]=>2
[1,0,1,0,1,0,1,0,1,0]=>6
[1,0,1,0,1,0,1,1,0,0]=>6
[1,0,1,0,1,1,0,0,1,0]=>6
[1,0,1,0,1,1,0,1,0,0]=>4
[1,0,1,0,1,1,1,0,0,0]=>6
[1,0,1,1,0,0,1,0,1,0]=>6
[1,0,1,1,0,0,1,1,0,0]=>6
[1,0,1,1,0,1,0,0,1,0]=>4
[1,0,1,1,0,1,0,1,0,0]=>4
[1,0,1,1,0,1,1,0,0,0]=>4
[1,0,1,1,1,0,0,0,1,0]=>6
[1,0,1,1,1,0,0,1,0,0]=>4
[1,0,1,1,1,0,1,0,0,0]=>4
[1,0,1,1,1,1,0,0,0,0]=>6
[1,1,0,0,1,0,1,0,1,0]=>6
[1,1,0,0,1,0,1,1,0,0]=>6
[1,1,0,0,1,1,0,0,1,0]=>6
[1,1,0,0,1,1,0,1,0,0]=>4
[1,1,0,0,1,1,1,0,0,0]=>6
[1,1,0,1,0,0,1,0,1,0]=>4
[1,1,0,1,0,0,1,1,0,0]=>4
[1,1,0,1,0,1,0,0,1,0]=>4
[1,1,0,1,0,1,0,1,0,0]=>4
[1,1,0,1,0,1,1,0,0,0]=>4
[1,1,0,1,1,0,0,0,1,0]=>4
[1,1,0,1,1,0,0,1,0,0]=>2
[1,1,0,1,1,0,1,0,0,0]=>4
[1,1,0,1,1,1,0,0,0,0]=>4
[1,1,1,0,0,0,1,0,1,0]=>6
[1,1,1,0,0,0,1,1,0,0]=>6
[1,1,1,0,0,1,0,0,1,0]=>4
[1,1,1,0,0,1,0,1,0,0]=>4
[1,1,1,0,0,1,1,0,0,0]=>4
[1,1,1,0,1,0,0,0,1,0]=>4
[1,1,1,0,1,0,0,1,0,0]=>4
[1,1,1,0,1,0,1,0,0,0]=>4
[1,1,1,0,1,1,0,0,0,0]=>4
[1,1,1,1,0,0,0,0,1,0]=>6
[1,1,1,1,0,0,0,1,0,0]=>4
[1,1,1,1,0,0,1,0,0,0]=>4
[1,1,1,1,0,1,0,0,0,0]=>4
[1,1,1,1,1,0,0,0,0,0]=>6
[1,0,1,0,1,0,1,0,1,0,1,0]=>4
[1,0,1,0,1,0,1,0,1,1,0,0]=>4
[1,0,1,0,1,0,1,1,0,0,1,0]=>4
[1,0,1,0,1,0,1,1,0,1,0,0]=>4
[1,0,1,0,1,0,1,1,1,0,0,0]=>4
[1,0,1,0,1,1,0,0,1,0,1,0]=>4
[1,0,1,0,1,1,0,0,1,1,0,0]=>4
[1,0,1,0,1,1,0,1,0,0,1,0]=>6
[1,0,1,0,1,1,0,1,0,1,0,0]=>4
[1,0,1,0,1,1,0,1,1,0,0,0]=>6
[1,0,1,0,1,1,1,0,0,0,1,0]=>4
[1,0,1,0,1,1,1,0,0,1,0,0]=>4
[1,0,1,0,1,1,1,0,1,0,0,0]=>6
[1,0,1,0,1,1,1,1,0,0,0,0]=>4
[1,0,1,1,0,0,1,0,1,0,1,0]=>4
[1,0,1,1,0,0,1,0,1,1,0,0]=>4
[1,0,1,1,0,0,1,1,0,0,1,0]=>4
[1,0,1,1,0,0,1,1,0,1,0,0]=>4
[1,0,1,1,0,0,1,1,1,0,0,0]=>4
[1,0,1,1,0,1,0,0,1,0,1,0]=>6
[1,0,1,1,0,1,0,0,1,1,0,0]=>6
[1,0,1,1,0,1,0,1,0,0,1,0]=>4
[1,0,1,1,0,1,0,1,0,1,0,0]=>6
[1,0,1,1,0,1,0,1,1,0,0,0]=>4
[1,0,1,1,0,1,1,0,0,0,1,0]=>6
[1,0,1,1,0,1,1,0,0,1,0,0]=>6
[1,0,1,1,0,1,1,0,1,0,0,0]=>6
[1,0,1,1,0,1,1,1,0,0,0,0]=>6
[1,0,1,1,1,0,0,0,1,0,1,0]=>4
[1,0,1,1,1,0,0,0,1,1,0,0]=>4
[1,0,1,1,1,0,0,1,0,0,1,0]=>6
[1,0,1,1,1,0,0,1,0,1,0,0]=>4
[1,0,1,1,1,0,0,1,1,0,0,0]=>6
[1,0,1,1,1,0,1,0,0,0,1,0]=>2
[1,0,1,1,1,0,1,0,0,1,0,0]=>6
[1,0,1,1,1,0,1,0,1,0,0,0]=>6
[1,0,1,1,1,0,1,1,0,0,0,0]=>2
[1,0,1,1,1,1,0,0,0,0,1,0]=>4
[1,0,1,1,1,1,0,0,0,1,0,0]=>4
[1,0,1,1,1,1,0,0,1,0,0,0]=>6
[1,0,1,1,1,1,0,1,0,0,0,0]=>6
[1,0,1,1,1,1,1,0,0,0,0,0]=>4
[1,1,0,0,1,0,1,0,1,0,1,0]=>4
[1,1,0,0,1,0,1,0,1,1,0,0]=>4
[1,1,0,0,1,0,1,1,0,0,1,0]=>4
[1,1,0,0,1,0,1,1,0,1,0,0]=>4
[1,1,0,0,1,0,1,1,1,0,0,0]=>4
[1,1,0,0,1,1,0,0,1,0,1,0]=>4
[1,1,0,0,1,1,0,0,1,1,0,0]=>4
[1,1,0,0,1,1,0,1,0,0,1,0]=>6
[1,1,0,0,1,1,0,1,0,1,0,0]=>4
[1,1,0,0,1,1,0,1,1,0,0,0]=>6
[1,1,0,0,1,1,1,0,0,0,1,0]=>4
[1,1,0,0,1,1,1,0,0,1,0,0]=>4
[1,1,0,0,1,1,1,0,1,0,0,0]=>6
[1,1,0,0,1,1,1,1,0,0,0,0]=>4
[1,1,0,1,0,0,1,0,1,0,1,0]=>4
[1,1,0,1,0,0,1,0,1,1,0,0]=>4
[1,1,0,1,0,0,1,1,0,0,1,0]=>4
[1,1,0,1,0,0,1,1,0,1,0,0]=>2
[1,1,0,1,0,0,1,1,1,0,0,0]=>4
[1,1,0,1,0,1,0,0,1,0,1,0]=>4
[1,1,0,1,0,1,0,0,1,1,0,0]=>4
[1,1,0,1,0,1,0,1,0,0,1,0]=>6
[1,1,0,1,0,1,0,1,0,1,0,0]=>6
[1,1,0,1,0,1,0,1,1,0,0,0]=>6
[1,1,0,1,0,1,1,0,0,0,1,0]=>4
[1,1,0,1,0,1,1,0,0,1,0,0]=>2
[1,1,0,1,0,1,1,0,1,0,0,0]=>6
[1,1,0,1,0,1,1,1,0,0,0,0]=>4
[1,1,0,1,1,0,0,0,1,0,1,0]=>4
[1,1,0,1,1,0,0,0,1,1,0,0]=>4
[1,1,0,1,1,0,0,1,0,0,1,0]=>6
[1,1,0,1,1,0,0,1,0,1,0,0]=>2
[1,1,0,1,1,0,0,1,1,0,0,0]=>6
[1,1,0,1,1,0,1,0,0,0,1,0]=>6
[1,1,0,1,1,0,1,0,0,1,0,0]=>6
[1,1,0,1,1,0,1,0,1,0,0,0]=>2
[1,1,0,1,1,0,1,1,0,0,0,0]=>6
[1,1,0,1,1,1,0,0,0,0,1,0]=>4
[1,1,0,1,1,1,0,0,0,1,0,0]=>2
[1,1,0,1,1,1,0,0,1,0,0,0]=>6
[1,1,0,1,1,1,0,1,0,0,0,0]=>6
[1,1,0,1,1,1,1,0,0,0,0,0]=>4
[1,1,1,0,0,0,1,0,1,0,1,0]=>4
[1,1,1,0,0,0,1,0,1,1,0,0]=>4
[1,1,1,0,0,0,1,1,0,0,1,0]=>4
[1,1,1,0,0,0,1,1,0,1,0,0]=>4
[1,1,1,0,0,0,1,1,1,0,0,0]=>4
[1,1,1,0,0,1,0,0,1,0,1,0]=>6
[1,1,1,0,0,1,0,0,1,1,0,0]=>6
[1,1,1,0,0,1,0,1,0,0,1,0]=>4
[1,1,1,0,0,1,0,1,0,1,0,0]=>6
[1,1,1,0,0,1,0,1,1,0,0,0]=>4
[1,1,1,0,0,1,1,0,0,0,1,0]=>6
[1,1,1,0,0,1,1,0,0,1,0,0]=>6
[1,1,1,0,0,1,1,0,1,0,0,0]=>6
[1,1,1,0,0,1,1,1,0,0,0,0]=>6
[1,1,1,0,1,0,0,0,1,0,1,0]=>6
[1,1,1,0,1,0,0,0,1,1,0,0]=>6
[1,1,1,0,1,0,0,1,0,0,1,0]=>6
[1,1,1,0,1,0,0,1,0,1,0,0]=>6
[1,1,1,0,1,0,0,1,1,0,0,0]=>6
[1,1,1,0,1,0,1,0,0,0,1,0]=>6
[1,1,1,0,1,0,1,0,0,1,0,0]=>2
[1,1,1,0,1,0,1,0,1,0,0,0]=>6
[1,1,1,0,1,0,1,1,0,0,0,0]=>6
[1,1,1,0,1,1,0,0,0,0,1,0]=>6
[1,1,1,0,1,1,0,0,0,1,0,0]=>6
[1,1,1,0,1,1,0,0,1,0,0,0]=>2
[1,1,1,0,1,1,0,1,0,0,0,0]=>6
[1,1,1,0,1,1,1,0,0,0,0,0]=>6
[1,1,1,1,0,0,0,0,1,0,1,0]=>4
[1,1,1,1,0,0,0,0,1,1,0,0]=>4
[1,1,1,1,0,0,0,1,0,0,1,0]=>6
[1,1,1,1,0,0,0,1,0,1,0,0]=>4
[1,1,1,1,0,0,0,1,1,0,0,0]=>6
[1,1,1,1,0,0,1,0,0,0,1,0]=>2
[1,1,1,1,0,0,1,0,0,1,0,0]=>6
[1,1,1,1,0,0,1,0,1,0,0,0]=>6
[1,1,1,1,0,0,1,1,0,0,0,0]=>2
[1,1,1,1,0,1,0,0,0,0,1,0]=>6
[1,1,1,1,0,1,0,0,0,1,0,0]=>6
[1,1,1,1,0,1,0,0,1,0,0,0]=>6
[1,1,1,1,0,1,0,1,0,0,0,0]=>6
[1,1,1,1,0,1,1,0,0,0,0,0]=>6
[1,1,1,1,1,0,0,0,0,0,1,0]=>4
[1,1,1,1,1,0,0,0,0,1,0,0]=>4
[1,1,1,1,1,0,0,0,1,0,0,0]=>6
[1,1,1,1,1,0,0,1,0,0,0,0]=>6
[1,1,1,1,1,0,1,0,0,0,0,0]=>4
[1,1,1,1,1,1,0,0,0,0,0,0]=>4
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The largest degree of an irreducible factor over $\mathbb{Q}$ of the Coxeter polynomial of the linear Nakayama algebra corresponding to a Dyck path.
Here, the Coxeter polynomial of a Dyck path is defined to be the Coxeter polynomial of its corresponding linear Nakayama algebra.
The correspondence between linear Nakayama algebras and Dyck paths is explained on the Nakayama algebras page.
Here, the Coxeter polynomial of a Dyck path is defined to be the Coxeter polynomial of its corresponding linear Nakayama algebra.
The correspondence between linear Nakayama algebras and Dyck paths is explained on the Nakayama algebras page.
References
Code
gap('LoadPackage("QPA");')
import tempfile as _tf, os as _os
_gap_code = r"""
DeclareOperation("MaxDegree",[IsList]);
InstallMethod(MaxDegree, "for a representation of a quiver", [IsList],0,function(LIST)
local A, F, i, p, t, temp, u;
u := LIST[1];
A := NakayamaAlgebra(GF(3),u);
p := CoxeterPolynomial(A);
F := Factors(p);
temp := [];
for i in F do Append(temp,[Degree(i)]);
od;
t := Maximum(temp);
return(t);
end);
"""
with _tf.NamedTemporaryFile(mode="w", suffix=".g", delete=False, dir="/tmp") as _f:
_f.write('LoadPackage("QPA");;\n')
_f.write(_gap_code)
_tmp = _f.name
gap.eval('Read("' + _tmp + '");')
_os.unlink(_tmp)
def kupisch(D):
DR = D.reverse()
H = DR.heights()
return [1 + H[i] for i, s in enumerate(DR) if s == 0] + [1]
def statistic(D):
K = kupisch(D)
return ZZ(gap.MaxDegree([K]))
Created
Aug 25, 2017 at 15:33 by Rene Marczinzik
Updated
Mar 11, 2026 at 18:15 by Nupur Jain
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!