English
Related papers

Related papers: Additive structures imply more distances in $\math…

200 papers

An additive quaternary $[n,k,d]$-code (length $n,$ quaternary dimension $k,$ minimum distance $d$) is a $2k$-dimensional F_2-vector space of $n$-tuples with entries in $Z_2\times Z_2$ (the $2$-dimensional vector space over F_2) with minimum…

Combinatorics · Mathematics 2020-07-13 Juergen Bierbrauer , Stefano Marcugini , Fernanda Pambianco

We prove new results on additive properties of finite sets $A$ with small multiplicative doubling $|AA|\leq M|A|$ in the category of real/complex sets as well as multiplicative subgroups in the prime residue field. The improvements are…

Combinatorics · Mathematics 2017-12-04 Brendan Murphy , Misha Rudnev , Ilya D. Shkredov , Yurii N. Shteinikov

We study $N$-point rational distance sets ($\textrm{RDS}(N)$) on the parabola $y=x^2$. Previous approaches to the problem include efforts made using elliptic curves and diophantine chains, with successful analysis for $N\leq 4$. We extend…

Number Theory · Mathematics 2022-12-09 Sayak Bhattacharjee , Divyam Jain

The extended persistence diagram is an invariant of piecewise linear functions, which is known to be stable under perturbations of functions with respect to the bottleneck distance as introduced by Cohen-Steiner, Edelsbrunner, and Harer. We…

Algebraic Topology · Mathematics 2024-07-08 Ulrich Bauer , Magnus Bakke Botnan , Benedikt Fluhr

In \cite{FKW} Katznelson and Weiss establish that all sufficiently large distances can always be attained between pairs of points from any given measurable subset of $\mathbb{R}^2$ of positive upper (Banach) density. A second proof of this…

Number Theory · Mathematics 2019-02-07 Neil Lyall , Akos Magyar

An old question posed by Erd\H{o}s asked whether there exists a set of $n$ points such that $c \cdot n$ distances occur more than $n$ times. We provide an affirmative answer to this question, showing that there exists a set of $n$ points…

Combinatorics · Mathematics 2024-07-08 Krishnendu Bhowmick

It is shown that $N$ points on a real algebraic curve of degree $n$ in $\mathbb{R}^d$ always determine $\gtrsim_{n,d}N^{1+\frac{1}{4}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the…

Metric Geometry · Mathematics 2014-04-08 Marcos Charalambides

Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…

Combinatorics · Mathematics 2021-03-16 Boris Bukh , Ting-Wei Chao , Ron Holzman

Let $\cal M$ denote the set ${\cal S}_{n, q}$ of $n \times n$ symmetric matrices with entries in ${\rm GF}(q)$ or the set ${\cal H}_{n, q^2}$ of $n \times n$ Hermitian matrices whose elements are in ${\rm GF}(q^2)$. Then $\cal M$ equipped…

Combinatorics · Mathematics 2020-11-16 Antonio Cossidente , Giuseppe Marino , Francesco Pavese

We obtain new bounds for (a variant of) the Furstenberg set problem for high dimensional flats over $\mathbb{R}^n$. In particular, let $F\subset \mathbb{R}^n$, $1\leq k \leq n-1$, $s\in (0,k]$, and $t\in (0,k(n-k)]$. We say that $F$ is a…

Classical Analysis and ODEs · Mathematics 2025-03-14 Paige Bright , Manik Dhar

Let $1 \leq k \leq d$ and consider a subset $E\subset \mathbb{R}^d$. In this paper, we study the problem of how large the Hausdorff dimension of $E$ must be in order for the set of distinct noncongruent $k$-simplices in $E$ (that is,…

Classical Analysis and ODEs · Mathematics 2019-10-22 Jonathan DeWitt , Kevin Ford , Eli Goldstein , Steven J. Miller , Gwyneth Moreland , Eyvindur A. Palsson , Steven Senger

Finding the point in an algebraic variety that is closest to a given point is an optimization problem with many applications. We study the case when the variety is a Fermat hypersurface. Our formula for its Euclidean distance degree is a…

Algebraic Geometry · Mathematics 2015-10-22 Hwangrae Lee

We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set P of n points determines o(n) distinct distances, then no line contains \Omega(n^{7/8}) points of P and no…

Combinatorics · Mathematics 2013-08-27 Adam Sheffer , Joshua Zahl , Frank de Zeeuw

We study a finite-field analogue of the Erd\H{o}s distinct distances problem under the Hamming metric. For a set \(S\subseteq \mathbb{F}_q^n\) let $\Delta(S)$ denote the set of Hamming distances determined by \(S\). We prove the lower bound…

Combinatorics · Mathematics 2025-10-14 Nataly Brukhim , Ariel Bruner , Orit E. Raz

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

Number Theory · Mathematics 2025-08-26 Rachel Greenfeld , Marina Iliopoulou , Sarah Peluse

A rational distance set in the plane is a point set which has the property that all pairwise distances between its points are rational. Erd\H os and Ulam conjectured in 1945 that there is no dense rational distance set in the plane. In this…

Number Theory · Mathematics 2018-04-23 Jafar Shaffaf

In this paper we determine the maximum number of points in $\mathbb{R}^d$ which form exactly $t$ distinct triangles, where we restrict ourselves to the case of $t = 1$. We denote this quantity by $F_d(t)$. It was known from the work of…

The main goal of this paper is to provide an alternative proof of the following theorem of Petty: in the normed space of dimension at least three, every 3-element equilateral set can be extended to a 4-element equilateral set. Our approach…

Metric Geometry · Mathematics 2014-11-20 Tomasz Kobos

We study the Erd\H os-Falconer distance problem for a set $A\subset \mathbb{F}^2$, where $\mathbb{F}$ is a field of positive characteristic $p$. If $\mathbb{F}=\mathbb{F}_p$ and the cardinality $|A|$ exceeds $p^{5/4}$, we prove that $A$…

Combinatorics · Mathematics 2022-05-05 Brendan Murphy , Giorgis Petridis , Thang Pham , Misha Rudnev , Sophie Stevens

We prove a special case of Erd\H{o}s' unit distance problem using a corollary of the subspace theorem bounding the number of solutions of linear equations from a multiplicative group. We restrict our attention to unit distances coming from…

Combinatorics · Mathematics 2012-11-30 Ryan Schwartz
‹ Prev 1 4 5 6 7 8 10 Next ›