English
Related papers

Related papers: Incidence bounds related to circular Furstenberg s…

200 papers

We consider a problem of maximizing the product of the sizes of two uniform cross-$t$-intersecting families of sets. We show that the value of this maximum is at most polynomially larger (in the size of a ground set) than a quantity…

Combinatorics · Mathematics 2021-02-23 Georgii P. Bulgakov , Alexander Kozachinskiy , Mikhail N. Vyalyi

We prove that if $P,\mathcal{L}$ are finite sets of $\delta$-separated points and lines in $\mathbb{R}^{2}$, the number of $\delta$-incidences between $P$ and $\mathcal{L}$ is no larger than a constant times $$|P|^{2/3}|\mathcal{L}|^{2/3}…

Classical Analysis and ODEs · Mathematics 2020-03-16 Katrin Fässler , Tuomas Orponen , Andrea Pinamonti

We study the family of vertical projections whose fibers are right cosets of horizontal planes in the Heisenberg group, $\mathbb{H}^n$. We prove lower bounds for Hausdorff dimension distortion of sets under these mappings, with respect to…

Metric Geometry · Mathematics 2022-10-11 Terence L. J. Harris , Chi N. Y. Huynh , Fernando Roman-Garcia

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 study the number and distribution of the limit cycles of a planar vector field whose component functions are random polynomials. We prove a lower bound on the average number of limit cycles when the random polynomials are sampled from…

Dynamical Systems · Mathematics 2023-06-12 Erik Lundberg

We prove a new, tight upper bound on the number of incidences between points and hyperplanes in Euclidean d-space. Given n points, of which k are colored red, there are O_d(m^{2/3}k^{2/3}n^{(d-2)/3} + kn^{d-2} + m) incidences between the k…

Combinatorics · Mathematics 2012-01-10 Ben D. Lund , George B. Purdy , Justin W. Smith

In this paper we derive new upper bounds for the densities of measurable sets in R^n which avoid a finite set of prescribed distances. The new bounds come from the solution of a linear programming problem. We apply this method to obtain new…

Combinatorics · Mathematics 2010-09-17 Fernando Mario de Oliveira Filho , Frank Vallentin

In this paper, we give bounds on the variance of the number of points of the circular and the Gaussian $\beta$ ensemble in arcs of the unit circle or intervals of the real line. These bounds are logarithmic with respect to the renormalized…

Probability · Mathematics 2023-04-26 Joseph Najnudel , Bálint Virág

In this paper we propose tight upper and lower bounds for the Wasserstein distance between any two {{univariate continuous distributions}} with probability densities $p_1$ and $p_2$ having nested supports. These explicit bounds are…

Probability · Mathematics 2015-10-21 Christophe Ley , Gesine Reinert , Yvik Swan

We consider the $L^p$ mapping properties of maximal averages associated to families of curves, and thickened curves, in the plane. These include the (planar) Kakeya maximal function, the circular maximal functions of Wolff and Bourgain, and…

Classical Analysis and ODEs · Mathematics 2025-10-09 Joshua Zahl

We give lower bounds for the Hausdorff dimensions of some model Furstenberg sets.

Classical Analysis and ODEs · Mathematics 2012-05-15 Daniel M. Oberlin

We give a fairly elementary and simple proof that shows that the number of incidences between $m$ points and $n$ lines in ${\mathbb R}^3$, so that no plane contains more than $s$ lines, is $$ O\left(m^{1/2}n^{3/4}+ m^{2/3}n^{1/3}s^{1/3} + m…

Combinatorics · Mathematics 2015-01-13 Micha Sharir , Noam Solomon

The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.

Number Theory · Mathematics 2024-01-09 Roberto Conti , Pierluigi Contucci , Vitalii Iudelevich

We prove several incidence theorems in vector spaces over finite fields using bounds for various classes of exponential sums and apply these to Erdos-Falconer type distance problems.

Number Theory · Mathematics 2007-05-23 Alex Iosevich , Doowon Koh

We prove new upper bounds on homotopy and homology groups of o-minimal sets in terms of their approximations by compact o-minimal sets. In particular, we improve the known upper bounds on Betti numbers of semialgebraic sets defined by…

Algebraic Geometry · Mathematics 2014-02-26 Andrei Gabrielov , Nicolai Vorobjov

For $0 \leq s \leq 1$ and $0 \leq t \leq 3$, a set $F \subset \mathbb{R}^{2}$ is called a circular $(s,t)$-Furstenberg set if there exists a family of circles $\mathcal{S}$ of Hausdorff dimension $\dim_{\mathrm{H}} \mathcal{S} \geq t$ such…

Classical Analysis and ODEs · Mathematics 2024-12-20 Katrin Fässler , Jiayin Liu , Tuomas Orponen

In this paper, as a continuation of [30], we consider the Gromov-Hausdorff convergence and collapsing in the family of compact Riemannian manifolds with boundary satisfying lower bounds on the sectional curvatures of interior manifolds,…

Differential Geometry · Mathematics 2025-04-09 Takao Yamaguchi , Zhilang Zhang

In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.

Combinatorics · Mathematics 2024-09-28 Gábor Hegedüs

The celebrated Szemer\'edi--Trotter theorem states that the maximum number of incidences between $n$ points and $n$ lines in the plane is $O(n^{4/3})$, which is asymptotically tight. Solymosi (2005) conjectured that for any set of points…

Combinatorics · Mathematics 2025-09-29 Martin Balko , Nóra Frankl

We study a family of variants of Erd\H os' unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, we look for…

Combinatorics · Mathematics 2020-12-01 Slade Gunter , Eyvi Palsson , Ben Rhodes , Steven Senger