Linear Extension Numbers of n-Element Posets
Name
11083_2020_9527_ReferencePDF.pdf
Size
784.75 KB
Format
Adobe PDF
Checksum (MD5)
b02822f33542b8a06c2da63c91c89d47
Author(s)
Kravitz, Noah
Sah, Ashwin
Date Issued
May 11, 2020
Publisher
Springer Netherlands
Version
Author's final manuscript
Abstract
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
exp
c
n
log
n
$\exp \left (c\frac {n}{\log n}\right )$
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s11083-020-09527-2
