Identifier
- St001480: Dyck paths ⟶ ℤ
Values
=>
Cc0005;cc-rep
[1,0,1,0]=>0
[1,1,0,0]=>1
[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]=>2
[1,0,1,0,1,0,1,0]=>0
[1,0,1,0,1,1,0,0]=>1
[1,0,1,1,0,0,1,0]=>1
[1,0,1,1,0,1,0,0]=>2
[1,0,1,1,1,0,0,0]=>2
[1,1,0,0,1,0,1,0]=>1
[1,1,0,0,1,1,0,0]=>2
[1,1,0,1,0,0,1,0]=>2
[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]=>2
[1,1,1,0,0,1,0,0]=>3
[1,1,1,0,1,0,0,0]=>3
[1,1,1,1,0,0,0,0]=>3
[1,0,1,0,1,0,1,0,1,0]=>0
[1,0,1,0,1,0,1,1,0,0]=>1
[1,0,1,0,1,1,0,0,1,0]=>1
[1,0,1,0,1,1,0,1,0,0]=>2
[1,0,1,0,1,1,1,0,0,0]=>2
[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]=>2
[1,0,1,1,0,1,0,1,0,0]=>3
[1,0,1,1,0,1,1,0,0,0]=>3
[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]=>3
[1,0,1,1,1,1,0,0,0,0]=>3
[1,1,0,0,1,0,1,0,1,0]=>1
[1,1,0,0,1,0,1,1,0,0]=>2
[1,1,0,0,1,1,0,0,1,0]=>2
[1,1,0,0,1,1,0,1,0,0]=>3
[1,1,0,0,1,1,1,0,0,0]=>3
[1,1,0,1,0,0,1,0,1,0]=>2
[1,1,0,1,0,0,1,1,0,0]=>3
[1,1,0,1,0,1,0,0,1,0]=>3
[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]=>3
[1,1,0,1,1,0,0,1,0,0]=>4
[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]=>2
[1,1,1,0,0,0,1,1,0,0]=>3
[1,1,1,0,0,1,0,0,1,0]=>3
[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]=>3
[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]=>3
[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]=>4
[1,0,1,0,1,0,1,0,1,0,1,0]=>0
[1,0,1,0,1,0,1,0,1,1,0,0]=>1
[1,0,1,0,1,0,1,1,0,0,1,0]=>1
[1,0,1,0,1,0,1,1,0,1,0,0]=>2
[1,0,1,0,1,0,1,1,1,0,0,0]=>2
[1,0,1,0,1,1,0,0,1,0,1,0]=>1
[1,0,1,0,1,1,0,0,1,1,0,0]=>2
[1,0,1,0,1,1,0,1,0,0,1,0]=>2
[1,0,1,0,1,1,0,1,0,1,0,0]=>3
[1,0,1,0,1,1,0,1,1,0,0,0]=>3
[1,0,1,0,1,1,1,0,0,0,1,0]=>2
[1,0,1,0,1,1,1,0,0,1,0,0]=>3
[1,0,1,0,1,1,1,0,1,0,0,0]=>3
[1,0,1,0,1,1,1,1,0,0,0,0]=>3
[1,0,1,1,0,0,1,0,1,0,1,0]=>1
[1,0,1,1,0,0,1,0,1,1,0,0]=>2
[1,0,1,1,0,0,1,1,0,0,1,0]=>2
[1,0,1,1,0,0,1,1,0,1,0,0]=>3
[1,0,1,1,0,0,1,1,1,0,0,0]=>3
[1,0,1,1,0,1,0,0,1,0,1,0]=>2
[1,0,1,1,0,1,0,0,1,1,0,0]=>3
[1,0,1,1,0,1,0,1,0,0,1,0]=>3
[1,0,1,1,0,1,0,1,0,1,0,0]=>4
[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]=>3
[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]=>2
[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]=>3
[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]=>4
[1,0,1,1,1,0,1,0,0,0,1,0]=>3
[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]=>4
[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]=>4
[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]=>1
[1,1,0,0,1,0,1,0,1,1,0,0]=>2
[1,1,0,0,1,0,1,1,0,0,1,0]=>2
[1,1,0,0,1,0,1,1,0,1,0,0]=>3
[1,1,0,0,1,0,1,1,1,0,0,0]=>3
[1,1,0,0,1,1,0,0,1,0,1,0]=>2
[1,1,0,0,1,1,0,0,1,1,0,0]=>3
[1,1,0,0,1,1,0,1,0,0,1,0]=>3
[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]=>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]=>4
[1,1,0,1,0,0,1,0,1,0,1,0]=>2
[1,1,0,1,0,0,1,0,1,1,0,0]=>3
[1,1,0,1,0,0,1,1,0,0,1,0]=>3
[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]=>3
[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]=>4
[1,1,0,1,0,1,0,1,0,1,0,0]=>5
[1,1,0,1,0,1,0,1,1,0,0,0]=>5
[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]=>5
[1,1,0,1,0,1,1,0,1,0,0,0]=>5
[1,1,0,1,0,1,1,1,0,0,0,0]=>5
[1,1,0,1,1,0,0,0,1,0,1,0]=>3
[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]=>5
[1,1,0,1,1,0,0,1,1,0,0,0]=>5
[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]=>5
[1,1,0,1,1,0,1,0,1,0,0,0]=>5
[1,1,0,1,1,0,1,1,0,0,0,0]=>5
[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]=>5
[1,1,0,1,1,1,0,0,1,0,0,0]=>5
[1,1,0,1,1,1,0,1,0,0,0,0]=>5
[1,1,0,1,1,1,1,0,0,0,0,0]=>5
[1,1,1,0,0,0,1,0,1,0,1,0]=>2
[1,1,1,0,0,0,1,0,1,1,0,0]=>3
[1,1,1,0,0,0,1,1,0,0,1,0]=>3
[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]=>3
[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]=>4
[1,1,1,0,0,1,0,1,0,1,0,0]=>5
[1,1,1,0,0,1,0,1,1,0,0,0]=>5
[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]=>5
[1,1,1,0,0,1,1,0,1,0,0,0]=>5
[1,1,1,0,0,1,1,1,0,0,0,0]=>5
[1,1,1,0,1,0,0,0,1,0,1,0]=>3
[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]=>5
[1,1,1,0,1,0,0,1,1,0,0,0]=>5
[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]=>5
[1,1,1,0,1,0,1,0,1,0,0,0]=>5
[1,1,1,0,1,0,1,1,0,0,0,0]=>5
[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]=>5
[1,1,1,0,1,1,0,0,1,0,0,0]=>5
[1,1,1,0,1,1,0,1,0,0,0,0]=>5
[1,1,1,0,1,1,1,0,0,0,0,0]=>5
[1,1,1,1,0,0,0,0,1,0,1,0]=>3
[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]=>4
[1,1,1,1,0,0,0,1,0,1,0,0]=>5
[1,1,1,1,0,0,0,1,1,0,0,0]=>5
[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]=>5
[1,1,1,1,0,0,1,0,1,0,0,0]=>5
[1,1,1,1,0,0,1,1,0,0,0,0]=>5
[1,1,1,1,0,1,0,0,0,0,1,0]=>4
[1,1,1,1,0,1,0,0,0,1,0,0]=>5
[1,1,1,1,0,1,0,0,1,0,0,0]=>5
[1,1,1,1,0,1,0,1,0,0,0,0]=>5
[1,1,1,1,0,1,1,0,0,0,0,0]=>5
[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]=>5
[1,1,1,1,1,0,0,0,1,0,0,0]=>5
[1,1,1,1,1,0,0,1,0,0,0,0]=>5
[1,1,1,1,1,0,1,0,0,0,0,0]=>5
[1,1,1,1,1,1,0,0,0,0,0,0]=>5
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 simple summands of the module $J^2/J^3$ in the linear Nakayama algebra corresponding to a Dyck path.
Here $J$ is the Jacobson radical of the linear Nakayama algebra corresponding to the Dyck path.
The correspondence between linear Nakayama algebras and Dyck paths is explained on the Nakayama algebras page.
Here $J$ is the Jacobson radical of the linear Nakayama algebra corresponding to the Dyck path.
The correspondence between linear Nakayama algebras and Dyck paths is explained on the Nakayama algebras page.
Code
gap('LoadPackage("QPA");')
import tempfile as _tf, os as _os
_gap_code = r"""
DeclareOperation("testlk",[IsList]);
InstallMethod(testlk, "for a representation of a quiver", [IsList],0,function(LIST)
local A, J, JJ, RegA, T, TT, U;
A := LIST[1];
RegA := DirectSumOfQPAModules(IndecProjectiveModules(A));
J := RadicalOfModule(RegA);
JJ := RadicalOfModule(J);
if Dimension(JJ)=0 then return(0);else
T := RadicalOfModuleInclusion(JJ);
TT := CoKernel(T);
U := DecomposeModule(TT);
return(Size(U));
fi;
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.testlk([A]))
Created
Oct 14, 2019 at 11:23 by Rene Marczinzik
Updated
Mar 13, 2026 at 15:00 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!