Related papers: An incidence theorem in higher dimensions

In this paper, we prove an extension theorem for spheres of square radii in $\mathbb{F}_q^d$, which improves a result obtained by Iosevich and Koh (2010). Our main tool is a new point-hyperplane incidence bound which will be derived via a…

We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…

We generalize Siegel's theorem on integral points on affine curves to integral points of bounded degree, giving a complete characterization of affine curves with infinitely many integral points of degree d or less over some number field.…

How much of the combinatorial structure of a pointed polyhedron is contained in its vertex-facet incidences? Not too much, in general, as we demonstrate by examples. However, one can tell from the incidence data whether the polyhedron is…

We prove the following conjecture of Margulis. Let $G$ be a higher rank simple Lie group and let $\Lambda\le G$ be a discrete subgroup of infinite covolume. Then, the locally symmetric space $\Lambda\backslash G/K$ admits injected balls of…

We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs.…

The classical Steinitz theorem asserts that if the origin lies within the interior of the convex hull of a set $S \subset \mathbb{R}^d$, then there are at most $2d$ points in $S$ whose convex hull contains the origin within its interior.…

An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…

Adding small random parametric noise to an arc of diffeomophisms of a manifold of dimension 3, generically unfolding a codimension one quadratic homoclinic tangency q associated to a sectionally dissipative saddle fixed point p, we obtain…

It is shown that space-time may possess the differentiability properties of manifolds as well as the ultraviolet finiteness properties of lattices. Namely, if a field's amplitudes are given on any sufficiently dense set of discrete points…

The purpose of this survey is to present analytic versions of the injectivity theorem and their applications. The proof of our injectivity theorems is based on a combination of the L^2-method for the dbar-equation and the theory of harmonic…

We strengthen the maximal ergodic theorem for actions of groups of polynomial growth to a form involving jump quantity, which is the sharpest result among the family of variational or maximal ergodic theorems. As a consequence, we deduce in…

The purpose of this paper is to establish an injectivity theorem generalized to pseudo-effective line bundles with transcendental (non-algebraic) singular hermitian metrics and multiplier ideal sheaves. As an application, we obtain a Nadel…

We establish explicit lower bounds for advection-diffusion equations in three settings: a polynomial $\dot H^{-1}$ bound for inviscid shears with $u\in L^\infty_t W^{1,1}_y$, a uniform positive lower bound on the mixing scale for diffusive…

We consider shifts of a set $A\subseteq\mathbb{N}$ by elements from another set $B\subseteq\mathbb{N}$, and prove intersection properties according to the relative asymptotic size of $A$ and $B$. A consequence of our main theorem is the…

The first purpose of this paper is to solve completely the finite field cone restriction conjecture in four dimensions with $-1$ non-square. The second is to introduce a new approach to study incidence problems via restriction theory. More…

Let d = (d1, d2, ..., dn) be a vector of non-negative integers with even sum. We prove some basic facts about the structure of a random graph with degree sequence d, including the probability of a given subgraph or induced subgraph.…

We prove matching asymptotic lower and upper bounds on the variances of the intrinsic volumes and the number of $k$-faces of $d$-dimensional random beta-polytopes. Using Stein's methods, we establish central limit theorems for the intrinsic…

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

Determining the appropriate number of clusters in unsupervised learning is a central problem in statistics and data science. Traditional validity indices such as Calinski-Harabasz, Silhouette, and Davies-Bouldin-depend on centroid-based…