English
Related papers

Related papers: Pach's selection theorem does not admit a topologi…

200 papers

Neglecting many motivating details for the Park-Pham theorem (previously known as the Kahn-Kalai conjecture), the result starts with a finite set $X$, a non-trivial upper set $\mathcal{F} \subseteq 2^X$, and a particular parameterized…

Combinatorics · Mathematics 2024-08-16 Bryce Alan Christopherson , Darian Colgrove

Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…

Combinatorics · Mathematics 2022-03-24 Matthew Kwan , Lisa Sauermann , Yufei Zhao

Let $d \ge 3$ be an integer. We show that whenever an order-$d$ tensor admits $d+1$ decompositions according to Tao's slice rank, if the linear subspaces spanned by their one-variable functions constitute a sunflower for each choice of…

Combinatorics · Mathematics 2023-08-15 Thomas Karam

The well know theorem of Tverberg states that if n > (d+1)(r-1) then one can partition any set of n points in R^d to r disjoint subsets whose convex hulls have a common point. The numbers T(d,r) = (d + 1)(r - 1) + 1 are known as Tverberg…

Combinatorics · Mathematics 2014-09-11 Micha A. Perles , Moriah Sigron

In a recent paper, Chan, \L aba, and Pramanik investigated geometric configurations inside thin subsets of the Euclidean set possessing measures with Fourier decay properties. In this paper we ask which configurations can be found inside…

Classical Analysis and ODEs · Mathematics 2016-07-06 Mike Bennett , Alex Iosevich , Krystal Taylor

In theory of one complex variable, Gauss-Lucas Theorem states that the critical points of a non constant polynomial belong to the convex hull of the set of zeros of the polynomial. The exact analogue of this result cannot hold, in general,…

Complex Variables · Mathematics 2017-11-08 Sorin G. Gal , J. Oscar González-Cervantes , Irene Sabadini

Let R be a commutative ring and let Spec(R) denote the collection of prime ideals of R. We define a topology on Spec(R) by using ultrafilters and demonstrate that this topology is identical to the well known patch or constructible topology.…

Commutative Algebra · Mathematics 2007-10-14 Marco Fontana , K. Alan Loper

Let $D_j\subset\Bbb C^{n_j}$ be a pseudoconvex domain and let $A_j\subset D_j$ be a locally pluriregular set, $j=1,...,N$. Put $$ X:=\bigcup_{j=1}^N A_1\times...\times A_{j-1}\times D_j\times A_{j+1}\times ...\times A_N\subset\Bbb…

Complex Variables · Mathematics 2007-05-23 Marek Jarnicki , Peter Pflug

We prove that if $A_0$ and $A_1$ are compact convex sets contained in a convex $n$-gon with vertices $g_1, \dots, g_n$, and $n$ is strictly greater than the number of common supporting lines of $A_0$ and $A_1$, then there exist $i \in…

Combinatorics · Mathematics 2025-12-18 Yiming Song

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

Geometric Topology · Mathematics 2018-10-24 Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

The colored Tverberg theorem asserts that for every d and r there exists t=t(d,r) such that for every set C in R^d of cardinality (d+1)t, partitioned into t-point subsets C_1,C_2,...,C_{d+1} (which we think of as color classes; e.g., the…

Combinatorics · Mathematics 2011-06-02 Jiří Matoušek , Martin Tancer , Uli Wagner

Consider $n$ points $X_1,\ldots,X_n$ in $\mathbb R^d$ and denote their convex hull by $\Pi$. We prove a number of inclusion-exclusion identities for the system of convex hulls $\Pi_I:=conv(X_i\colon i\in I)$, where $I$ ranges over all…

Probability · Mathematics 2016-03-07 Zakhar Kabluchko , Günter Last , Dmitry Zaporozhets

We study upward planar straight-line embeddings (UPSE) of directed trees on given point sets. The given point set $S$ has size at least the number of vertices in the tree. For the special case where the tree is a path $P$ we show that: (a)…

Computational Geometry · Computer Science 2020-12-22 Elena Arseneva , Pilar Cano , Linda Kleist , Tamara Mchedlidze , Saeed Mehrabi , Irene Parada , Pavel Valtr

Fix a dimension $d\ge 2$, and let $T_n$ be a random $d$-dimensional determinantal hypertree on $n$ vertices. We prove that \[\frac{\log|H_{d-1}(T_n,\mathbb{Z})|}{{{n\choose {d}}}}\] converges in probability to a constant $c_d$, which…

Combinatorics · Mathematics 2026-04-27 András Mészáros

This paper is devoted to studying the multiple recurrent property of topologically mildly mixing systems along generalized polynomials. We show that if a minimal system is topologically mildly mixing, then it is mild mixing of higher orders…

Dynamical Systems · Mathematics 2024-01-09 Yang Cao , Jianjie Zhao

Let $C_1,...,C_{d+1}$ be $d+1$ point sets in $\mathbb{R}^d$, each containing the origin in its convex hull. A subset $C$ of $\bigcup_{i=1}^{d+1} C_i$ is called a colorful choice (or rainbow) for $C_1, \dots, C_{d+1}$, if it contains exactly…

Computational Geometry · Computer Science 2016-08-08 Frédéric Meunier , Wolfgang Mulzer , Pauline Sarrabezolles , Yannik Stein

We study $\mathbb{R}^2\oplus\mathbb{R}$-separately convex hulls of finite sets of points in $\mathbb{R}^3$, as in KirchheimMullerSverak2003. This notion of convexity, which we call $2+1$ convexity, corresponds to rank-one convex convexity,…

Analysis of PDEs · Mathematics 2022-09-30 Pablo Angulo , Carlos García-Gutiérrez

For a positive integer $n\geq 3$, the sides and diagonals of a convex $n$-gon divide the interior of the convex $n$-gon into finitely (polynomial in $n$) many regions bounded by them. In this article, we associate to every region a unique…

Combinatorics · Mathematics 2021-04-13 C P Anil Kumar

A subset of a topological space is constructible if it is a finite Boolean combination of closed sets. We prove that every NTP$_2$ expansion of $(\mathbb{R},<,+)$ by constructible sets defines only constructible sets, and that definable…

Logic · Mathematics 2026-05-20 Pablo Andújar Guerrero

We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…

Logic · Mathematics 2007-05-23 Peter Cholak , Leo Harrington