Identifier
- St001010: Dyck paths ⟶ ℤ
Values
=>
Cc0005;cc-rep
[1,0]=>1
[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]=>0
[1,1,1,0,0,0]=>1
[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]=>0
[1,0,1,1,0,1,0,0]=>0
[1,0,1,1,1,0,0,0]=>2
[1,1,0,0,1,0,1,0]=>0
[1,1,0,0,1,1,0,0]=>2
[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]=>1
[1,1,1,0,0,0,1,0]=>2
[1,1,1,0,0,1,0,0]=>1
[1,1,1,0,1,0,0,0]=>0
[1,1,1,1,0,0,0,0]=>1
[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]=>1
[1,0,1,1,0,1,0,0,1,0]=>1
[1,0,1,1,0,1,0,1,0,0]=>0
[1,0,1,1,0,1,1,0,0,0]=>0
[1,0,1,1,1,0,0,0,1,0]=>1
[1,0,1,1,1,0,0,1,0,0]=>0
[1,0,1,1,1,0,1,0,0,0]=>0
[1,0,1,1,1,1,0,0,0,0]=>3
[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]=>1
[1,1,0,0,1,1,0,1,0,0]=>0
[1,1,0,0,1,1,1,0,0,0]=>3
[1,1,0,1,0,0,1,0,1,0]=>0
[1,1,0,1,0,0,1,1,0,0]=>1
[1,1,0,1,0,1,0,0,1,0]=>0
[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]=>0
[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
[1,1,1,0,0,0,1,0,1,0]=>0
[1,1,1,0,0,0,1,1,0,0]=>3
[1,1,1,0,0,1,0,0,1,0]=>1
[1,1,1,0,0,1,0,1,0,0]=>1
[1,1,1,0,0,1,1,0,0,0]=>2
[1,1,1,0,1,0,0,0,1,0]=>2
[1,1,1,0,1,0,0,1,0,0]=>2
[1,1,1,0,1,0,1,0,0,0]=>2
[1,1,1,0,1,1,0,0,0,0]=>1
[1,1,1,1,0,0,0,0,1,0]=>3
[1,1,1,1,0,0,0,1,0,0]=>2
[1,1,1,1,0,0,1,0,0,0]=>1
[1,1,1,1,0,1,0,0,0,0]=>0
[1,1,1,1,1,0,0,0,0,0]=>1
[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]=>0
[1,0,1,0,1,0,1,1,0,0,1,0]=>0
[1,0,1,0,1,0,1,1,0,1,0,0]=>0
[1,0,1,0,1,0,1,1,1,0,0,0]=>0
[1,0,1,0,1,1,0,0,1,0,1,0]=>0
[1,0,1,0,1,1,0,0,1,1,0,0]=>1
[1,0,1,0,1,1,0,1,0,0,1,0]=>1
[1,0,1,0,1,1,0,1,0,1,0,0]=>0
[1,0,1,0,1,1,0,1,1,0,0,0]=>0
[1,0,1,0,1,1,1,0,0,0,1,0]=>1
[1,0,1,0,1,1,1,0,0,1,0,0]=>2
[1,0,1,0,1,1,1,0,1,0,0,0]=>0
[1,0,1,0,1,1,1,1,0,0,0,0]=>0
[1,0,1,1,0,0,1,0,1,0,1,0]=>0
[1,0,1,1,0,0,1,0,1,1,0,0]=>1
[1,0,1,1,0,0,1,1,0,0,1,0]=>0
[1,0,1,1,0,0,1,1,0,1,0,0]=>1
[1,0,1,1,0,0,1,1,1,0,0,0]=>2
[1,0,1,1,0,1,0,0,1,0,1,0]=>0
[1,0,1,1,0,1,0,0,1,1,0,0]=>1
[1,0,1,1,0,1,0,1,0,0,1,0]=>0
[1,0,1,1,0,1,0,1,0,1,0,0]=>1
[1,0,1,1,0,1,0,1,1,0,0,0]=>0
[1,0,1,1,0,1,1,0,0,0,1,0]=>1
[1,0,1,1,0,1,1,0,0,1,0,0]=>1
[1,0,1,1,0,1,1,0,1,0,0,0]=>0
[1,0,1,1,0,1,1,1,0,0,0,0]=>0
[1,0,1,1,1,0,0,0,1,0,1,0]=>1
[1,0,1,1,1,0,0,0,1,1,0,0]=>2
[1,0,1,1,1,0,0,1,0,0,1,0]=>2
[1,0,1,1,1,0,0,1,0,1,0,0]=>2
[1,0,1,1,1,0,0,1,1,0,0,0]=>1
[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]=>1
[1,0,1,1,1,0,1,0,1,0,0,0]=>0
[1,0,1,1,1,0,1,1,0,0,0,0]=>0
[1,0,1,1,1,1,0,0,0,0,1,0]=>2
[1,0,1,1,1,1,0,0,0,1,0,0]=>1
[1,0,1,1,1,1,0,0,1,0,0,0]=>0
[1,0,1,1,1,1,0,1,0,0,0,0]=>0
[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]=>0
[1,1,0,0,1,0,1,0,1,1,0,0]=>0
[1,1,0,0,1,0,1,1,0,0,1,0]=>1
[1,1,0,0,1,0,1,1,0,1,0,0]=>0
[1,1,0,0,1,0,1,1,1,0,0,0]=>0
[1,1,0,0,1,1,0,0,1,0,1,0]=>1
[1,1,0,0,1,1,0,0,1,1,0,0]=>2
[1,1,0,0,1,1,0,1,0,0,1,0]=>1
[1,1,0,0,1,1,0,1,0,1,0,0]=>0
[1,1,0,0,1,1,0,1,1,0,0,0]=>0
[1,1,0,0,1,1,1,0,0,0,1,0]=>2
[1,1,0,0,1,1,1,0,0,1,0,0]=>1
[1,1,0,0,1,1,1,0,1,0,0,0]=>0
[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]=>0
[1,1,0,1,0,0,1,0,1,1,0,0]=>0
[1,1,0,1,0,0,1,1,0,0,1,0]=>2
[1,1,0,1,0,0,1,1,0,1,0,0]=>0
[1,1,0,1,0,0,1,1,1,0,0,0]=>1
[1,1,0,1,0,1,0,0,1,0,1,0]=>0
[1,1,0,1,0,1,0,0,1,1,0,0]=>0
[1,1,0,1,0,1,0,1,0,0,1,0]=>1
[1,1,0,1,0,1,0,1,0,1,0,0]=>0
[1,1,0,1,0,1,0,1,1,0,0,0]=>0
[1,1,0,1,0,1,1,0,0,0,1,0]=>2
[1,1,0,1,0,1,1,0,0,1,0,0]=>0
[1,1,0,1,0,1,1,0,1,0,0,0]=>0
[1,1,0,1,0,1,1,1,0,0,0,0]=>1
[1,1,0,1,1,0,0,0,1,0,1,0]=>2
[1,1,0,1,1,0,0,0,1,1,0,0]=>1
[1,1,0,1,1,0,0,1,0,0,1,0]=>1
[1,1,0,1,1,0,0,1,0,1,0,0]=>0
[1,1,0,1,1,0,0,1,1,0,0,0]=>1
[1,1,0,1,1,0,1,0,0,0,1,0]=>1
[1,1,0,1,1,0,1,0,0,1,0,0]=>0
[1,1,0,1,1,0,1,0,1,0,0,0]=>0
[1,1,0,1,1,0,1,1,0,0,0,0]=>1
[1,1,0,1,1,1,0,0,0,0,1,0]=>1
[1,1,0,1,1,1,0,0,0,1,0,0]=>0
[1,1,0,1,1,1,0,0,1,0,0,0]=>1
[1,1,0,1,1,1,0,1,0,0,0,0]=>1
[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]=>0
[1,1,1,0,0,0,1,0,1,1,0,0]=>0
[1,1,1,0,0,0,1,1,0,0,1,0]=>2
[1,1,1,0,0,0,1,1,0,1,0,0]=>0
[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]=>0
[1,1,1,0,0,1,0,0,1,1,0,0]=>1
[1,1,1,0,0,1,0,1,0,0,1,0]=>0
[1,1,1,0,0,1,0,1,0,1,0,0]=>0
[1,1,1,0,0,1,0,1,1,0,0,0]=>1
[1,1,1,0,0,1,1,0,0,0,1,0]=>1
[1,1,1,0,0,1,1,0,0,1,0,0]=>1
[1,1,1,0,0,1,1,0,1,0,0,0]=>1
[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]=>0
[1,1,1,0,1,0,0,0,1,1,0,0]=>2
[1,1,1,0,1,0,0,1,0,0,1,0]=>0
[1,1,1,0,1,0,0,1,0,1,0,0]=>1
[1,1,1,0,1,0,0,1,1,0,0,0]=>2
[1,1,1,0,1,0,1,0,0,0,1,0]=>0
[1,1,1,0,1,0,1,0,0,1,0,0]=>1
[1,1,1,0,1,0,1,0,1,0,0,0]=>1
[1,1,1,0,1,0,1,1,0,0,0,0]=>2
[1,1,1,0,1,1,0,0,0,0,1,0]=>0
[1,1,1,0,1,1,0,0,0,1,0,0]=>2
[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]=>2
[1,1,1,0,1,1,1,0,0,0,0,0]=>2
[1,1,1,1,0,0,0,0,1,0,1,0]=>0
[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]=>1
[1,1,1,1,0,0,0,1,0,1,0,0]=>1
[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]=>2
[1,1,1,1,0,0,1,0,0,1,0,0]=>2
[1,1,1,1,0,0,1,0,1,0,0,0]=>2
[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]=>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]=>1
[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]=>3
[1,1,1,1,1,0,0,0,1,0,0,0]=>2
[1,1,1,1,1,0,0,1,0,0,0,0]=>1
[1,1,1,1,1,0,1,0,0,0,0,0]=>0
[1,1,1,1,1,1,0,0,0,0,0,0]=>1
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 indecomposable injective modules with projective dimension equal to the global dimension minus one of the linear Nakayama algebra corresponding to a Dyck path.
The global dimension is given by St000684The global dimension of the LNakayama algebra associated to a Dyck path..
The correspondence between linear Nakayama algebras and Dyck paths is also explained on the Nakayama algebras page.
The global dimension is given by St000684The global dimension of the LNakayama algebra associated to a Dyck path..
The correspondence between linear Nakayama algebras and Dyck paths is also explained on the Nakayama algebras page.
Code
gap('LoadPackage("QPA");')
import tempfile as _tf, os as _os
_gap_code = r"""
DeclareOperation("numbersinjprojdimgminus", [IsList]);
InstallMethod(numbersinjprojdimgminus, "for a representation of a quiver", [IsList],0,function(LIST)
local A, R, RR, g, list;
list := LIST[1];
A := NakayamaAlgebra(GF(3),list);
g := LIST[2]-1;
R := IndecInjectiveModules(A);
RR := Filtered(R,x->ProjDimensionOfModule(x,g)=g);
return(Size(RR));
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 gldim_from_kupisch(L):
n = len(L)
def f(x, y):
c = (x + y) % n
if c == 0: c = n
z = (x + 1) % n
if z == 0: z = n
return (c, L[z - 1] - y)
temp = [[(i, 1)] for i in range(n)]
for i in range(n):
for _ in range(2 * n + 2):
temp[i].append(f(temp[i][-1][0], temp[i][-1][1]))
temp3 = []
for i in range(n):
zeros = [j + 1 for j in range(len(temp[i])) if temp[i][j][1] == 0]
if zeros:
temp3.append(min(zeros))
else:
return "inf"
return max(temp3) - 2
def statistic(D):
K = kupisch(D)
g = gldim_from_kupisch(K)
return ZZ(gap.numbersinjprojdimgminus([K, g]))
Created
Oct 29, 2017 at 16:47 by Rene Marczinzik
Updated
Mar 12, 2026 at 14:38 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!