Improving the \(\frac{1}{3}\)-\(\frac{2}{3}\) conjecture for width two posets (Q2036599): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00493-020-4091-3 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3110454864 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1811.01500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing pairs and the cross product conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced pairs in partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiorders and the 1/3-2/3 conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting under partial information (without the ellipsoid algorithm). / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of partially ordered sets with small balance constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poset entropy versus number of linear extensions: the width-2 case. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear extension majority graphs of partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good is the information theory bound in sorting? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic polynomials and logarithmic concavity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy and sorting. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing poset extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite partially ordered sets and their corresponding permutation sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Information-Theoretic Bound is Good for Merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(1/3-2/3\) conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gold partition conjecture for 6-thin posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Worst Balanced Partially Ordered Sets—Ladders with Broken Rungs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balance theorems for height-2 posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(1/3\)-\(2/3\) conjecture for \(N\)-free ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 1/3-2/3 conjecture for ordered sets whose cover graph is a forest / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00493-020-4091-3 / rank
 
Normal rank

Latest revision as of 20:33, 16 December 2024

scientific article
Language Label Description Also known as
English
Improving the \(\frac{1}{3}\)-\(\frac{2}{3}\) conjecture for width two posets
scientific article

    Statements

    Improving the \(\frac{1}{3}\)-\(\frac{2}{3}\) conjecture for width two posets (English)
    0 references
    0 references
    29 June 2021
    0 references
    The \(\frac{1}{3}\)-\(\frac{2}{3}\) conjecture states that for any poset (partially ordered set) \((P,\prec)\) which is not totally ordered, there are two incomparable elements \(x,y\in P\) such that, considering the probability space of all linear extensions of \(P\) (i.e. total orderings compatible with the partial order \(\prec\)) with the uniform distribution, we have \(\mathbb{P}(x\prec y)\in [1/3,2/3]\). Equivalently, defining \(\delta (P)=\max_{\{x,y\} \subseteq P} \min (\mathbb{P}(x\prec y). \mathbb{P}(y\prec x))\), we have \(\delta(P)\geq 1/3\) for any poset \(P\) which is not totally ordered. It is known that we cannot improve on the interval \([1/3,2/3]\) in the first form of the conjecture (respectively on the constant \(1/3\)) in the formulation involving \(\delta(P)\); for example consider the poset \(\mathcal{E}\) comprising three vertices \(\{x,y,z\}\) with exactly one relation \(x\prec y\). Various special cases are known: they include width 2 posets, see \textit{N. Linial} [SIAM J. Comput. 13, 795--801 (1984; Zbl 0548.68065)], but the general problem seems to be very difficult. \par Attention in this paper focusses on the case of width 2 posets. \textit{M. Aigner} [Order 2, 257--264 (1985; Zbl 0582.06003)] showed that width 2 posets which achieve \(\delta(P)=1/3\) are very limited (they are direct sums of copies of \(\mathcal{E}\) above and the one-element poset). The first main contribution of the paper under review is to show that when a width 2 poset does not have \(\delta(P)=1/3\) then there is a new lower bound for \(\delta(P)\), namely \((5\sqrt{17}-3)/52\simeq 0.33876\). Numerical work in \textit{M. Peczarski} [Exp. Math. 28, No. 2, 181--184 (2019; Zbl 1490.06002)] suggests that an improvement to about 0.348842 may be possible. \par In the other direction, the author can improve on an infinite sequence \((P_{n})\) of width 2 posets constructed in \textit{E. Chen} [Electron. J. Comb. 25, No. 4, Research Paper P4.43, 13 p. (2018; Zbl 06989244)] where the limiting value of \(\delta(P_{n})\) is about 0.3488999, by giving a sequence \((Q_{n})\) for which the limit of \(\delta(Q_{n})\) is 0.348833. (All these limits are quadratic surds). This time, Peczarski's numerical work [loc. cit,] suggests that this sequence of examples may be best possible. \par Both results make use of a path-counting interpretation of identification of linear extensions of width 2 posets with a certain path-counting problem. The author also notes some open problems.
    0 references
    poset
    0 references
    balance conjecture
    0 references
    \(\frac{1}{3}\)-\(\frac{2}{3}\) conjecture
    0 references
    width 2 poset
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references