Identifier
- St001113: Dyck paths ⟶ ℤ
Values
=>
Cc0005;cc-rep
[1,0]=>0
[1,0,1,0]=>0
[1,1,0,0]=>0
[1,0,1,0,1,0]=>1
[1,0,1,1,0,0]=>0
[1,1,0,0,1,0]=>0
[1,1,0,1,0,0]=>0
[1,1,1,0,0,0]=>0
[1,0,1,0,1,0,1,0]=>1
[1,0,1,0,1,1,0,0]=>1
[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]=>0
[1,1,0,1,0,1,0,0]=>1
[1,1,0,1,1,0,0,0]=>0
[1,1,1,0,0,0,1,0]=>0
[1,1,1,0,0,1,0,0]=>0
[1,1,1,0,1,0,0,0]=>0
[1,1,1,1,0,0,0,0]=>0
[1,0,1,0,1,0,1,0,1,0]=>1
[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]=>1
[1,0,1,0,1,1,1,0,0,0]=>1
[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]=>0
[1,0,1,1,1,0,1,0,0,0]=>1
[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]=>0
[1,1,0,0,1,1,1,0,0,0]=>0
[1,1,0,1,0,0,1,0,1,0]=>0
[1,1,0,1,0,0,1,1,0,0]=>0
[1,1,0,1,0,1,0,0,1,0]=>1
[1,1,0,1,0,1,0,1,0,0]=>2
[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]=>0
[1,1,0,1,1,0,1,0,0,0]=>1
[1,1,0,1,1,1,0,0,0,0]=>0
[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]=>0
[1,1,1,0,0,1,0,1,0,0]=>0
[1,1,1,0,0,1,1,0,0,0]=>0
[1,1,1,0,1,0,0,0,1,0]=>0
[1,1,1,0,1,0,0,1,0,0]=>0
[1,1,1,0,1,0,1,0,0,0]=>1
[1,1,1,0,1,1,0,0,0,0]=>0
[1,1,1,1,0,0,0,0,1,0]=>0
[1,1,1,1,0,0,0,1,0,0]=>0
[1,1,1,1,0,0,1,0,0,0]=>0
[1,1,1,1,0,1,0,0,0,0]=>0
[1,1,1,1,1,0,0,0,0,0]=>0
[1,0,1,0,1,0,1,0,1,0,1,0]=>1
[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]=>1
[1,0,1,0,1,0,1,1,1,0,0,0]=>1
[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]=>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]=>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]=>1
[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]=>1
[1,0,1,0,1,1,1,1,0,0,0,0]=>1
[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]=>0
[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]=>2
[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]=>1
[1,0,1,1,0,1,1,0,1,0,0,0]=>1
[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]=>0
[1,0,1,1,1,0,0,1,0,1,0,0]=>0
[1,0,1,1,1,0,0,1,1,0,0,0]=>0
[1,0,1,1,1,0,1,0,0,0,1,0]=>1
[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]=>1
[1,0,1,1,1,0,1,1,0,0,0,0]=>1
[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]=>0
[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]=>1
[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]=>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]=>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]=>0
[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]=>0
[1,1,0,0,1,1,1,0,0,1,0,0]=>0
[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]=>0
[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]=>0
[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]=>0
[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]=>2
[1,1,0,1,0,1,0,1,0,1,0,0]=>2
[1,1,0,1,0,1,0,1,1,0,0,0]=>2
[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]=>1
[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]=>0
[1,1,0,1,1,0,0,0,1,1,0,0]=>0
[1,1,0,1,1,0,0,1,0,0,1,0]=>0
[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]=>0
[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]=>1
[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]=>1
[1,1,0,1,1,1,0,0,0,0,1,0]=>0
[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]=>0
[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]=>0
[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]=>0
[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]=>0
[1,1,1,0,0,1,0,0,1,1,0,0]=>0
[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]=>0
[1,1,1,0,0,1,1,0,0,0,1,0]=>0
[1,1,1,0,0,1,1,0,0,1,0,0]=>0
[1,1,1,0,0,1,1,0,1,0,0,0]=>0
[1,1,1,0,0,1,1,1,0,0,0,0]=>0
[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]=>0
[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]=>0
[1,1,1,0,1,0,1,0,0,0,1,0]=>1
[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]=>1
[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]=>0
[1,1,1,0,1,1,0,0,1,0,0,0]=>0
[1,1,1,0,1,1,0,1,0,0,0,0]=>1
[1,1,1,0,1,1,1,0,0,0,0,0]=>0
[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]=>0
[1,1,1,1,0,0,0,1,0,1,0,0]=>0
[1,1,1,1,0,0,0,1,1,0,0,0]=>0
[1,1,1,1,0,0,1,0,0,0,1,0]=>0
[1,1,1,1,0,0,1,0,0,1,0,0]=>0
[1,1,1,1,0,0,1,0,1,0,0,0]=>0
[1,1,1,1,0,0,1,1,0,0,0,0]=>0
[1,1,1,1,0,1,0,0,0,0,1,0]=>0
[1,1,1,1,0,1,0,0,0,1,0,0]=>0
[1,1,1,1,0,1,0,0,1,0,0,0]=>0
[1,1,1,1,0,1,0,1,0,0,0,0]=>1
[1,1,1,1,0,1,1,0,0,0,0,0]=>0
[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]=>0
[1,1,1,1,1,0,0,0,1,0,0,0]=>0
[1,1,1,1,1,0,0,1,0,0,0,0]=>0
[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]=>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
Description
The number of indecomposable projective non-injective modules of the linear Nakayama algebra corresponding to a Dyck path that have reflexive Auslander–Reiten sequences.
The correspondence between linear Nakayama algebras and Dyck paths is explained on the Nakayama algebras page.
The correspondence between linear Nakayama algebras and Dyck paths is explained on the Nakayama algebras page.
References
[1] , Tachikawa, H. Reflexive Auslander-Reiten sequences MathSciNet:1048418 zbMATH:0686.16023
Code
gap('LoadPackage("QPA");')
import tempfile as _tf, os as _os
_gap_code = r"""
DeclareOperation("IsReflexive", [IsList]);
InstallMethod(IsReflexive, "for a representation of a quiver", [IsList],0,function(L)
local A, CoRegA, SS, dd1, dd2;
A := L[1];
SS := L[2];
CoRegA := DirectSumOfQPAModules(IndecInjectiveModules(A));
dd1 := Size(ExtOverAlgebra(CoRegA,DTr(SS))[2]);
dd2 := Size(ExtOverAlgebra(NthSyzygy(CoRegA,1),DTr(SS))[2]);
return(dd1+dd2);
end
);
DeclareOperation("HasProjreflexiveARseq", [IsList]);
InstallMethod(HasProjreflexiveARseq, "for a representation of a quiver", [IsList],0,function(L)
local A, P, UU1, UU2;
A := L[1];
P := L[2];
UU1 := DTr(P,-1);
UU2 := Source(AlmostSplitSequence(UU1)[2]);
return(IsReflexive([A,UU1])+IsReflexive([A,UU2]));
end
);
DeclareOperation("NumberreflexiveARseq22", [IsList]);
InstallMethod(NumberreflexiveARseq22, "for a representation of a quiver", [IsList],0,function(L)
local A, LL, i, prnotinjA, projA, tr, tulu;
LL := L[1];
A := NakayamaAlgebra(LL,GF(3));
projA := IndecProjectiveModules(A);
prnotinjA := Filtered(projA,x->IsInjectiveModule(x)=false);
tulu := [];
for i in prnotinjA do Append(tulu,[HasProjreflexiveARseq([A,i])]);
od;
tr := Filtered(tulu,x->(x=0));
return(Size(tr));
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.NumberreflexiveARseq22([K]))
Created
Feb 24, 2018 at 10:07 by Rene Marczinzik
Updated
Mar 12, 2026 at 15:49 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!