Search arXivSearch

arXiv · 2606.07806

Blow-ups of order types of positive density

Abstract

Order types are an equivalence relation between point configurations that capture their combinatorial and convexity properties. Let $P$ be a $κ$-colored sequence of $n \ge d+1$ points in general position in $\mathbb{R}^d$. Let $ρ$ be a $κ$-colored order type on $k \le d+1$ points that has positive density on $P$; that is, for some constant $δ>0$, there are $δ\cdot \binom{n}{k}$ $k$-point subsequences of $P$ that have the same order type as $ρ$ and the same color pattern. In this paper we show that there exists a constant $c >0$ (depending only on $d, δ$, $k$ and $κ$) and disjoint subsets $X_1,\dots,X_k$ of $P$, each with at least $c \cdot n$ points, such that for every choice of $k$ points $x_i \in X_i$, $(x_1,\dots,x_k)$ has the same order type and color pattern as $ρ$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruy Fabila-Monroy, Benedikt Hahn, Jesús Leaños. 2026-09-15. Blow-ups of order types of positive density. https://arxiv.org/abs/2606.07806

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