edit this statistic or download as text // json
Identifier
Values
=>
Cc0005;cc-rep
[1,0]=>2 [1,0,1,0]=>3 [1,1,0,0]=>2 [1,0,1,0,1,0]=>4 [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]=>5 [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]=>2 [1,1,1,0,0,0,1,0]=>3 [1,1,1,0,0,1,0,0]=>2 [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]=>6 [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]=>3 [1,0,1,1,1,0,0,0,1,0]=>4 [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]=>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]=>3 [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]=>3 [1,1,0,1,0,1,0,0,1,0]=>4 [1,1,0,1,0,1,0,1,0,0]=>3 [1,1,0,1,0,1,1,0,0,0]=>3 [1,1,0,1,1,0,0,0,1,0]=>3 [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]=>2 [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]=>3 [1,1,1,0,0,1,0,1,0,0]=>3 [1,1,1,0,0,1,1,0,0,0]=>2 [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]=>2 [1,1,1,0,1,1,0,0,0,0]=>2 [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]=>2 [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]=>7 [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]=>4 [1,0,1,0,1,1,1,0,0,0,1,0]=>5 [1,0,1,0,1,1,1,0,0,1,0,0]=>4 [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]=>5 [1,0,1,1,0,0,1,1,0,1,0,0]=>4 [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]=>4 [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]=>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]=>4 [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]=>3 [1,0,1,1,1,0,0,0,1,0,1,0]=>5 [1,0,1,1,1,0,0,0,1,1,0,0]=>4 [1,0,1,1,1,0,0,1,0,0,1,0]=>4 [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]=>3 [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]=>3 [1,0,1,1,1,1,0,0,0,0,1,0]=>4 [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]=>3 [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]=>4 [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]=>4 [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]=>3 [1,1,0,0,1,1,1,0,0,0,1,0]=>4 [1,1,0,0,1,1,1,0,0,1,0,0]=>3 [1,1,0,0,1,1,1,0,1,0,0,0]=>3 [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]=>4 [1,1,0,1,0,0,1,1,0,0,1,0]=>4 [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]=>3 [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]=>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]=>4 [1,1,0,1,0,1,0,1,1,0,0,0]=>3 [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]=>3 [1,1,0,1,0,1,1,0,1,0,0,0]=>3 [1,1,0,1,0,1,1,1,0,0,0,0]=>3 [1,1,0,1,1,0,0,0,1,0,1,0]=>4 [1,1,0,1,1,0,0,0,1,1,0,0]=>3 [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]=>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]=>4 [1,1,0,1,1,0,1,0,0,1,0,0]=>3 [1,1,0,1,1,0,1,0,1,0,0,0]=>3 [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]=>3 [1,1,0,1,1,1,0,0,0,1,0,0]=>3 [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]=>2 [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]=>3 [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]=>4 [1,1,1,0,0,1,0,0,1,1,0,0]=>3 [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]=>3 [1,1,1,0,0,1,0,1,1,0,0,0]=>3 [1,1,1,0,0,1,1,0,0,0,1,0]=>3 [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]=>2 [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]=>3 [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]=>3 [1,1,1,0,1,0,0,1,1,0,0,0]=>3 [1,1,1,0,1,0,1,0,0,0,1,0]=>3 [1,1,1,0,1,0,1,0,0,1,0,0]=>3 [1,1,1,0,1,0,1,0,1,0,0,0]=>3 [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]=>3 [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]=>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]=>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]=>3 [1,1,1,1,0,0,0,1,0,1,0,0]=>3 [1,1,1,1,0,0,0,1,1,0,0,0]=>2 [1,1,1,1,0,0,1,0,0,0,1,0]=>3 [1,1,1,1,0,0,1,0,0,1,0,0]=>3 [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]=>2 [1,1,1,1,0,1,0,1,0,0,0,0]=>2 [1,1,1,1,0,1,1,0,0,0,0,0]=>2 [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]=>2 [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]=>2 [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
click to show known generating functions       
Description
The smallest natural number $n$ such that $D(A)^{\otimes n} = 0$ for the linear Nakayama algebra $A$ 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("iteratedda", [IsList]);

InstallMethod(iteratedda, "for a representation of a quiver", [IsList],0,function(L)
    local A, CoRegA, W, WW, WW2, i;
    A := L[1];
    CoRegA := DirectSumOfQPAModules(IndecInjectiveModules(A));
    W := NakayamaFunctorOfModule(CoRegA);
    WW := [NakayamaFunctorOfModule(CoRegA)];
    for i in [2..10] do Append(WW,[NakayamaFunctorOfModule(WW[i-1])]);
    ;
    od;
    WW2 := Filtered([1..10],x->Dimension(WW[x])>0);
    return(Maximum(WW2)+1);
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.iteratedda([A]))
Created
Nov 15, 2018 at 21:12 by Rene Marczinzik
Updated
Mar 13, 2026 at 15:07 by Nupur Jain