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]=>2 [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]=>3 [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]=>2 [1,0,1,1,0,1,0,1,0,0]=>2 [1,0,1,1,0,1,1,0,0,0]=>2 [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]=>4 [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]=>2 [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]=>3 [1,1,0,1,1,0,1,0,0,0]=>3 [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]=>4 [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]=>3 [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]=>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]=>6 [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]=>2 [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]=>2 [1,0,1,1,0,1,0,0,1,1,0,0]=>2 [1,0,1,1,0,1,0,1,0,0,1,0]=>2 [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]=>2 [1,0,1,1,0,1,1,0,0,0,1,0]=>2 [1,0,1,1,0,1,1,0,0,1,0,0]=>5 [1,0,1,1,0,1,1,0,1,0,0,0]=>5 [1,0,1,1,0,1,1,1,0,0,0,0]=>2 [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]=>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]=>3 [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]=>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]=>6 [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]=>3 [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]=>2 [1,1,0,0,1,1,0,1,0,1,0,0]=>2 [1,1,0,0,1,1,0,1,1,0,0,0]=>2 [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]=>4 [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]=>4 [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]=>4 [1,1,0,1,0,1,1,0,1,0,0,0]=>2 [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]=>3 [1,1,0,1,1,0,0,1,0,1,0,0]=>3 [1,1,0,1,1,0,0,1,1,0,0,0]=>3 [1,1,0,1,1,0,1,0,0,0,1,0]=>3 [1,1,0,1,1,0,1,0,0,1,0,0]=>2 [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]=>3 [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]=>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]=>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]=>2 [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]=>3 [1,1,1,0,0,1,1,0,1,0,0,0]=>3 [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]=>4 [1,1,1,0,1,1,0,0,1,0,0,0]=>4 [1,1,1,0,1,1,0,1,0,0,0,0]=>4 [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 sum of the differences between the projective and codominant dimensions of the non-projective indecomposable injective modules of the linear Nakayama algebra corresponding to a Dyck path.
The sum of the codominant dimensions of the non-projective indecomposable injective modules of the linear Nakayama algebra corresponding to a Dyck path is given by St001020The sum of the codominant dimensions of the non-projective indecomposable injective modules 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.
Code
gap('LoadPackage("QPA");')

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

InstallMethod(difference, "for a representation of a quiver", [IsList],0,function(L)
    local A, R, i, list, temp;
    list := L;

    A := NakayamaAlgebra(GF(3),list);
    R := Filtered(IndecInjectiveModules(A),x->IsProjectiveModule(x)=false);
    temp := [];
    for i in R do Append(temp,[ProjDimensionOfModule(i,1000)-DominantDimensionOfModule(DualOfModule(i),1000)]);
    od;
    return(Sum(temp));
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.difference(K))
Created
Oct 30, 2017 at 11:10 by Rene Marczinzik
Updated
Mar 12, 2026 at 14:45 by Nupur Jain