English
Related papers

Related papers: A discretized point-hyperplane incidence bound in …

200 papers

Let $(P,E)$ be a $(d+1)$-uniform geometric hypergraph, where $P$ is an $n$-point set in general position in $\mathbb{R}^d$ and $E\subseteq {P\choose d+1}$ is a collection of $\epsilon{n\choose d+1}$ $d$-dimensional simplices with vertices…

Combinatorics · Mathematics 2024-03-04 Natan Rubin

Let $M$ be a compact hypersurface with boundary $\partial M=\partial D_1 \cup \partial D_2$, $\partial D_1 \subset \Pi _1$, $\partial D_2 \subset \Pi _2$, $\Pi_1$ and $\Pi _2$ two parallel hyperplanes in $\mathbb{R}^{n+1}$ ($n \geq 2$).…

Differential Geometry · Mathematics 2016-01-13 Monica Moulin Ribeiro Merkle

The Szemer\'edi-Trotter theorem gives a bound on the maximum number of incidences between points and lines on the Euclidean plane. In particular it says that $n$ lines and $n$ points determine $O(n^{4/3})$ incidences. Let us suppose that an…

Combinatorics · Mathematics 2007-05-23 Jozsef Solymosi

We present a new lower bound on the differential entropy rate of stationary processes whose sequences of probability density functions fulfill certain regularity conditions. This bound is obtained by showing that the gap between the…

Information Theory · Computer Science 2017-08-30 Meik Dörpinghaus

We prove that for a large class of functions $P$ and $Q$, there exists $d\in (0,1)$ such that the discrete bilinear Radon transform $$B^{\rm dis}_{P,Q}(f,g)(n)=\sum_{m\in\mathbb{Z}\setminus\{0\}} f(n-P(m))g(n-Q(m))\frac{1}{m}$$ is bounded…

Number Theory · Mathematics 2017-10-31 Dong Dong , Xianchang Meng

We derive a central limit theorem for the number of vertices of convex polytopes induced by stationary Poisson hyperplane processes in $\mathbb{R}^d$. This result generalizes an earlier one proved by Paroux [Adv. in Appl. Probab. 30 (1998)…

Probability · Mathematics 2007-05-23 Lothar Heinrich , Hendrik Schmidt , Volker Schmidt

In this paper, we prove the first incidence bound for points and conics over prime fields. As applications, we prove new results on expansion of bivariate polynomial images and on certain variations of distinct distances problems. These…

Combinatorics · Mathematics 2023-01-13 Ali Mohammadi , Thang Pham , Audie Warren

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

Combinatorics · Mathematics 2020-04-24 Aaron Lin , Konrad Swanepoel

Let $\D$ be a set of $n$ pairwise disjoint unit balls in $\R^d$ and $P$ the set of their center points. A hyperplane $\Hy$ is an \emph{$m$-separator} for $\D$ if each closed halfspace bounded by $\Hy$ contains at least $m$ points from $P$.…

Computational Geometry · Computer Science 2014-05-09 Michael Hoffmann , Vincent Kusters , Tillmann Miltzow

We are interested to bound from below the number of distinct dot products determined by a finite set of points $P$ in the Euclidean plane. In this paper, we build on the work of B. Hanson, O. Roche-Newton, and S. Senger, to obtain the…

Combinatorics · Mathematics 2025-02-19 Michalis Kokkinos

We generalize a Furstenberg-type result of Orponen-Shmerkin to higher dimensions, leading to an $\epsilon$-improvement in Kaufman's projection theorem for hyperplanes and an unconditional discretized radial projection theorem in the spirit…

Classical Analysis and ODEs · Mathematics 2023-09-11 Kevin Ren

This paper may be viewed as a companion paper to [G1]. In that paper, $L^2$ Sobolev estimates derived from a Newton polyhedron-based resolution of singularities method are combined with interpolation arguments to prove $L^p$ to $L^q_s$…

Classical Analysis and ODEs · Mathematics 2019-10-22 Michael Greenblatt

For the trace of Besov spaces $B^s_{p,q}$ onto a hyperplane, the borderline case with $s=\frac{n}{p}-(n-1)$ and $0<p<1$ is analysed and a new dependence on the sum-exponent $q$ is found. Through examples the restriction operator defined for…

Analysis of PDEs · Mathematics 2017-03-23 Jon Johnsen

Let $P$ be a set of $n$ points in the plane, and let $\mathcal C$ be a collection of $n$ simple $k$-intersecting curves, meaning that every two distinct curves of $\mathcal C$ meet in at most $k$ points. A classical theorem of Pach and…

Combinatorics · Mathematics 2026-05-21 Andrew Suk , Su Zhou

In this paper we obtain a new lower bound on the Erd\H{o}s distinct distances problem in the plane over prime fields. More precisely, we show that for any set $A\subset \mathbb{F}_p^2$ with $|A|\le p^{7/6}$, the number of distinct distances…

Combinatorics · Mathematics 2019-03-26 Alex Iosevich , Doowon Koh , Thang Pham , Chun-Yen Shen , Le Anh Vinh

The Radon transform is a fundamental tool for analyzing data in tomographic imaging, optimal transport, crystallography, and geometric analysis. Numerical computations require an accurate discretization. To deal with voxelized images and…

Numerical Analysis · Mathematics 2026-03-17 Robert Beinert , Jonas Bresch , Michael Quellmalz

Given a set C in R^d, let p(C) be the probability that a random d-dimensional unimodular lattice, chosen according to Haar measure on SL(d,Z)\SL(d,R), is disjoint from C\{0}. For special convex sets C we prove bounds on p(C) which are sharp…

Number Theory · Mathematics 2014-02-26 Andreas Strömbergsson

The convex hull generated by the restriction to the unit ball of a stationary Poisson point process in the $d$-dimensional Euclidean space is considered. By establishing sharp bounds on cumulants, exponential estimates for large deviation…

Probability · Mathematics 2015-12-15 Julian Grote , Christoph Thaele

Let $p$ be an odd prime and let $E\subset \mathbb{F}_p^2$ with $|E|=p^a$, where $0<a\le 1$. For a direction $V$ (a $1$-dimensional subspace of $\mathbb{F}_p^2$), let $\pi^V:\mathbb{F}_p^2\to \mathbb{F}_p^2/V$ denote the quotient map. We…

Combinatorics · Mathematics 2026-02-03 Ben Lund , Thang Pham , Le Anh Vinh

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