Linear extension numbers of n-element posets
Abstract
We address the following natural but hitherto unstudied question: what are the possible linear extension numbers of an n-element poset? Let LE(n) denote the set of all positive integers that arise as the number of linear extensions of some n-element poset. We show that LE(n) skews towards the "small" end of the interval [1,n!]. More specifically, LE(n) contains all of the positive integers up to (cn n) for some absolute constant c, and |LE(n) ((n-1)!,n!]|<(n-3)!. The proof of the former statement involves some intermediate number-theoretic results about the Stern-Brocot tree that are of independent interest.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.