Identifier
- St001266: 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]=>1
[1,1,0,0,1,1,0,0]=>0
[1,1,0,1,0,0,1,0]=>2
[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]=>1
[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]=>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]=>1
[1,1,0,0,1,0,1,1,0,0]=>1
[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]=>2
[1,1,0,1,0,0,1,1,0,0]=>2
[1,1,0,1,0,1,0,0,1,0]=>2
[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]=>2
[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]=>1
[1,1,1,0,0,0,1,1,0,0]=>0
[1,1,1,0,0,1,0,0,1,0]=>2
[1,1,1,0,0,1,0,1,0,0]=>1
[1,1,1,0,0,1,1,0,0,0]=>0
[1,1,1,0,1,0,0,0,1,0]=>3
[1,1,1,0,1,0,0,1,0,0]=>2
[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]=>2
[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]=>1
[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]=>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]=>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]=>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]=>2
[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]=>1
[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]=>2
[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]=>0
[1,0,1,1,1,0,1,0,0,0,1,0]=>3
[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]=>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]=>1
[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]=>1
[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]=>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]=>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]=>0
[1,1,0,0,1,1,1,0,1,0,0,0]=>1
[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]=>2
[1,1,0,1,0,0,1,1,0,0,1,0]=>2
[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]=>2
[1,1,0,1,0,1,0,0,1,0,1,0]=>2
[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]=>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]=>2
[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]=>0
[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]=>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]=>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]=>2
[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]=>1
[1,1,1,0,0,0,1,0,1,1,0,0]=>1
[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]=>2
[1,1,1,0,0,1,0,0,1,1,0,0]=>2
[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]=>2
[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]=>0
[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]=>1
[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]=>3
[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]=>2
[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]=>2
[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]=>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]=>3
[1,1,1,0,1,1,0,0,1,0,0,0]=>2
[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]=>1
[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]=>2
[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]=>0
[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]=>2
[1,1,1,1,0,0,1,0,1,0,0,0]=>1
[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]=>4
[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]=>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 largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra.
Code
DeclareOperation("maxref",[IsList]); InstallMethod(maxref, "for a representation of a quiver", [IsList],0,function(LIST) local A,simA,U,L,UU; A:=LIST[1]; L:=ARQuiverNak([A]); L:=Filtered(L,x->IsProjectiveModule(x)=false); U:=Filtered(L,x->DominantDimensionOfModule(x,30)>=1 and Dimension(x)=Dimension(StarOfModule(StarOfModule(x)))); UU:=[];for i in U do Append(UU,[Dimension(i)]);od; if Size(UU)=0 then return(0);else return(Maximum(UU));fi; end);
Created
Oct 03, 2018 at 23:11 by Rene Marczinzik
Updated
Oct 03, 2018 at 23:11 by Rene Marczinzik
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!