Search arXivSearch

arXiv · 2508.20360

Three Generalizations of Erdős Szekeres: $k$-Modal Subsequences

Abstract

Erdős and Szekeres showed that given a permutation $p$ of $[n]$, and the sequence defined by \newline $(p(1), p(2), \ldots, p(n))$, there exists either a decreasing or increasing subsequence, not necessarily contiguous, of length at least $\sqrt{n}$. Fan Chung considered subsequences that can have at most one change of direction, i.e. an increasing and then decreasing subsequence, or a decreasing and then increasing subsequence. She called these unimodal subsequences, and showed there exists a unimodal subsequence of length at least $\sqrt{3n}$, up to some constants \cite{chung}. She conjectured that a permutation of $n$ contains a $k$-modal (at most $k$ changes in direction) subsequence of length at least $\sqrt{(2k+1)n}$ up to some constants. Zijian Xu proved this conjecture in 2024 \cite{xu}, and we will provide another substantially different proof using "sophisticated labeling arguments" instead of "underlying poset structures behind k-modal subsequences." We also show that there exists an increasing first $k$-modal subsequence of length at least $\sqrt{2kn}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Charles Gong. 2026-02-19. Three Generalizations of Erdős Szekeres: $k$-Modal Subsequences. https://arxiv.org/abs/2508.20360

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO