|
|
A263861
|
|
Triangle read by rows: T(n,k) (n>=0, k>=n+1) is the number of posets with n elements and whose order polytope has k facets.
|
|
0
|
|
|
1, 1, 1, 1, 1, 3, 1, 1, 7, 6, 2, 1, 13, 26, 17, 4, 2, 1, 22, 85, 112, 60, 27, 7, 3, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
COMMENTS
|
The order polytope of a poset P is given by all points in the unit cube [0,1]^P such that xp<xq for all p<q in P.
|
|
LINKS
|
Richard Stanley, Two poset polytopes, Discrete & Computational Geometry 1 (1986), DOI: 10.1007/BF02187680.
|
|
EXAMPLE
|
Triangle begins:
1,
1,
1,1,
1,3,1,
1,7,6,2,
1,13,26,17,4,2,
1,22,85,112,60,27,7,3,1,
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|