Identifier
- St001238: Dyck paths ⟶ ℤ
Values
=>
Cc0005;cc-rep
[1,0]=>1
[1,0,1,0]=>1
[1,1,0,0]=>1
[1,0,1,0,1,0]=>2
[1,0,1,1,0,0]=>1
[1,1,0,0,1,0]=>1
[1,1,0,1,0,0]=>1
[1,1,1,0,0,0]=>1
[1,0,1,0,1,0,1,0]=>3
[1,0,1,0,1,1,0,0]=>2
[1,0,1,1,0,0,1,0]=>1
[1,0,1,1,0,1,0,0]=>1
[1,0,1,1,1,0,0,0]=>1
[1,1,0,0,1,0,1,0]=>2
[1,1,0,0,1,1,0,0]=>1
[1,1,0,1,0,0,1,0]=>2
[1,1,0,1,0,1,0,0]=>2
[1,1,0,1,1,0,0,0]=>1
[1,1,1,0,0,0,1,0]=>1
[1,1,1,0,0,1,0,0]=>1
[1,1,1,0,1,0,0,0]=>1
[1,1,1,1,0,0,0,0]=>1
[1,0,1,0,1,0,1,0,1,0]=>4
[1,0,1,0,1,0,1,1,0,0]=>3
[1,0,1,0,1,1,0,0,1,0]=>2
[1,0,1,0,1,1,0,1,0,0]=>2
[1,0,1,0,1,1,1,0,0,0]=>2
[1,0,1,1,0,0,1,0,1,0]=>2
[1,0,1,1,0,0,1,1,0,0]=>1
[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]=>1
[1,0,1,1,1,0,0,0,1,0]=>1
[1,0,1,1,1,0,0,1,0,0]=>1
[1,0,1,1,1,0,1,0,0,0]=>1
[1,0,1,1,1,1,0,0,0,0]=>1
[1,1,0,0,1,0,1,0,1,0]=>3
[1,1,0,0,1,0,1,1,0,0]=>2
[1,1,0,0,1,1,0,0,1,0]=>1
[1,1,0,0,1,1,0,1,0,0]=>1
[1,1,0,0,1,1,1,0,0,0]=>1
[1,1,0,1,0,0,1,0,1,0]=>3
[1,1,0,1,0,0,1,1,0,0]=>2
[1,1,0,1,0,1,0,0,1,0]=>3
[1,1,0,1,0,1,0,1,0,0]=>3
[1,1,0,1,0,1,1,0,0,0]=>2
[1,1,0,1,1,0,0,0,1,0]=>1
[1,1,0,1,1,0,0,1,0,0]=>1
[1,1,0,1,1,0,1,0,0,0]=>1
[1,1,0,1,1,1,0,0,0,0]=>1
[1,1,1,0,0,0,1,0,1,0]=>2
[1,1,1,0,0,0,1,1,0,0]=>1
[1,1,1,0,0,1,0,0,1,0]=>2
[1,1,1,0,0,1,0,1,0,0]=>2
[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]=>1
[1,1,1,1,0,0,0,0,1,0]=>1
[1,1,1,1,0,0,0,1,0,0]=>1
[1,1,1,1,0,0,1,0,0,0]=>1
[1,1,1,1,0,1,0,0,0,0]=>1
[1,1,1,1,1,0,0,0,0,0]=>1
[1,0,1,0,1,0,1,0,1,0,1,0]=>5
[1,0,1,0,1,0,1,0,1,1,0,0]=>4
[1,0,1,0,1,0,1,1,0,0,1,0]=>3
[1,0,1,0,1,0,1,1,0,1,0,0]=>3
[1,0,1,0,1,0,1,1,1,0,0,0]=>3
[1,0,1,0,1,1,0,0,1,0,1,0]=>3
[1,0,1,0,1,1,0,0,1,1,0,0]=>2
[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]=>2
[1,0,1,0,1,1,1,0,0,0,1,0]=>2
[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]=>2
[1,0,1,0,1,1,1,1,0,0,0,0]=>2
[1,0,1,1,0,0,1,0,1,0,1,0]=>3
[1,0,1,1,0,0,1,0,1,1,0,0]=>2
[1,0,1,1,0,0,1,1,0,0,1,0]=>1
[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]=>3
[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]=>3
[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]=>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]=>2
[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]=>1
[1,0,1,1,1,0,1,0,0,0,1,0]=>2
[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]=>2
[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]=>1
[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]=>1
[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]=>1
[1,1,0,0,1,0,1,0,1,0,1,0]=>4
[1,1,0,0,1,0,1,0,1,1,0,0]=>3
[1,1,0,0,1,0,1,1,0,0,1,0]=>2
[1,1,0,0,1,0,1,1,0,1,0,0]=>2
[1,1,0,0,1,0,1,1,1,0,0,0]=>2
[1,1,0,0,1,1,0,0,1,0,1,0]=>2
[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]=>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]=>1
[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]=>1
[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]=>1
[1,1,0,1,0,0,1,0,1,0,1,0]=>4
[1,1,0,1,0,0,1,0,1,1,0,0]=>3
[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]=>4
[1,1,0,1,0,1,0,0,1,1,0,0]=>3
[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]=>2
[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]=>2
[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]=>1
[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]=>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]=>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]=>1
[1,1,0,1,1,1,0,0,0,1,0,0]=>1
[1,1,0,1,1,1,0,0,1,0,0,0]=>1
[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]=>1
[1,1,1,0,0,0,1,0,1,0,1,0]=>3
[1,1,1,0,0,0,1,0,1,1,0,0]=>2
[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]=>1
[1,1,1,0,0,0,1,1,1,0,0,0]=>1
[1,1,1,0,0,1,0,0,1,0,1,0]=>3
[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]=>3
[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]=>2
[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]=>1
[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]=>1
[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]=>2
[1,1,1,0,1,0,0,1,0,0,1,0]=>3
[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]=>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]=>1
[1,1,1,0,1,1,0,0,0,1,0,0]=>1
[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]=>1
[1,1,1,0,1,1,1,0,0,0,0,0]=>1
[1,1,1,1,0,0,0,0,1,0,1,0]=>2
[1,1,1,1,0,0,0,0,1,1,0,0]=>1
[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]=>2
[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]=>1
[1,1,1,1,0,1,0,0,0,0,1,0]=>2
[1,1,1,1,0,1,0,0,0,1,0,0]=>2
[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]=>1
[1,1,1,1,1,0,0,0,0,0,1,0]=>1
[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]=>1
[1,1,1,1,1,0,0,1,0,0,0,0]=>1
[1,1,1,1,1,0,1,0,0,0,0,0]=>1
[1,1,1,1,1,1,0,0,0,0,0,0]=>1
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 simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S.
Code
DeclareOperation("testisodtrsecsyz",[IsList]); InstallMethod(testisodtrsecsyz, "for a representation of a quiver", [IsList],0,function(LIST) local A,simA,U; A:=LIST[1]; simA:=SimpleModules(A); U:=Filtered(simA,x->IsomorphicModules(DTr(x),NakayamaFunctorOfModule(NthSyzygyNC(x,2)))=true); return(Size(U)); end);
Created
Aug 13, 2018 at 14:06 by Rene Marczinzik
Updated
Aug 13, 2018 at 14:06 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!