English
Related papers

Related papers: Improved bounds on the Hadwiger-Debrunner numbers

200 papers

We show quantitative versions of classic results in discrete geometry, where the size of a convex set is determined by some non-negative function. We give versions of this kind for the selection theorem of B\'ar\'any, the existence of weak…

Metric Geometry · Mathematics 2015-10-27 David Rolnick , Pablo Soberón

The classical Steinitz theorem states that if the origin belongs to the interior of the convex hull of a set $S \subset \mathbb{R}^d$, then there are at most $2d$ points of $S$ whose convex hull contains the origin in the interior.…

Metric Geometry · Mathematics 2024-03-06 Grigory Ivanov , Márton Naszódi

Given $0\leq\alpha<1$, we define \[\begin{array}{lr} \mathbf{M}_\alpha f(u,v,t) = \sup_{ \mathbf{R} \ni (0,0,0)} {\rm vol} \{\mathbf{R}\}^{\alpha-1} \iiint_\mathbf{R}\left|f [(u,v,t)\odot(\xi,\eta,\tau)^{-1}]\right|d\xi d\eta d\tau…

Classical Analysis and ODEs · Mathematics 2026-05-19 Chuhan Sun , Zipeng Wang

The present paper studies a quantitative version of the transversality theorem. More precisely, given a continuous function $f\in \mathcal{C}([0,1]^d,\mathbb{R}^m)$ and a manifold $W\subset \mathbb{R}^m$ of dimension $p$, a sharpness result…

Functional Analysis · Mathematics 2023-01-03 Andrew Murdza , Khai T. Nguyen

Alon and Krivelevich proved that for every $n$-vertex subcubic graph $H$ and every integer $q \ge 2$ there exists a (smallest) integer $f=f(H,q)$ such that every $K_f$-minor contains a subdivision of $H$ in which the length of every…

Combinatorics · Mathematics 2021-11-11 Shagnik Das , Nemanja Draganić , Raphael Steiner

We give a quantitative characterization of the pairs of weights $(w,v)$ for which the dyadic version of the one-sided Hardy-Littlewood maximal operator satisfies a restricted weak $(p,p)$ type inequality, for $1\leq p<\infty$. More…

Classical Analysis and ODEs · Mathematics 2021-05-25 Fabio Berra

Let $p$ be prime. We prove that, for $n$ odd, the $p$-torsion part of $\pi_q(S^{n})$ has cardinality at most $p^{2^{\frac{1}{p-1}(q-n+3-2p)}}$, and hence has rank at most $2^{\frac{1}{p-1}(q-n+3-2p)}$. For $p=2$ these results also hold for…

Algebraic Topology · Mathematics 2021-01-13 Guy Boyde

We prove that for $d\ge 2,\, k\ge 2$, if the Hausdorff dimension of a compact set $E\subset \mathbb{R}^d$ is greater than $\frac{d^2}{2d-1}$, then, for any given $r > 0$, there exist $(x^1, \dots, x^{k+1})\in E^{k+1}$, $(y^1, \dots,…

Classical Analysis and ODEs · Mathematics 2024-05-07 P. Bhowmik , A. Greenleaf , A. Iosevich , S. Mkrtchyan , F. Rakhmonov

Let $w=(w_1,\dots,w_d)$ be a $d$-tuple of positive real numbers such that $\sum_{i}w_i =1$ and $w_1\geq \cdots \geq w_d$. A $d$-dimensional vector $x=(x_1,\dots,x_d)\in\mathbb{R}^d$ is said to be $w$-singular if for every $\epsilon>0$ there…

Number Theory · Mathematics 2024-04-10 Taehyeong Kim , Jaemin Park

Every symplectic spread of PG(3,q), or equivalently every ovoid of Q(4,q), is shown to give rise to a certain family of permutation polynomials of GF(q) and conversely. This leads to an algebraic proof of the existence of the Tits-Luneburg…

Combinatorics · Mathematics 2008-10-17 Simeon Ball , Michael E. Zieve

We show that the number of geometric permutations of an arbitrary collection of $n$ pairwise disjoint convex sets in $\mathbb{R}^d$, for $d\geq 3$, is $O(n^{2d-3}\log n)$, improving Wenger's 20 years old bound of $O(n^{2d-2})$.

Computational Geometry · Computer Science 2010-07-20 Natan Rubin , Haim Kaplan , Micha Sharir

Suppose $d+1$ absolutely continuous probability measures $m_0, \ldots, m_d$ on $\mathbb{R}^d$ are given. In this paper, we prove that there exists a point of $\mathbb{R}^d$ that belongs to the convex hull of $d+1$ points $v_0, \ldots, v_d$…

Combinatorics · Mathematics 2020-06-03 Zilin Jiang

In 1974, Erd\H{o}s and Kleitman conjectured that if a family $\mathcal{F}\subseteq 2^{[n]}$ contains no matching of size \(s\) and is maximal with respect to this property, then $ |\mathcal{F}|\ge \left(1-2^{-(s-1)}\right)\cdot 2^{n}. $ For…

Combinatorics · Mathematics 2026-03-20 Gennian Ge , Jialuo Wang , Zixiang Xu

Given an integer $m\geq2$, the Hardy--Littlewood inequality (for real scalars) says that for all $2m\leq p\leq\infty$, there exists a constant $C_{m,p}% ^{\mathbb{R}}\geq1$ such that, for all continuous $m$--linear forms…

Functional Analysis · Mathematics 2015-10-06 Gustavo Araujo , Daniel Pellegrino

We prove that the Hausdorff dimension of the set $\mathbf{x}\in [0,1)^d$, such that $$ \left|\sum_{n=1}^N \exp\left(2 \pi i\left(x_1n+\ldots+x_d n^d\right)\right) \right|\ge c N^{1/2} $$ holds for infinitely many natural numbers $N$, is at…

Number Theory · Mathematics 2020-12-16 Changhao Chen , Bryce Kerr , Igor Shparlinski

For all $p>1$ and all centrally symmetric convex bodies $K\subset \mathbb{R}^d$ define $Mf$ as the centered maximal function associated to $K$. We show that when $d=1$ or $d=2$, we have $||Mf||_p\ge (1+\epsilon(p,K))||f||_p$. For $d\ge 3$,…

Classical Analysis and ODEs · Mathematics 2019-08-23 Samuel Zbarsky

We relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its members. This result directly implies a known lower bound on…

Optimization and Control · Mathematics 2016-05-30 Gennadiy Averkov , Volker Kaibel , Stefan Weltge

Given two subsets $A, B \subseteq \mathbb{F}_p$ and a binary relation $\mathcal{R} \subseteq A \times B$, the restricted sumset of $A, B$ with respect to $\mathcal{R}$ is defined as $A +_{\mathcal{R}} B = \{ a+b \colon (a,b) \notin…

Combinatorics · Mathematics 2025-09-05 Minghui Ouyang

Analogous to the case of the binomial random graph $G(d+1,p)$, it is known that the behaviour of a random subgraph of a $d$-dimensional hypercube, where we include each edge independently with probability $p$, which we denote by $Q^d_p$,…

Combinatorics · Mathematics 2021-12-02 Joshua Erde , Mihyun Kang , Michael Krivelevich

Let $D$ be a digraph on $p\geq 5$ vertices with minimum degree at least $p-1$ and with minimum semi-degree at least $p/2-1$. For $D$ (unless some extremal cases) we present a detailed proof of the following results [12]: (i) $D$ contains…

Combinatorics · Mathematics 2011-11-09 S. Kh. Darbinyan
‹ Prev 1 3 4 5 6 7 10 Next ›