Identifier
- St001140: 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]=>0
[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]=>0
[1,0,1,1,0,0,1,0]=>1
[1,0,1,1,0,1,0,0]=>0
[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]=>0
[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]=>2
[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]=>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]=>2
[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]=>2
[1,0,1,1,1,0,1,0,0,0]=>0
[1,0,1,1,1,1,0,0,0,0]=>0
[1,1,0,0,1,0,1,0,1,0]=>1
[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]=>0
[1,1,0,1,0,0,1,0,1,0]=>1
[1,1,0,1,0,0,1,1,0,0]=>0
[1,1,0,1,0,1,0,0,1,0]=>2
[1,1,0,1,0,1,0,1,0,0]=>1
[1,1,0,1,0,1,1,0,0,0]=>0
[1,1,0,1,1,0,0,0,1,0]=>2
[1,1,0,1,1,0,0,1,0,0]=>1
[1,1,0,1,1,0,1,0,0,0]=>0
[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]=>0
[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]=>3
[1,0,1,0,1,0,1,0,1,1,0,0]=>2
[1,0,1,0,1,0,1,1,0,0,1,0]=>2
[1,0,1,0,1,0,1,1,0,1,0,0]=>2
[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]=>2
[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]=>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]=>2
[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]=>0
[1,0,1,1,0,0,1,0,1,0,1,0]=>2
[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]=>2
[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]=>1
[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]=>1
[1,0,1,1,0,1,0,1,0,0,1,0]=>4
[1,0,1,1,0,1,0,1,0,1,0,0]=>3
[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]=>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]=>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]=>1
[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]=>2
[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]=>2
[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]=>0
[1,0,1,1,1,1,0,0,0,0,1,0]=>1
[1,0,1,1,1,1,0,0,0,1,0,0]=>2
[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]=>0
[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]=>2
[1,1,0,0,1,0,1,0,1,1,0,0]=>1
[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]=>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]=>1
[1,1,0,0,1,1,0,0,1,1,0,0]=>1
[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]=>2
[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]=>1
[1,1,0,0,1,1,1,0,0,1,0,0]=>2
[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]=>2
[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]=>1
[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]=>3
[1,1,0,1,0,1,0,0,1,1,0,0]=>2
[1,1,0,1,0,1,0,1,0,0,1,0]=>3
[1,1,0,1,0,1,0,1,0,1,0,0]=>3
[1,1,0,1,0,1,0,1,1,0,0,0]=>1
[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]=>3
[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]=>0
[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]=>2
[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]=>3
[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]=>2
[1,1,0,1,1,0,1,0,0,1,0,0]=>4
[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]=>0
[1,1,0,1,1,1,0,0,0,0,1,0]=>2
[1,1,0,1,1,1,0,0,0,1,0,0]=>4
[1,1,0,1,1,1,0,0,1,0,0,0]=>2
[1,1,0,1,1,1,0,1,0,0,0,0]=>0
[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]=>1
[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]=>1
[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]=>1
[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]=>2
[1,1,1,0,0,1,0,1,0,1,0,0]=>1
[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]=>2
[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]=>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]=>1
[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]=>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]=>0
[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]=>2
[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]=>0
[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]=>2
[1,1,1,0,1,1,0,0,1,0,0,0]=>1
[1,1,1,0,1,1,0,1,0,0,0,0]=>0
[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]=>0
[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
Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra.
References
[1] Marczinzik, René Upper bounds for the dominant dimension of Nakayama and related algebras. zbMATH:06820683
Code
gap('LoadPackage("QPA");')
def NthRadical(M, n):
if n == 0:
f = gap.IdentityMapping(M)
else:
f = gap.RadicalOfModuleInclusion(M)
N = gap.Source(f)
for i in range(n-1):
h = gap.RadicalOfModuleInclusion(N);
N = gap.Source(h)
f = h * f
return f
def ARQuiverNak(A):
injA = gap.IndecInjectiveModules(A)
L = [gap.Source(NthRadical(inj, j))
for inj in injA
for j in range(gap.Dimension(inj).sage())]
return L
def kupisch(D):
H = D.heights()
return [1+H[i] for i, s in enumerate(D) if s == 0]+[1]
def statistic(D):
K = kupisch(D)
A = gap.NakayamaAlgebra(K, gap.GF(3))
L = ARQuiverNak(A)
return sum(1 for x in L
if gap.ProjDimensionOfModule(x, 30) >= 2 and gap.InjDimensionOfModule(x, 30) >= 2)
# gap
DeclareOperation("NthRadical",[IsList]);
InstallMethod(NthRadical, "for a representation of a quiver", [IsList], 0, function(LIST)
local M, n, f, N, i, h;
M := LIST[1];
n := LIST[2];
if n = 0 then
return(IdentityMapping(M));
else
f := RadicalOfModuleInclusion(M);
N := Source(f);
for i in [1..n-1] do
h := RadicalOfModuleInclusion(N);
N := Source(h);
f := \*(h,f);
od;
return(f);
fi;
end);
DeclareOperation("ARQuiverNak",[IsList]);
InstallMethod(ARQuiverNak, "for a representation of a quiver", [IsList], 0, function(LIST)
local A, injA, UU, j, i;
A := LIST[1];
injA := IndecInjectiveModules(A);
UU := [];
for i in injA do
for j in [0..Dimension(i)-1] do
Append(UU,[Source(NthRadical([i,j]))]);
od;
od;
return(UU);
end);
DeclareOperation("statistic",[IsList]);
InstallMethod(statistic, "for a representation of a quiver", [IsList],0,function(LIST)
local LU, A, L, LL, x;
LU := LIST[1];
A := NakayamaAlgebra(LU,GF(3));
L := ARQuiverNak([A]);
LL := Filtered(L, x -> ProjDimensionOfModule(x,30) >= 2 and InjDimensionOfModule(x, 30) >= 2);
return(Size(LL));
end);
Created
Apr 09, 2018 at 14:30 by Rene Marczinzik
Updated
Aug 24, 2020 at 18:49 by Martin Rubey
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!