searching the database
Your data matches 44 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St001615
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 0
([],2)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,2)],3)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 2
([(0,1),(0,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 2
([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 3
([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> 4
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 3
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> 4
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 4
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 5
Description
The number of join prime elements of a lattice.
An element $x$ of a lattice $L$ is join-prime (or coprime) if $x \leq a \vee b$ implies $x \leq a$ or $x \leq b$ for every $a, b \in L$.
Matching statistic: St001617
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 0
([],2)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,2)],3)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 2
([(0,1),(0,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 2
([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 3
([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> 4
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 3
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> 4
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 4
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 5
Description
The dimension of the space of valuations of a lattice.
A valuation, or modular function, on a lattice $L$ is a function $v:L\mapsto\mathbb R$ satisfying
$$
v(a\vee b) + v(a\wedge b) = v(a) + v(b).
$$
It was shown by Birkhoff [1, thm. X.2], that a lattice with a positive valuation must be modular. This was sharpened by Fleischer and Traynor [2, thm. 1], which states that the modular functions on an arbitrary lattice are in bijection with the modular functions on its modular quotient [[Mp00196]].
Moreover, Birkhoff [1, thm. X.2] showed that the dimension of the space of modular functions equals the number of subsets of projective prime intervals.
Matching statistic: St001623
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> ([(0,1)],2)
=> 0
([],2)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,1)],2)
=> ([(0,2),(2,1)],3)
=> 1
([(1,2)],3)
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 2
([(0,1),(0,2)],3)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 2
([(0,2),(2,1)],3)
=> ([(0,3),(2,1),(3,2)],4)
=> 2
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> 2
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 3
([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> 4
([(0,3),(2,1),(3,2)],4)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 3
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> 4
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> 4
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 5
Description
The number of doubly irreducible elements of a lattice.
An element $d$ of a lattice $L$ is '''doubly irreducible''' if it is both join and meet irreducible. That means, $d$ is neither the least nor the greatest element of $L$ and if $d=x\vee y$ or $d=x\wedge y$, then $d\in\{x,y\}$ for all $x,y\in L$.
In a finite lattice, the doubly irreducible elements are those which cover and are covered by a unique element.
Matching statistic: St001622
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 0
([],2)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,1)],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,2)],3)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 2
([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 3
([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> 4
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 3
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> 4
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 4
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 5
Description
The number of join-irreducible elements of a lattice.
An element $j$ of a lattice $L$ is '''join irreducible''' if it is not the least element and if $j=x\vee y$, then $j\in\{x,y\}$ for all $x,y\in L$.
Matching statistic: St001636
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> 1 = 0 + 1
([],2)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,1)],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(1,2)],3)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 3 = 2 + 1
([(0,1),(0,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,2),(0,3),(3,1)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 3 = 2 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 4 = 3 + 1
([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 4 = 3 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> 5 = 4 + 1
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 4 = 3 + 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 3 = 2 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 4 = 3 + 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> 5 = 4 + 1
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 5 = 4 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5 = 4 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 4 = 3 + 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6 = 5 + 1
Description
The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset.
Matching statistic: St000717
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> ? = 0 + 1
([],2)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,1)],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(1,2)],3)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 3 = 2 + 1
([(0,1),(0,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,2),(0,3),(3,1)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 3 = 2 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 4 = 3 + 1
([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 4 = 3 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> 5 = 4 + 1
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 4 = 3 + 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 3 = 2 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 4 = 3 + 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> 5 = 4 + 1
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 5 = 4 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5 = 4 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 4 = 3 + 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6 = 5 + 1
Description
The number of ordinal summands of a poset.
The ordinal sum of two posets $P$ and $Q$ is the poset having elements $(p,0)$ and $(q,1)$ for $p\in P$ and $q\in Q$, and relations $(a,0) < (b,0)$ if $a < b$ in $P$, $(a,1) < (b,1)$ if $a < b$ in $Q$, and $(a,0) < (b,1)$.
This statistic is the length of the longest ordinal decomposition of a poset.
Matching statistic: St000906
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> ? = 0 + 1
([],2)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,1)],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 2 = 1 + 1
([(1,2)],3)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 3 = 2 + 1
([(0,1),(0,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,2),(0,3),(3,1)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 3 = 2 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 4 = 3 + 1
([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 4 = 3 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> 5 = 4 + 1
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 4 = 3 + 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 3 = 2 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 4 = 3 + 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> 5 = 4 + 1
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 5 = 4 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5 = 4 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 4 = 3 + 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6 = 5 + 1
Description
The length of the shortest maximal chain in a poset.
Matching statistic: St001637
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Values
([],1)
=> ? = 0
([],2)
=> 2
([(0,1)],2)
=> 1
([(1,2)],3)
=> 2
([(0,1),(0,2)],3)
=> 2
([(0,2),(2,1)],3)
=> 2
([(0,2),(1,2)],3)
=> 2
([(0,2),(0,3),(3,1)],4)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,3),(3,1),(3,2)],4)
=> 3
([(0,3),(1,3),(3,2)],4)
=> 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> 4
([(0,3),(2,1),(3,2)],4)
=> 3
([(0,3),(1,2),(2,3)],4)
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> 4
([(0,3),(3,4),(4,1),(4,2)],5)
=> 4
([(0,4),(2,3),(3,1),(4,2)],5)
=> 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ? = 5
Description
The number of (upper) dissectors of a poset.
Matching statistic: St001875
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> ([],1)
=> ? = 0 + 1
([],2)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,1)],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> ? = 1 + 1
([(1,2)],3)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,1),(0,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 3 = 2 + 1
([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,2),(0,3),(3,1)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 4 = 3 + 1
([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 4 = 3 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> 5 = 4 + 1
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 4 = 3 + 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 4 = 3 + 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> 5 = 4 + 1
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> 5 = 4 + 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5 = 4 + 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 4 = 3 + 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6 = 5 + 1
Description
The number of simple modules with projective dimension at most 1.
Matching statistic: St001621
Values
([],1)
=> ([],1)
=> ([],1)
=> ([],1)
=> 0
([],2)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,1)],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
([(1,2)],3)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 2
([(0,1),(0,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(3,1)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,3),(3,1),(3,2)],4)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> ? = 3
([(0,3),(1,3),(3,2)],4)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> ? = 3
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,3),(0,4),(1,5),(2,5),(3,6),(4,6),(6,1),(6,2)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16)
=> ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16)
=> ? = 4
([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> ? = 3
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> ? = 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16)
=> ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16)
=> ? = 4
([(0,3),(3,4),(4,1),(4,2)],5)
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16)
=> ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16)
=> ? = 4
([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16)
=> ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16)
=> ? = 4
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> ? = 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,12),(1,13),(1,14),(1,15),(2,9),(2,10),(2,11),(2,15),(3,7),(3,8),(3,11),(3,14),(4,6),(4,8),(4,10),(4,13),(5,6),(5,7),(5,9),(5,12),(6,16),(6,19),(6,22),(7,16),(7,17),(7,20),(8,16),(8,18),(8,21),(9,17),(9,19),(9,23),(10,18),(10,19),(10,24),(11,17),(11,18),(11,25),(12,20),(12,22),(12,23),(13,21),(13,22),(13,24),(14,20),(14,21),(14,25),(15,23),(15,24),(15,25),(16,29),(16,30),(17,26),(17,30),(18,27),(18,30),(19,28),(19,30),(20,26),(20,29),(21,27),(21,29),(22,28),(22,29),(23,26),(23,28),(24,27),(24,28),(25,26),(25,27),(26,31),(27,31),(28,31),(29,31),(30,31)],32)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,12),(1,13),(1,14),(1,15),(2,9),(2,10),(2,11),(2,15),(3,7),(3,8),(3,11),(3,14),(4,6),(4,8),(4,10),(4,13),(5,6),(5,7),(5,9),(5,12),(6,16),(6,19),(6,22),(7,16),(7,17),(7,20),(8,16),(8,18),(8,21),(9,17),(9,19),(9,23),(10,18),(10,19),(10,24),(11,17),(11,18),(11,25),(12,20),(12,22),(12,23),(13,21),(13,22),(13,24),(14,20),(14,21),(14,25),(15,23),(15,24),(15,25),(16,29),(16,30),(17,26),(17,30),(18,27),(18,30),(19,28),(19,30),(20,26),(20,29),(21,27),(21,29),(22,28),(22,29),(23,26),(23,28),(24,27),(24,28),(25,26),(25,27),(26,31),(27,31),(28,31),(29,31),(30,31)],32)
=> ? = 5
Description
The number of atoms of a lattice.
An element of a lattice is an '''atom''' if it covers the least element.
The following 34 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000454The largest eigenvalue of a graph if it is integral. St000379The number of Hamiltonian cycles in a graph. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St000656The number of cuts of a poset. St000680The Grundy value for Hackendot on posets. St000327The number of cover relations in a poset. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000643The size of the largest orbit of antichains under Panyushev complementation. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001668The number of points of the poset minus the width of the poset. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001060The distinguishing index of a graph. St001118The acyclic chromatic index of a graph. St001545The second Elser number of a connected graph. St000456The monochromatic index of a connected graph. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St001570The minimal number of edges to add to make a graph Hamiltonian. St000455The second largest eigenvalue of a graph if it is integral. St000509The diagonal index (content) of a partition. St000464The Schultz index of a connected graph. St000264The girth of a graph, which is not a tree. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000699The toughness times the least common multiple of 1,. St001498The normalised height of a Nakayama algebra with magnitude 1.
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!