English
Related papers

Related papers: On Few-Distance Sets in the Plane

200 papers

In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…

Number Theory · Mathematics 2022-01-25 Shivarajkumar

We show that the distance in total variation between $(\mathrm{Tr}\ U, \frac{1}{\sqrt{2}}\mathrm{Tr}\ U^2, \cdots, \frac{1}{\sqrt{m}}\mathrm{Tr}\ U^m)$ and a real Gaussian vector, where $U$ is a Haar distributed orthogonal or symplectic…

Probability · Mathematics 2021-03-08 Klara Courteaut , Kurt Johansson

We study the Diophantine equation $a^k + b^k = c^k + d^k$ with integer variables and exponent $k>1$, under the linear constraint $(c+d) - (a+b) = h$. We analyze the geometry and arithmetic of these linear slices. On the central slice $h=0$,…

Number Theory · Mathematics 2025-12-09 Valery Asiryan

Let $F $ be a totally real number field and $r=[F :\mathbb{Q}].$ Let $A_k(\mathfrak{N},\omega) $ be the space of holomorphic Hilbert cusp forms with respect to $K_1(\mathfrak{N})$, weight $k=(k_1,\,...\,,k_r)$ with $k_j>2,$ for all $j$ and…

Number Theory · Mathematics 2024-05-28 Baskar Balasubramanyam , Jishu Das , Kaneenika Sinha

The isotropic constant $L_K$ is an affine-invariant measure of the spread of a convex body $K$. For a $d$-dimensional convex body $K$, $L_K$ can be defined by $L_K^{2d} = \det(A(K))/(\mathrm{vol}(K))^2$, where $A(K)$ is the covariance…

Functional Analysis · Mathematics 2015-12-09 Luis Rademacher

Let $G=(V,E)$ be an undirected unweighted planar graph. Consider a vector storing the distances from an arbitrary vertex $v$ to all vertices $S = \{ s_1 , s_2 , \ldots , s_k \}$ of a single face in their cyclic order. The pattern of $v$ is…

Data Structures and Algorithms · Computer Science 2022-02-11 Shay Mozes , Nathan Wallheimer , Oren Weimann

We show that for any large $n$, there exists a set of $n$ points in the plane with $O(n^2/\sqrt{\log n})$ distinct distances, such that any four points in the set determine at least five distinct distances. This answers (in the negative) a…

Combinatorics · Mathematics 2024-09-04 Terence Tao

The Gaussian-smoothed optimal transport (GOT) framework, recently proposed by Goldfeld et al., scales to high dimensions in estimation and provides an alternative to entropy regularization. This paper provides convergence guarantees for…

Machine Learning · Computer Science 2021-03-02 Yixing Zhang , Xiuyuan Cheng , Galen Reeves

The distances between flats of a Poisson $k$-flat process in the $d$-dimensional Euclidean space with $k<d/2$ are discussed. Continuing an approach originally due to Rolf Schneider, the number of pairs of flats having distance less than a…

Probability · Mathematics 2014-07-08 Matthias Schulte , Christoph Thaele

We prove a generalization for some $\mathbb C$ domains of Gehring - Palka theorem on Moebius transformations regarding the distance ratio metric. Namely, we show that this theorem is valid for arbitrary holomorphic mappings $f : H \to H$ or…

Complex Variables · Mathematics 2014-02-03 Slavko Simic

The Falconer conjecture asserts that if E is a planar set with Hausdorff dimension strictly greater than 1, then its Euclidean distance set has positive one-dimensional Lebesgue measure. We discuss the analogous question with the Euclidean…

Metric Geometry · Mathematics 2007-05-23 Sergei Konyagin , Izabella Laba

Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the…

Analysis of PDEs · Mathematics 2011-07-07 Alessio Figalli , Young-Heon Kim , Robert J. McCann

A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let {\delta}(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational…

Computational Geometry · Computer Science 2017-04-07 Nathan Chadder , Antoine Deza

According to Suk's breakthrough result on the Erdos-Szekeres problem, any point set in general position in the plane, which has no $n$ elements that form the vertex set of a convex $n$-gon, has at most $2^{n+O\left({n^{2/3}\log n}\right)}$…

Combinatorics · Mathematics 2020-08-04 Andreas F. Holmsen , Hossein Nassajian Mojarrad , János Pach , Gábor Tardos

We are interested in maximizing the number of pairwise unrelated copies of a poset $P$ in the family of all subsets of $[n]$. We prove that for any $P$ the maximum number of unrelated copies of $P$ is asymptotic to a constant times the…

Combinatorics · Mathematics 2013-09-27 Andrew P. Dove , Jerrold R. Griggs

For a connected graph $G$ with order $n$ and an integer $k\geq 1$, we denote by $$S_k(D(G))=\lambda_1(D(G))+\cdots+\lambda_k(D(G))$$ the sum of $k$ largest distance eigenvalues of $G$. In this paper, we consider the sharp upper bound and…

Combinatorics · Mathematics 2018-05-25 Huiqiu Lin

In this note, we show that in planar pointsets determining many unit distances, these unit distances must span many directions. Specifically, we show that a set of $n$ points can determine only $o(n^{4/3})$ unit distances from a set of at…

Combinatorics · Mathematics 2025-04-08 Gabriel Currier , József Solymosi

In a recent paper, C. Gambicchia and A. Pratelli proved a quantitative isoperimetric inequality involving the isoperimetric deficit $\delta(K)$ and the barycentric distance $\lambda_0(K)$ for sets $K\subset \mathbb{R}^N$ with given diameter…

Optimization and Control · Mathematics 2025-11-20 Gisella Croce , Antoine Henrot

Given a set $P$ of $n$ points in the plane and a multiset $W$ of $k$ weights with $k\leq n$, we assign each weight in $W$ to a distinct point in $P$ to minimize the maximum weighted distance from the weighted center of $P$ to any point in…

Computational Geometry · Computer Science 2018-04-03 Eunjin Oh , Hee-Kap Ahn

Let $\Omega\subset\mathbb{R}^n$, $n\ge 2$, be a bounded connected $C^2$ domain. For any unit vector $\nu\in\mathbb{R}^n$, let $T_{\lambda}^{\nu}=\{x\in\mathbb{R}^n:x\cdot\nu=\lambda\}$,…

Analysis of PDEs · Mathematics 2024-09-18 Shu-Yu Hsu