Document Open Access Logo

A Positive Fraction Erdős-Szekeres Theorem and Its Applications

Authors Andrew Suk, Ji Zeng



PDF
Thumbnail PDF

File

LIPIcs.SoCG.2022.62.pdf
  • Filesize: 0.81 MB
  • 15 pages

Document Identifiers

Author Details

Andrew Suk
  • Department of Mathematics, University of California San Diego, La Jolla, CA, USA
Ji Zeng
  • Department of Mathematics, University of California San Diego, La Jolla, CA, USA

Acknowledgements

The authors wish to thank the anonymous SoCG referees for their valuable suggestions.

Cite AsGet BibTex

Andrew Suk and Ji Zeng. A Positive Fraction Erdős-Szekeres Theorem and Its Applications. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 62:1-62:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.SoCG.2022.62

Abstract

A famous theorem of Erdős and Szekeres states that any sequence of n distinct real numbers contains a monotone subsequence of length at least √n. Here, we prove a positive fraction version of this theorem. For n > (k-1)², any sequence A of n distinct real numbers contains a collection of subsets A_1,…, A_k ⊂ A, appearing sequentially, all of size s = Ω(n/k²), such that every subsequence (a_1,…, a_k), with a_i ∈ A_i, is increasing, or every such subsequence is decreasing. The subsequence S = (A_1,…, A_k) described above is called block-monotone of depth k and block-size s. Our theorem is asymptotically best possible and follows from a more general Ramsey-type result for monotone paths, which we find of independent interest. We also show that for any positive integer k, any finite sequence of distinct real numbers can be partitioned into O(k²log k) block-monotone subsequences of depth at least k, upon deleting at most (k-1)² entries. We apply our results to mutually avoiding planar point sets and biarc diagrams in graph drawing.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Combinatorics
Keywords
  • Erdős-Szekeres
  • block-monotone
  • monotone biarc diagrams
  • mutually avoiding sets

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Boris Aronov, Paul Erdős, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, and Leonard J. Schulman. Crossing families. In Proceedings of the seventh annual symposium on Computational geometry, pages 351-356, 1991. Google Scholar
  2. Reuven Bar-Yehuda and Sergio Fogel. Partitioning a sequence into few monotone subsequences. Acta Informatica, 35(5):421-440, 1998. Google Scholar
  3. Imre Bárány and Pavel Valtr. A positive fraction Erdős-Szekeres theorem. Discrete & Computational Geometry, 19(3):335-342, 1998. Google Scholar
  4. Frank Bernhart and Paul C. Kainen. The book thickness of a graph. Journal of Combinatorial Theory, Series B, 27(3):320-331, 1979. Google Scholar
  5. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, and Stephen K. Wismath. Curve-constrained drawings of planar graphs. Computational Geometry, 30(1):1-23, 2005. Google Scholar
  6. P. Erdős and G. Szekeres. A combinatorial problem in geometry. Compositio Mathematica, 2:463-470, 1935. Google Scholar
  7. Jacob Fox, János Pach, Benny Sudakov, and Andrew Suk. Erdős–Szekeres-type theorems for monotone paths and convex bodies. Proceedings of the London Mathematical Society, 105(5):953-982, May 2012. Google Scholar
  8. Kevin Milans, Derick Stolee, and Douglas West. Ordered Ramsey theory and track representations of graphs. Journal of Combinatorics, 6(4):445-456, 2015. Google Scholar
  9. Mozhgan Mirzaei and Andrew Suk. A positive fraction mutually avoiding sets theorem. Discrete Mathematics, 343(3):111730, 2020. Google Scholar
  10. Guy Moshkovitz and Asaf Shapira. Ramsey Theory, integer partitions and a new proof of the Erdős–Szekeres Theorem. Advances in Mathematics, 262:1107-1129, 2014. Google Scholar
  11. János Pach, Natan Rubin, and Gábor Tardos. Planar point sets determine many pairwise crossing segments. Advances in Mathematics, 386:107779, 2021. Google Scholar
  12. Attila Pór and Pavel Valtr. The partitioned version of the Erdős-Szekeres theorem. Discrete & Computational Geometry, 28(4):625-637, 2002. Google Scholar
  13. J. Michael Steele. Variations on the monotone subsequence theme of Erdős and Szekeres. In Discrete Probability and Algorithms, pages 111-131, New York, NY, 1995. Springer New York. Google Scholar
  14. Pavel Valtr. On mutually avoiding sets. In The Mathematics of Paul Erdös II, pages 324-328. Springer, 1997. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail