English
Related papers

Related papers: Uniform distribution and geometric incidence theor…

200 papers

We show that for any $1\leq p\leq\infty$, the family of random vectors uniformly distributed on hyperplane projections of the unit ball of $\ell_p^n$ verify the variance conjecture $$ \textrm{Var}\,|X|^2\leq C\max_{\xi\in…

Functional Analysis · Mathematics 2016-10-14 David Alonso-Gutiérrez , Jesús Bastero

The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane with no three on a line contains the vertices of a convex $n$-gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any…

Combinatorics · Mathematics 2022-10-11 Jineon Baek

Let $\mathbb{F}_q$ be an arbitrary finite field, and $\mathcal{E}$ be a set of points in $\mathbb{F}_q^d$. Let $\Delta(\mathcal{E})$ be the set of distances determined by pairs of points in $\mathcal{E}$. By using the Kloosterman sums,…

Combinatorics · Mathematics 2020-07-31 Thang Pham , Le Anh Vinh

In this note, we study a large class of four-dimensional R-symmetric theories, and we describe a new quantity, \tau_U, which is well-defined in these theories. Furthermore, we conjecture that this quantity is larger in the ultraviolet (UV)…

High Energy Physics - Theory · Physics 2013-05-30 Matthew Buican

The unit distance graph $G_{\mathbb{R}^d}^1$ is the infinite graph whose nodes are points in $\mathbb{R}^d$, with an edge between two points if the Euclidean distance between these points is 1. The 2-dimensional version $G_{\mathbb{R}^2}^1$…

Combinatorics · Mathematics 2022-02-14 Remie Janssen , Leonie van Steijn

The concept of $n$-distance was recently introduced to generalize the classical definition of distance to functions of $n$ arguments. In this paper we investigate this concept through a number of examples based on certain geometrical…

Metric Geometry · Mathematics 2023-02-22 Gergely Kiss , Jean-Luc Marichal

Let $P = A\times A \subset \mathbb{F}_p \times \mathbb{F}_p$, $p$ a prime. Assume that $P= A\times A$ has $n$ elements, $n<p$. See $P$ as a set of points in the plane over $\mathbb{F}_p$. We show that the pairs of points in $P$ determine…

Combinatorics · Mathematics 2014-01-14 Harald Andres Helfgott , Misha Rudnev

We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the…

Combinatorics · Mathematics 2025-10-01 Doowon Koh , Ben Lund , Chuandong Xu , Semin Yoo

It is shown that $n$ points and $e$ lines in the complex Euclidean plane ${\mathbb C}^2$ determine $O(n^{2/3}e^{2/3}+n+e)$ point-line incidences. This bound is the best possible, and it generalizes the celebrated theorem by Szemer\'edi and…

Combinatorics · Mathematics 2015-07-10 Csaba D. Toth

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is…

Computational Geometry · Computer Science 2013-03-25 Gabriel Nivasch , János Pach , Rom Pinchasi , Shira Zerbib

A famous conjecture of Erd\H{o}s asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{n}{k}-\binom{n-s}{k},\binom{sk+k-1}{k}\}$. This problem…

Combinatorics · Mathematics 2026-02-24 Peter Frankl , Hongliang Lu , Jie Ma , Yuze Wu

We study incidence problems involving points and curves in $R^3$. The current (and in fact only viable) approach to such problems, pioneered by Guth and Katz, requires a variety of tools from algebraic geometry, most notably (i) the…

Combinatorics · Mathematics 2020-07-09 Micha Sharir , Noam Solomon

We consider singularly perturbed convection-diffusion equations on one-dimensional networks (metric graphs) as well as the transport problems arising in the vanishing diffusion limit. Suitable coupling condition at inner vertices are…

Analysis of PDEs · Mathematics 2020-04-22 Herbert Egger , Nora Philippi

We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…

Combinatorics · Mathematics 2025-10-31 Dominique Maldague , Hong Wang , Dmitrii Zakharov

We develop a new approach to approximate families of sets, complementing the existing `$\Delta$-system method' and `junta approximations method'. The approach, which we refer to as `spread approximations method', is based on the notion of…

Combinatorics · Mathematics 2024-04-03 Andrey Kupavskii , Dmitriy Zakharov

Let $p_1,p_2,p_3$ be three distinct points in the plane, and, for $i=1,2,3$, let $\mathcal C_i$ be a family of $n$ unit circles that pass through $p_i$. We address a conjecture made by Sz\'ekely, and show that the number of points incident…

Metric Geometry · Mathematics 2016-07-14 Orit E. Raz , Micha Sharir , József Solymosi

Let $V$ be an $r$-dimensional $\mathbb{F}_{q^n}$-vector space. We call an $\mathbb{F}_q$-subspace $U$ of $V$ $h$-scattered if $U$ meets the $h$-dimensional $\mathbb{F}_{q^n}$-subspaces of $V$ in $\mathbb{F}_q$-subspaces of dimension at most…

Combinatorics · Mathematics 2025-01-27 Bence Csajbók , Giuseppe Marino , Olga Polverino , Ferdinando Zullo

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

Probability · Mathematics 2021-03-18 Arup Bose , Koushik Saha , Arusharka Sen , Priyanka Sen

We study incidences between points and algebraic curves in three dimensions, taken from a family $C$ of curves that have almost two degrees of freedom, meaning that every pair of curves intersect in $O(1)$ points, for any pair of points…

Computational Geometry · Computer Science 2020-06-24 Micha Sharir , Noam Solomon , Oleg Zlydenko

We prove that every set of $n$ points in $\mathbb{R}^3$ spans $O(n^{295/197+\epsilon})$ unit distances. This is an improvement over the previous bound of $O(n^{3/2})$. A key ingredient in the proof is a new result for cutting circles in…

Metric Geometry · Mathematics 2022-03-02 Joshua Zahl