view pending changes or download as text // json
Identifier
Values
=>
Cc0005;cc-rep
[1,0]=>0 [1,0,1,0]=>0 [1,1,0,0]=>0 [1,0,1,0,1,0]=>0 [1,0,1,1,0,0]=>0 [1,1,0,0,1,0]=>0 [1,1,0,1,0,0]=>1 [1,1,1,0,0,0]=>0 [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]=>1 [1,0,1,1,1,0,0,0]=>0 [1,1,0,0,1,0,1,0]=>0 [1,1,0,0,1,1,0,0]=>0 [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]=>0 [1,1,1,0,0,1,0,0]=>1 [1,1,1,0,1,0,0,0]=>2 [1,1,1,1,0,0,0,0]=>0 [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]=>0 [1,0,1,0,1,1,0,1,0,0]=>1 [1,0,1,0,1,1,1,0,0,0]=>0 [1,0,1,1,0,0,1,0,1,0]=>0 [1,0,1,1,0,0,1,1,0,0]=>0 [1,0,1,1,0,1,0,0,1,0]=>1 [1,0,1,1,0,1,0,1,0,0]=>1 [1,0,1,1,0,1,1,0,0,0]=>1 [1,0,1,1,1,0,0,0,1,0]=>0 [1,0,1,1,1,0,0,1,0,0]=>1 [1,0,1,1,1,0,1,0,0,0]=>2 [1,0,1,1,1,1,0,0,0,0]=>0 [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]=>0 [1,1,0,0,1,1,0,1,0,0]=>1 [1,1,0,0,1,1,1,0,0,0]=>0 [1,1,0,1,0,0,1,0,1,0]=>1 [1,1,0,1,0,0,1,1,0,0]=>1 [1,1,0,1,0,1,0,0,1,0]=>1 [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]=>1 [1,1,0,1,1,0,0,1,0,0]=>2 [1,1,0,1,1,0,1,0,0,0]=>2 [1,1,0,1,1,1,0,0,0,0]=>1 [1,1,1,0,0,0,1,0,1,0]=>0 [1,1,1,0,0,0,1,1,0,0]=>0 [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]=>1 [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]=>2 [1,1,1,1,0,0,0,0,1,0]=>0 [1,1,1,1,0,0,0,1,0,0]=>1 [1,1,1,1,0,0,1,0,0,0]=>2 [1,1,1,1,0,1,0,0,0,0]=>3 [1,1,1,1,1,0,0,0,0,0]=>0 [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]=>1 [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]=>0 [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]=>1 [1,0,1,0,1,1,0,1,1,0,0,0]=>1 [1,0,1,0,1,1,1,0,0,0,1,0]=>0 [1,0,1,0,1,1,1,0,0,1,0,0]=>1 [1,0,1,0,1,1,1,0,1,0,0,0]=>2 [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]=>0 [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]=>0 [1,0,1,1,0,1,0,0,1,0,1,0]=>1 [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]=>1 [1,0,1,1,0,1,0,1,0,1,0,0]=>0 [1,0,1,1,0,1,0,1,1,0,0,0]=>1 [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]=>2 [1,0,1,1,0,1,1,0,1,0,0,0]=>2 [1,0,1,1,0,1,1,1,0,0,0,0]=>1 [1,0,1,1,1,0,0,0,1,0,1,0]=>0 [1,0,1,1,1,0,0,0,1,1,0,0]=>0 [1,0,1,1,1,0,0,1,0,0,1,0]=>1 [1,0,1,1,1,0,0,1,0,1,0,0]=>1 [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]=>2 [1,0,1,1,1,0,1,0,1,0,0,0]=>2 [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]=>0 [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]=>2 [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]=>0 [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]=>0 [1,1,0,0,1,0,1,1,0,1,0,0]=>1 [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]=>0 [1,1,0,0,1,1,0,0,1,1,0,0]=>0 [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]=>1 [1,1,0,0,1,1,0,1,1,0,0,0]=>1 [1,1,0,0,1,1,1,0,0,0,1,0]=>0 [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]=>2 [1,1,0,0,1,1,1,1,0,0,0,0]=>0 [1,1,0,1,0,0,1,0,1,0,1,0]=>1 [1,1,0,1,0,0,1,0,1,1,0,0]=>1 [1,1,0,1,0,0,1,1,0,0,1,0]=>1 [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]=>1 [1,1,0,1,0,1,0,0,1,0,1,0]=>1 [1,1,0,1,0,1,0,0,1,1,0,0]=>1 [1,1,0,1,0,1,0,1,0,0,1,0]=>0 [1,1,0,1,0,1,0,1,0,1,0,0]=>1 [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]=>1 [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]=>1 [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]=>1 [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]=>2 [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]=>2 [1,1,0,1,1,0,1,0,0,0,1,0]=>2 [1,1,0,1,1,0,1,0,0,1,0,0]=>1 [1,1,0,1,1,0,1,0,1,0,0,0]=>1 [1,1,0,1,1,0,1,1,0,0,0,0]=>2 [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]=>2 [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]=>1 [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]=>0 [1,1,1,0,0,0,1,1,0,1,0,0]=>1 [1,1,1,0,0,0,1,1,1,0,0,0]=>0 [1,1,1,0,0,1,0,0,1,0,1,0]=>1 [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]=>1 [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]=>2 [1,1,1,0,0,1,1,0,1,0,0,0]=>2 [1,1,1,0,0,1,1,1,0,0,0,0]=>1 [1,1,1,0,1,0,0,0,1,0,1,0]=>2 [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]=>2 [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]=>2 [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]=>2 [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]=>2 [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]=>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]=>0 [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]=>1 [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]=>3 [1,1,1,1,1,0,0,0,0,0,1,0]=>0 [1,1,1,1,1,0,0,0,0,1,0,0]=>1 [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]=>3 [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]=>0
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
click to show known generating functions       
Description
The number of indecomposable projective non-injective modules of the linear Nakayama algebra corresponding to a Dyck path, minus the number of indecomposable projective non-injective modules whose dominant dimension equals their injective dimension.
The number of indecomposable projective non-injective modules whose dominant dimension equals their injective dimension is given by St001088The number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in 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.
References
[1] Marczinzik, R. Upper bounds for the dominant dimension of Nakayama and related algebras arXiv:1605.09634
Code
gap('LoadPackage("QPA");')

import tempfile as _tf, os as _os
_gap_code = r"""
DeclareOperation("numberofprojwithdomdimequalinjdim2", [IsList]);

InstallMethod(numberofprojwithdomdimequalinjdim2, "for a representation of a quiver", [IsList],0,function(L)
    local A, UU, i, list, prinA, projA, tempp;
    list := L;
    A := NakayamaAlgebra(list,GF(3));
    projA := IndecProjectiveModules(A);
    prinA := Filtered(projA,x->IsInjectiveModule(x)=false);
    tempp := [];
    for i in prinA do Append(tempp,[InjDimensionOfModule(i,30)-DominantDimensionOfModule(i,30)]);
    od;
    UU := Filtered(tempp,x->(x=0));
    return(Size(prinA)-Size(UU));
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.numberofprojwithdomdimequalinjdim2(K))
Created
Jan 14, 2018 at 19:21 by Rene Marczinzik
Updated
Mar 12, 2026 at 15:49 by Nupur Jain