English
Related papers

Related papers: Tight bounds on discrete quantitative Helly number…

200 papers

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

Combinatorics · Mathematics 2025-05-30 Rajko Nenadov , Lander Verlinde

Fix $k$ a positive integer, and let $\ell$ be coprime to $k$. Let $p(k,\ell)$ denote the smallest prime equivalent to $\ell \pmod{k}$, and set $P(k)$ to be the maximum of all the $p(k,\ell)$. We seek lower bounds for $P(k)$. In particular,…

Number Theory · Mathematics 2016-12-23 Junxian Li , Kyle Pratt , George Shakan

Based on a result of Makeev, in 2012 Blagojevi\'c and Karasev proposed the following problem: given any positive integers $m$ and $1\leq \ell\leq k$, find the minimum dimension $d=\Delta(m;\ell/k)$ such that for any $m$ mass distributions…

Combinatorics · Mathematics 2024-03-12 Andres Mejia , Steven Simon , Jialin Zhang

In 2013, Koldobsky posed the problem to find a constant $d_n$, depending only on the dimension $n$, such that for any origin-symmetric convex body $K\subset\mathbb{R}^n$ there exists an $(n-1)$-dimensional linear subspace…

Metric Geometry · Mathematics 2024-01-26 Ansgar Freyer , Martin Henk

The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. A well-known conjecture of Erd\H{o}s and Hajnal states that for any fixed…

Combinatorics · Mathematics 2026-05-12 Chunchao Fan , Mingze Li , Qizhong Lin , Bo Ning

We prove a new kind of estimate that holds on any manifold with lower Ricci bounds. It relates the geometry of two small balls with the same radius, potentially far apart, but centered in the interior of a common minimizing geodesic. It…

Differential Geometry · Mathematics 2011-09-23 Tobias Colding , Aaron Naber

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Metric Geometry · Mathematics 2022-03-23 Brett Leroux , Luis Rademacher

Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…

For every $k\ge 2$ and $\Delta$, we prove that there exists a constant $C_{\Delta,k}$ such that the following holds. For every graph $H$ with $\chi(H)=k$ and every tree with at least $C_{\Delta,k}|H|$ vertices and maximum degree at most…

Combinatorics · Mathematics 2025-09-17 Richard Montgomery , Matías Pavez-Signé , Jun Yan

The Betke-Henk-Wills conjecture proposes a sharp upper bound for the lattice point enumerator $G(K, \Lambda)$ of a convex body in terms of its successive minima. While the conjecture remains open for general convex bodies in dimensions $d…

General Mathematics · Mathematics 2026-02-12 Chao Wang

The VC-dimension of a family P of n-permutations is the largest integer k such that the set of restrictions of the permutations in P on some k-tuple of positions is the set of all k! permutation patterns. Let r_k(n) be the maximum size of a…

Combinatorics · Mathematics 2013-01-25 Josef Cibulka , Jan Kyncl

We show that whenever $s>k(k+1)$, then for any complex sequence $(\mathfrak a_n)_{n\in \mathbb Z}$, one has $$\int_{[0,1)^k}\left| \sum_{|n|\le N}\mathfrak a_ne(\alpha_1n+\ldots +\alpha_kn^k) \right|^{2s}\,{\rm d}{\mathbf \alpha}\ll…

Classical Analysis and ODEs · Mathematics 2024-07-01 Trevor D. Wooley

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

Metric Geometry · Mathematics 2022-07-12 Han Huang , Boaz A. Slomka , Tomasz Tkocz , Beatrice-Helen Vritsiou

Let $P$ be a set of $n$ points in the plane, and let $\mathcal C$ be a collection of $n$ simple $k$-intersecting curves, meaning that every two distinct curves of $\mathcal C$ meet in at most $k$ points. A classical theorem of Pach and…

Combinatorics · Mathematics 2026-05-21 Andrew Suk , Su Zhou

We prove several exact quantitative versions of Helly's and Tverberg's theorems, which guarantee that a finite family of convex sets in $R^d$ has a large intersection. Our results characterize conditions that are sufficient for the…

Combinatorics · Mathematics 2020-05-05 Sherry Sarkar , Alexander Xue , Pablo Soberón

We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…

Combinatorics · Mathematics 2020-07-21 Oswin Aichholzer , Jesús García , David Orden , Pedro Ramos

Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…

Metric Geometry · Mathematics 2017-03-30 Marek Lassak

We obtain three Helly-type results. First, we establish a Quantitative Colorful Helly-type theorem with the optimal Helly number \(2d\) concerning the diameter of the intersection of a family of convex bodies. Second, we prove a…

Combinatorics · Mathematics 2024-09-24 G. Ivanov , M. Naszodi

We resolve a conjecture of Kalai relating approximation theory of convex bodies by simplicial polytopes to the face numbers and primitive Betti numbers of these polytopes and their toric varieties. The proof uses higher notions of…

Metric Geometry · Mathematics 2016-02-18 Karim Adiprasito , Eran Nevo , José Alejandro Samper

We show that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}, \mathcal{F} \neq \{\emptyset\}$, there exists an $i \in [n]$ which is contained in a $0.01$ fraction of the sets in $\mathcal{F}$. This is the first known constant…

Combinatorics · Mathematics 2022-11-29 Justin Gilmer