English
Related papers

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

200 papers

Given a Dirichlet series $L(s) = \sum a_n n^{-s}$, the asymptotic growth rate of $\sum_{n\le X} a_n$ can be determined by a Tauberian theorem. Bounds on the error term are typically controlled by the size of $|L(\sigma+it)|$ for fixed real…

Number Theory · Mathematics 2025-08-29 Brandon Alberts

We estimate the growth rate of the function which counts the number of torsion points of order at most $T$ on an algebraic subvariety of the algebraic torus $\mathbb G_m^n$ over some algebraically closed field. We prove a general upper…

Number Theory · Mathematics 2022-09-26 Gerold Schefer

This paper is concerned with Darcy's law for an incompressible viscous fluid flowing in a porous medium. We establish the sharp $O(\sqrt{\e})$ convergence rate in a periodically perforated and bounded domain in $R^d$ for $d\ge 2$, where…

Analysis of PDEs · Mathematics 2022-01-28 Zhongwei Shen

According to a classical result of Gr\"unbaum, the transversal number $\tau(\F)$ of any family $\F$ of pairwise-intersecting translates or homothets of a convex body $C$ in $\RR^d$ is bounded by a function of $d$. Denote by $\alpha(C)$…

Computational Geometry · Computer Science 2009-10-23 Adrian Dumitrescu , Minghui Jiang

We study how eigenvectors of random regular graphs behave when projected onto fixed directions. For a random $d$-regular graph with $N$ vertices, where the degree $d$ grows slowly with $N$, we prove that these projections follow…

Probability · Mathematics 2025-07-22 Leonhard Nagel

We prove that there is a constant $C\leq 6.614$ such that every Boolean function of degree at most $d$ (as a polynomial over $\mathbb{R}$) is a $C\cdot 2^d$-junta, i.e. it depends on at most $C\cdot 2^d$ variables. This improves the $d\cdot…

Combinatorics · Mathematics 2018-11-20 John Chiarelli , Pooya Hatami , Michael Saks

We prove that any $n$-node graph $G$ with diameter $D$ admits shortcuts with congestion $O(\delta D \log n)$ and dilation $O(\delta D)$, where $\delta$ is the maximum edge-density of any minor of $G$. Our proof is simple, elementary, and…

Data Structures and Algorithms · Computer Science 2020-08-10 Mohsen Ghaffari , Bernhard Haeupler

Let $\# K$ be a number of integer lattice points contained in a set $K$. In this paper we prove that for each $d\in {\mathbb N}$ there exists a constant $C(d)$ depending on $d$ only, such that for any origin-symmetric convex body $K \subset…

Metric Geometry · Mathematics 2015-11-10 Matthew Alexander , Martin Henk , Artem Zvavitch

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

Let $E_1,\dots,E_n \subset \mathbb{R}^d$ be compact sets of positive diameter with Feng--Wu thickness at least $c>0$. Feng and Wu proved that $E_1+\cdots+E_n$ has non-empty interior when $n>2^{11}c^{-3}+1$. We show that \[n>\frac{\sqrt…

Metric Geometry · Mathematics 2026-04-07 Scott Duke Kominers

We prove the first Fixed-depth Size-hierarchy Theorem for uniform AC$^0[\oplus]$ circuits; in particular, for fixed $d$, the class $\mathcal{C}_{d,k}$ of uniform AC$^0[\oplus]$ formulas of depth $d$ and size $n^k$ form an infinite…

Computational Complexity · Computer Science 2019-02-21 Nutan Limaye , Karteek Sreenivasaiah , Srikanth Srinivasan , Utkarsh Tripathi , S. Venkitesh

In subdomains of $\mathbb{R}^{d}$ we consider uniformly elliptic equations $H\big(v( x),D v( x),D^{2}v( x), x\big)=0$ with the growth of $H$ with respect to $|Dv|$ controlled by the product of a function from $L_{d}$ times $|Dv|$. The…

Analysis of PDEs · Mathematics 2020-02-05 N. V. Krylov

We establish the general form of a geometric comparison principle for $n$-fold convolutions of certain singular measures in $\mathbb{R}^d$ which holds for arbitrary $n$ and $d$. This translates into a pointwise inequality between the…

Classical Analysis and ODEs · Mathematics 2020-08-19 Diogo Oliveira e Silva , René Quilodrán

Let $\chi$ be a real primitive character to the modulus $D$. It is proved that $$ L(1,\chi)\gg (\log D)^{-2022} $$ where the implied constant is absolute and effectively computable. In the proof, the lower bound for $L(1,\chi)$ is first…

Number Theory · Mathematics 2022-11-07 Yitang Zhang

Benjamini, Finucane and the first author have shown that if (G_n,S_n) is a sequence of Cayley graphs such that |S_n^n|=O(n^D|S_n|), then the sequence (G_n,d_{S_n}/n) is relatively compact for the Gromov-Hausdorff topology and every cluster…

Group Theory · Mathematics 2018-06-15 Romain Tessera , Matthew Tointon

We revisit the standard ``telescoping sum'' argument ubiquitous in the final steps of analyzing evaluation complexity of algorithms for smooth nonconvex optimization, and obtain a refined formulation of the resulting bound as a function of…

Optimization and Control · Mathematics 2024-08-20 Serge Gratton , Chee-Khian Sim , Philippe L. Toint

In this paper we study $N_d(k)$ the smallest positive integer such that any nice measure $\mu$ in $\R^d$ can be partitioned in $N_d(k)$ parts of equal measure so that every hyperplane avoids at least $k$ of them. A theorem of Yao and Yao…

Metric Geometry · Mathematics 2021-06-09 Edgardo Roldán-Pensado , Pablo Soberón

Building on a result by Tao, we show that a certain type of simple closed curve in the plane given by the union of the graphs of two $1$-Lipschitz functions inscribes a square whose sidelength is bounded from below by a universal constant…

Classical Analysis and ODEs · Mathematics 2021-06-15 Ludovic Rifford

The Wiener index of a strong digraph $D$ is defined as the sum of the distances between all ordered pairs of vertices. This definition has been extended to digraphs that are not necessarily strong by defining the distance from a vertex $a$…

Combinatorics · Mathematics 2022-09-20 Peter Dankelmann

We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A$ is a subset of $\{1, 2, \dots, n\}$ of size at least $C n^{1/k}$, then, for some $d \leq k-1$, the set of subset sums of $A$ contains a…

Combinatorics · Mathematics 2023-11-03 David Conlon , Jacob Fox , Huy Tuan Pham