Identifier
- St001183: Dyck paths ⟶ ℤ
Values
=>
Cc0005;cc-rep
[1,0]=>1
[1,0,1,0]=>2
[1,1,0,0]=>2
[1,0,1,0,1,0]=>3
[1,0,1,1,0,0]=>3
[1,1,0,0,1,0]=>3
[1,1,0,1,0,0]=>2
[1,1,1,0,0,0]=>2
[1,0,1,0,1,0,1,0]=>4
[1,0,1,0,1,1,0,0]=>4
[1,0,1,1,0,0,1,0]=>4
[1,0,1,1,0,1,0,0]=>3
[1,0,1,1,1,0,0,0]=>3
[1,1,0,0,1,0,1,0]=>4
[1,1,0,0,1,1,0,0]=>3
[1,1,0,1,0,0,1,0]=>3
[1,1,0,1,0,1,0,0]=>3
[1,1,0,1,1,0,0,0]=>3
[1,1,1,0,0,0,1,0]=>3
[1,1,1,0,0,1,0,0]=>3
[1,1,1,0,1,0,0,0]=>2
[1,1,1,1,0,0,0,0]=>2
[1,0,1,0,1,0,1,0,1,0]=>5
[1,0,1,0,1,0,1,1,0,0]=>5
[1,0,1,0,1,1,0,0,1,0]=>5
[1,0,1,0,1,1,0,1,0,0]=>4
[1,0,1,0,1,1,1,0,0,0]=>4
[1,0,1,1,0,0,1,0,1,0]=>5
[1,0,1,1,0,0,1,1,0,0]=>4
[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]=>3
[1,0,1,1,1,0,0,1,0,0]=>4
[1,0,1,1,1,0,1,0,0,0]=>3
[1,0,1,1,1,1,0,0,0,0]=>3
[1,1,0,0,1,0,1,0,1,0]=>5
[1,1,0,0,1,0,1,1,0,0]=>4
[1,1,0,0,1,1,0,0,1,0]=>4
[1,1,0,0,1,1,0,1,0,0]=>4
[1,1,0,0,1,1,1,0,0,0]=>3
[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]=>3
[1,1,0,1,1,0,1,0,0,0]=>3
[1,1,0,1,1,1,0,0,0,0]=>3
[1,1,1,0,0,0,1,0,1,0]=>4
[1,1,1,0,0,0,1,1,0,0]=>3
[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]=>3
[1,1,1,0,1,0,0,0,1,0]=>3
[1,1,1,0,1,0,0,1,0,0]=>3
[1,1,1,0,1,0,1,0,0,0]=>3
[1,1,1,0,1,1,0,0,0,0]=>3
[1,1,1,1,0,0,0,0,1,0]=>3
[1,1,1,1,0,0,0,1,0,0]=>3
[1,1,1,1,0,0,1,0,0,0]=>3
[1,1,1,1,0,1,0,0,0,0]=>2
[1,1,1,1,1,0,0,0,0,0]=>2
[1,0,1,0,1,0,1,0,1,0,1,0]=>6
[1,0,1,0,1,0,1,0,1,1,0,0]=>6
[1,0,1,0,1,0,1,1,0,0,1,0]=>6
[1,0,1,0,1,0,1,1,0,1,0,0]=>5
[1,0,1,0,1,0,1,1,1,0,0,0]=>5
[1,0,1,0,1,1,0,0,1,0,1,0]=>6
[1,0,1,0,1,1,0,0,1,1,0,0]=>5
[1,0,1,0,1,1,0,1,0,0,1,0]=>5
[1,0,1,0,1,1,0,1,0,1,0,0]=>5
[1,0,1,0,1,1,0,1,1,0,0,0]=>5
[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]=>5
[1,0,1,0,1,1,1,0,1,0,0,0]=>4
[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]=>6
[1,0,1,1,0,0,1,0,1,1,0,0]=>5
[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]=>5
[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]=>5
[1,0,1,1,0,1,0,0,1,1,0,0]=>5
[1,0,1,1,0,1,0,1,0,0,1,0]=>5
[1,0,1,1,0,1,0,1,0,1,0,0]=>5
[1,0,1,1,0,1,0,1,1,0,0,0]=>5
[1,0,1,1,0,1,1,0,0,0,1,0]=>5
[1,0,1,1,0,1,1,0,0,1,0,0]=>4
[1,0,1,1,0,1,1,0,1,0,0,0]=>4
[1,0,1,1,0,1,1,1,0,0,0,0]=>4
[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]=>3
[1,0,1,1,1,0,0,1,0,0,1,0]=>5
[1,0,1,1,1,0,0,1,0,1,0,0]=>5
[1,0,1,1,1,0,0,1,1,0,0,0]=>4
[1,0,1,1,1,0,1,0,0,0,1,0]=>4
[1,0,1,1,1,0,1,0,0,1,0,0]=>4
[1,0,1,1,1,0,1,0,1,0,0,0]=>4
[1,0,1,1,1,0,1,1,0,0,0,0]=>4
[1,0,1,1,1,1,0,0,0,0,1,0]=>3
[1,0,1,1,1,1,0,0,0,1,0,0]=>3
[1,0,1,1,1,1,0,0,1,0,0,0]=>4
[1,0,1,1,1,1,0,1,0,0,0,0]=>3
[1,0,1,1,1,1,1,0,0,0,0,0]=>3
[1,1,0,0,1,0,1,0,1,0,1,0]=>6
[1,1,0,0,1,0,1,0,1,1,0,0]=>5
[1,1,0,0,1,0,1,1,0,0,1,0]=>5
[1,1,0,0,1,0,1,1,0,1,0,0]=>5
[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]=>5
[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]=>5
[1,1,0,0,1,1,0,1,0,1,0,0]=>5
[1,1,0,0,1,1,0,1,1,0,0,0]=>4
[1,1,0,0,1,1,1,0,0,0,1,0]=>3
[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]=>4
[1,1,0,0,1,1,1,1,0,0,0,0]=>3
[1,1,0,1,0,0,1,0,1,0,1,0]=>5
[1,1,0,1,0,0,1,0,1,1,0,0]=>5
[1,1,0,1,0,0,1,1,0,0,1,0]=>5
[1,1,0,1,0,0,1,1,0,1,0,0]=>4
[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]=>5
[1,1,0,1,0,1,0,0,1,1,0,0]=>5
[1,1,0,1,0,1,0,1,0,0,1,0]=>5
[1,1,0,1,0,1,0,1,0,1,0,0]=>4
[1,1,0,1,0,1,0,1,1,0,0,0]=>4
[1,1,0,1,0,1,1,0,0,0,1,0]=>5
[1,1,0,1,0,1,1,0,0,1,0,0]=>4
[1,1,0,1,0,1,1,0,1,0,0,0]=>4
[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]=>5
[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]=>4
[1,1,0,1,1,0,0,1,0,1,0,0]=>4
[1,1,0,1,1,0,0,1,1,0,0,0]=>4
[1,1,0,1,1,0,1,0,0,0,1,0]=>4
[1,1,0,1,1,0,1,0,0,1,0,0]=>4
[1,1,0,1,1,0,1,0,1,0,0,0]=>4
[1,1,0,1,1,0,1,1,0,0,0,0]=>4
[1,1,0,1,1,1,0,0,0,0,1,0]=>3
[1,1,0,1,1,1,0,0,0,1,0,0]=>4
[1,1,0,1,1,1,0,0,1,0,0,0]=>3
[1,1,0,1,1,1,0,1,0,0,0,0]=>3
[1,1,0,1,1,1,1,0,0,0,0,0]=>3
[1,1,1,0,0,0,1,0,1,0,1,0]=>5
[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]=>3
[1,1,1,0,0,1,0,0,1,0,1,0]=>5
[1,1,1,0,0,1,0,0,1,1,0,0]=>4
[1,1,1,0,0,1,0,1,0,0,1,0]=>5
[1,1,1,0,0,1,0,1,0,1,0,0]=>4
[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]=>4
[1,1,1,0,0,1,1,0,0,1,0,0]=>4
[1,1,1,0,0,1,1,0,1,0,0,0]=>4
[1,1,1,0,0,1,1,1,0,0,0,0]=>3
[1,1,1,0,1,0,0,0,1,0,1,0]=>4
[1,1,1,0,1,0,0,0,1,1,0,0]=>4
[1,1,1,0,1,0,0,1,0,0,1,0]=>4
[1,1,1,0,1,0,0,1,0,1,0,0]=>4
[1,1,1,0,1,0,0,1,1,0,0,0]=>4
[1,1,1,0,1,0,1,0,0,0,1,0]=>4
[1,1,1,0,1,0,1,0,0,1,0,0]=>4
[1,1,1,0,1,0,1,0,1,0,0,0]=>4
[1,1,1,0,1,0,1,1,0,0,0,0]=>4
[1,1,1,0,1,1,0,0,0,0,1,0]=>4
[1,1,1,0,1,1,0,0,0,1,0,0]=>3
[1,1,1,0,1,1,0,0,1,0,0,0]=>3
[1,1,1,0,1,1,0,1,0,0,0,0]=>3
[1,1,1,0,1,1,1,0,0,0,0,0]=>3
[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]=>3
[1,1,1,1,0,0,0,1,0,0,1,0]=>4
[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]=>3
[1,1,1,1,0,0,1,0,0,0,1,0]=>4
[1,1,1,1,0,0,1,0,0,1,0,0]=>4
[1,1,1,1,0,0,1,0,1,0,0,0]=>4
[1,1,1,1,0,0,1,1,0,0,0,0]=>3
[1,1,1,1,0,1,0,0,0,0,1,0]=>3
[1,1,1,1,0,1,0,0,0,1,0,0]=>3
[1,1,1,1,0,1,0,0,1,0,0,0]=>3
[1,1,1,1,0,1,0,1,0,0,0,0]=>3
[1,1,1,1,0,1,1,0,0,0,0,0]=>3
[1,1,1,1,1,0,0,0,0,0,1,0]=>3
[1,1,1,1,1,0,0,0,0,1,0,0]=>3
[1,1,1,1,1,0,0,0,1,0,0,0]=>3
[1,1,1,1,1,0,0,1,0,0,0,0]=>3
[1,1,1,1,1,0,1,0,0,0,0,0]=>2
[1,1,1,1,1,1,0,0,0,0,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 maximum of $\operatorname{projdim}(S)+\operatorname{injdim}(S)$ over all simple modules $S$ of the linear Nakayama algebra corresponding to a Dyck path.
The correspondence between linear Nakayama algebras and Dyck paths is explained on the Nakayama algebras page.
The correspondence between linear Nakayama algebras and Dyck paths is explained on the Nakayama algebras page.
References
[1] Marczinzik, René Upper bounds for the dominant dimension of Nakayama and related algebras. zbMATH:06820683
Code
gap('LoadPackage("QPA");')
import tempfile as _tf, os as _os
_gap_code = r"""
DeclareOperation("sumprojinjdimsimple",[IsList]);
InstallMethod(sumprojinjdimsimple, "for a representation of a quiver", [IsList],0,function(LIST)
local A, TT, i, simA;
A := LIST[1];
simA := SimpleModules(A);
TT := [];
for i in simA do Append(TT,[ProjDimensionOfModule(i,30)+InjDimensionOfModule(i,30)]);
od;
return(Maximum(TT));
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)
A = gap.NakayamaAlgebra(gap.GF(3), K)
return ZZ(gap.sumprojinjdimsimple([A]))
Created
May 09, 2018 at 16:27 by Rene Marczinzik
Updated
Mar 13, 2026 at 14:44 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!