English
Related papers

Related papers: Sharp bounds for the Tao-Vu Discrete John's Theore…

200 papers

We give new proofs of the description convex hulls of space curves $\gamma : [a,b] \mapsto \mathbb{R}^{d}$ having totally positive torsion. These are curves such that all the leading principal minors of $d\times d$ matrix $(\gamma',…

Probability · Mathematics 2023-01-05 Jaume de Dios Pont , Paata Ivanisvili , José Madrid

We show that for every $\varepsilon>0$ there is an absolute constant $c(\varepsilon)>0$ such that the following is true. The union of any $n$ arithmetic progressions, each of length $n$, with pairwise distinct differences must consist of at…

Combinatorics · Mathematics 2017-05-15 Shoni Gilboa , Rom Pinchasi

Consider the group ${\mathbb{R}}^2$ with the discrete topology, and denote its Fourier algebra by $A({{\mathbb{R}}_{\rm d}^2})$. We reformulate a theorem of V.A. Yudin as a statement about restrictions of functions in $A({{\mathbb{R}}_{\rm…

Classical Analysis and ODEs · Mathematics 2014-07-14 John J. F. Fournier

The dominated convergence theorem implies that if (f_n) is a sequence of functions on a probability space taking values in the interval [0,1], and (f_n) converges pointwise a.e., then the sequence of integrals converges to the integral of…

Functional Analysis · Mathematics 2014-01-03 Jeremy Avigad , Edward Dean , Jason Rute

We establish a sharp Adams-type inequality in higher-order function spaces with singular weights on $\mathbb{R}^n$. A sharp singular concentration-compactness principle, improving Lions' result, is also proved. The study distinguishes…

Analysis of PDEs · Mathematics 2026-01-13 Deepak Kumar Mahanta , Tuhina Mukherjee , Abhishek Sarkar

We show that for any degree $d$ hypersurface $Y \subset X$ in a possibly singular projective variety $X \subset \mathbf{P}^N$, the total Betti number of $Y$ is bounded by $3\text{deg}(X)\cdot d^n + C\cdot d^{n-1}$ for some explicit constant…

Algebraic Geometry · Mathematics 2026-01-29 Xuanyu Pan , Dingxin Zhang , Xiping Zhang

The simplex method for linear programming is known to be highly efficient in practice, and understanding its performance from a theoretical perspective is an active research topic. The framework of smoothed analysis, first introduced by…

Data Structures and Algorithms · Computer Science 2025-10-22 Sophie Huiberts , Yin Tat Lee , Xinzhi Zhang

The orthorecursive expansion of unity with respect to the system $\{x, x^2, x^3, \ldots\}$ in $L^2([0,1])$ produces a sequence of rational coefficients $(c_n)$ defined by an explicit recurrence. Kalmynin and Kosenko established the bounds…

Number Theory · Mathematics 2026-03-03 Benoit Cloitre

Let $T$ be a tree on $t$ vertices. We prove that for every positive integer $k$ and every graph $G$, either $G$ contains $k$ pairwise vertex-disjoint subgraphs each having a $T$ minor, or there exists a set $X$ of at most $t(k-1)$ vertices…

Combinatorics · Mathematics 2025-02-25 Vida Dujmović , Gwenaël Joret , Piotr Micek , Pat Morin

Boros and Furedi (for d=2) and Barany (for abritrary d) proved that there exists a positive real number c_d such that for every set P of n points in R^d in general position, there exists a point of R^d contained in at least c_d…

Combinatorics · Mathematics 2012-03-22 Daniel Kral , Lukas Mach , Jean-Sebastien Sereni

We study the total $\alpha$-powered length of the rooted edges in a random minimal directed spanning tree - first introduced in Bhatt and Roy (2004) - on a Poisson process with intensity $s \ge 1$ on the unit cube $[0,1]^d$ for $d \ge 3$.…

Probability · Mathematics 2022-12-06 Chinmoy Bhattacharjee

We show that the border subrank of a sufficiently general tensor in $(\mathbb{C}^n)^{\otimes d}$ is $\mathcal{O}(n^{1/(d-1)})$ for $n \to \infty$. Since this matches the growth rate $\Theta(n^{1/(d-1)})$ for the generic (non-border) subrank…

Algebraic Geometry · Mathematics 2025-04-14 Benjamin Biaggi , Chia-Yu Chang , Jan Draisma , Filip Rupniewski

We study density thresholds that force a measurable set $E\subseteq\mathbb{R}^d$ to contain all sufficiently large similar copies of every $n$-point configuration. We prove a lower bound of the form $1-O((\log n)/n)$, which matches the…

Classical Analysis and ODEs · Mathematics 2026-04-21 Vjekoslav Kovač , Adian Anibal Santos Sepčić

The regret bound of dynamic online learning algorithms is often expressed in terms of the variation in the function sequence ($V_T$) and/or the path-length of the minimizer sequence after $T$ rounds. For strongly convex and smooth…

Machine Learning · Computer Science 2020-08-17 Ting-Jui Chang , Shahin Shahrampour

In 2006, Marcus and Tardos proved that if $A^1,\dots,A^n$ are cyclic orders on some subsets of a set of $n$ symbols such that the common elements of any two distinct orders $A^i$ and $A^j$ appear in reversed cyclic order in $A^i$ and $A^j$,…

Combinatorics · Mathematics 2024-11-12 Barnabás Janzer , Oliver Janzer , Abhishek Methuku , Gábor Tardos

We provide a self contained proof of a result of Dudley [Dud64]} which shows that a bounded convex-body in $\Re^d$ can be $\varepsilon$-approximated, by the intersection of $O_d\bigl(\varepsilon^{-(d-1)/2} \bigr)$ halfspaces, where $O_d$…

Computational Geometry · Computer Science 2024-06-12 Sariel Har-Peled , Mitchell Jones

The number of spanning trees of a graph $G$, denoted $\tau(G)$, is a well studied graph parameter with numerous connections to other areas of mathematics. In a recent remarkable paper, answering a question of Sedl\'a\v{c}ek from 1969, Chan,…

Combinatorics · Mathematics 2025-08-26 Noga Alon , Matija Bucić , Lior Gishboliner

We prove that topological disks with positive curvature and strictly convex boundary of large length are close to round spherical caps of constant boundary curvature in the Gromov-Hausdorff sense. This proves stability for a theorem of F.…

Differential Geometry · Mathematics 2023-11-08 Hunter Stufflebeam

Given a subset S of R^n, let c(S,k) be the smallest number t such that whenever finitely many convex sets have exactly k common points in S, there exist at most t of these sets that already have exactly k common points in S. For S = Z^n,…

Combinatorics · Mathematics 2016-02-26 Gennadiy Averkov , Bernardo González Merino , Matthias Henze , Ingo Paschke , Stefan Weltge

In projective dimension growth results, one bounds the number of rational points of height at most $H$ on an irreducible hypersurface in $\mathbb P^n$ of degree $d>3$ by $C(n)d^2 H^{n-1}(\log H)^{M(n)}$, where the quadratic dependence in…

Number Theory · Mathematics 2024-09-16 Raf Cluckers , Itay Glazer