MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Definition: A poset $P$ is called a binomial poset if it satisfy a. $P$ is locally finite with a $\hat{0}$, and contains a infinite chain. b. Every interval $[x, y]$ of $P$ is graded. If $l(x,y)$ = n, then we call $[x,y]$ an n-interval. c. For all $n \in \mathbb{N}$, any two $n$-intervals contain the same number of maximal chains.

share|cite|improve this question
Is this a question? – Anthony Quas Dec 18 '12 at 18:51
The question is the title. – Ira Gessel Dec 19 '12 at 3:23
Let $c_n$ be the number of maximal chains in each n-interval. Does the list of chain-counts $c_1,c_2,\cdots$ determine a binomial poset $P$ up to isomorphism? If not then it seems = we can take non-isomorphic $P$ and $P'$ with the same chain-counts and identify the $\hat{0}$ to get a new poset with the same counts and non-isomorphic intervals. – Aaron Meyerowitz Dec 19 '12 at 7:09
up vote 5 down vote accepted

To avoid creating new binomial posets by taking two of them with the same factorial function (i.e., number of maximal chains in an $n$-interval) and identifying their least elements, we should add the extra condition that there exists a maximal chain $\hat{0}< x _0< x _1< \cdots$ such that every element $x$ satisfies $x\leq x_n$ for some $n$. Backelin has constructed an uncountable number of nonisomorphic such binomial posets, all with the same factorial function. Most of these have the property that they contain two nonisomorphic intervals of the same length. See

share|cite|improve this answer
Thank you very much! – Michael Zhong Dec 21 '12 at 16:07

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.