Identifier
Values
['A',1] => ([],1) => ([],1) => 2
['A',2] => ([(0,2),(1,2)],3) => ([(0,1),(0,2),(1,3),(2,3)],4) => 5
['B',2] => ([(0,3),(1,3),(3,2)],4) => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => 7
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => ([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7) => 11
['A',3] => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(0,3),(1,5),(2,4),(3,4),(3,5),(4,6),(5,6)],7) => 14
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 non-isomorphic subposets of a lattice which are lattices.
Map
to root poset
Description
The root poset of a finite Cartan type.
This is the poset on the set of positive roots of its root system where $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
This is the poset on the set of positive roots of its root system where $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
Map
Dedekind-MacNeille completion
Description
Return the smallest lattice containing the poset.
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!