English
Related papers

Related papers: Distinct Directions and Distinct Distances in $\ma…

200 papers

Consider a set $X\subseteq \mathbb{R}^d$ which is 1-dense, namely, it intersects every unit ball. We show that we can get from any point to any other point in $\mathbb{R}^d$ in $n$ steps so that the intermediate points are in $X$, and the…

Combinatorics · Mathematics 2023-11-03 Endre Csóka

Let $p$ be an odd prime and $A \subseteq \mathbb{F}_p$ be a subset of the finite field with $p$ elements. We show that $A \times A \subseteq \mathbb{F}_p^2$ determines at least a constant multiple of $\min\{p, |A|^{3/2}\}$ distinct pinned…

Combinatorics · Mathematics 2018-11-08 Giorgis Petridis

We prove that in all dimensions n at least 3, for every integer N there exists a distribution of points of cardinality $ N$, for which the associated discrepancy function D_N satisfies the estimate an estimate, of sharp growth rate in N, in…

Number Theory · Mathematics 2013-06-10 Gagik Amirkhanyan , Dmitriy Bilyk , Michael T Lacey

The well-known three distance theorem states that there are at most three distinct gaps between consecutive elements in the set of the first n multiples of any real number. We generalise this theorem to higher dimensions under a suitable…

Combinatorics · Mathematics 2007-05-23 Sujith Vijay

In every dimension $d\ge1$, we establish the existence of a constant $v_d>0$ and of a subset $\mathcal U_d$ of $\mathbb R^d$ such that the following holds: $\mathcal C+\mathcal U_d=\mathbb R^d$ for every convex set $\mathcal C\subset…

Number Theory · Mathematics 2014-02-26 Roland Bacher

We establish the sharp estimate <<_d N^{2/d} for the number of rational points of height at most N on an irreducible projective curve of degree d. We deduce this from a result for general hypersurfaces that is sensitive to the coefficients…

Number Theory · Mathematics 2013-09-05 Miguel N. Walsh

Fix an integer $r\geq 3$. We consider metric spaces on $n$ points such that the distance between any two points lies in $\{1,..., r\}$. Our main result describes their approximate structure for large $n$. As a consequence, we show that the…

Combinatorics · Mathematics 2015-02-10 Dhruv Mubayi , Caroline Terry

There are several notions of duality between lines and points. In this note, it is shown that all these can be studied in a unified way. Most interesting properties are independent of specific choices. It is also shown that either dual…

Computational Geometry · Computer Science 2025-08-22 Sanjeev Saxena

We show the existence of a constant $c > 0$ such that, for all positive integers $n$, there exist integers $1 \leq a_1 < \ldots < a_k \leq n$ such that there are at least $cn^2$ distinct integers of the form $\sum_{i=u}^{v}a_i$ with $1 \leq…

Combinatorics · Mathematics 2023-11-17 Adrian Beker

Let $\left\{a_1, \dots, a_n\right\} \subset \mathbb{N}$ be a set of positive integers, $a_n$ denoting the largest element, so that for any two of the $2^n$ subsets the sum of all elements is distinct. Erd\H{o}s asked whether this implies…

Number Theory · Mathematics 2023-01-03 Stefan Steinerberger

In Micchelli's paper "Interpolation of scattered data: distance matrices and conditionally positive functions", deep results were obtained concerning the invertibility of matrices arising from radial basis function interpolation. In…

Numerical Analysis · Mathematics 2010-06-15 Brad Baxter

It is widely believed that point sets in the plane which determine few distinct distances must have some special structure. In particular, such sets are believed to be similar to a lattice. This note considers two different ways to quantify…

Metric Geometry · Mathematics 2016-11-17 Oliver Roche-Newton

Given a rational $a=p/q$ and $N$ nonnegative $d$-dimensional real vectors $u_1$, ..., $u_N$, we show that it is always possible to choose $(d-1)+\lceil (pN-d+1)/q\rceil$ of them such that their sum is (componentwise) at least…

Combinatorics · Mathematics 2013-05-06 Ilya I. Bogdanov , Grigory R. Chelnokov

We survey the variants of Erd\H{o}s' distinct distances problem and the current best bounds for each of those.

Combinatorics · Mathematics 2018-07-03 Adam Sheffer

Given $E \subset \mathbb{R}^d$, $d \ge 2$, define ${\mathcal D}(E) \equiv {(x-y)/|x-y|: x,y \in E} \subset S^{d-1},$ the set of directions determined by $E$. We prove that if the Hausdorff dimension of $E$ is greater than $d-1$, then…

Classical Analysis and ODEs · Mathematics 2011-04-04 Alex Iosevich , Mihalis Mourgoglou , Steven Senger

We prove that the the discrepancy of arithmetic progressions in the $d$-dimensional grid $\{1, \dots, N\}^d$ is within a constant factor depending only on $d$ of $N^{\frac{d}{2d+2}}$. This extends the case $d=1$, which is a celebrated…

Combinatorics · Mathematics 2021-11-01 Jacob Fox , Max Wenqiang Xu , Yunkun Zhou

We give a shorter proof of a slightly weaker version of a theorem of Nets Katz and the author. We prove that if a set of $L$ lines in $\mathbb{R}^3$ contains at most $L^{1/2}$ lines in any low degree algebraic surface, then the number of…

Combinatorics · Mathematics 2014-11-12 Larry Guth

We establish the large deviation principle for solutions of one-dimensional SDEs with discontinuous coefficients. The main statement is formulated in a form similar to the classical Wentzel--Freidlin theorem, but under the considerably…

Probability · Mathematics 2016-07-14 Alexei Kulik , Daryna Sobolieva

We improve the current best bound for distinct distances on non-ruled algebraic surfaces in ${\mathbb R}^3$. In particular, we show that $n$ points on such a surface span $\Omega\left(n^{32/39-\varepsilon}\right)$ distinct distances, for…

Combinatorics · Mathematics 2021-12-30 Surya Mathialagan , Adam Sheffer

We prove a general theorem to bound the total variation distance between the distribution of an integer valued random variable of interest and an appropriate discretized normal distribution. We apply the theorem to 2-runs in a sequence of…

Probability · Mathematics 2014-07-07 Xiao Fang
‹ Prev 1 4 5 6 7 8 10 Next ›