Related papers: Lower bounds for incidences with hypersurfaces

This article concerns a natural generalization of the classical asymptotic Plateau problem in hyperbolic space. We prove the existence of a smooth complete hypersurface of constant scalar curvature with a prescribed asymptotic boundary at…

Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…

The program of understanding Shape Theory layer by layer topologically and geometrically -- proposed in Part I -- is now addressed for 4 points in 1-$d$. Topological shape space graphs are far more complex here, whereas metric shape spaces…

We improve the range of exponents for the restriction problem for the 3-d paraboloid over finite fields. The key new ingredient is a variant of the Bourgain-Katz-Tao finite field incidence theorem derived from sum-product estimates. In…

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…

We present new results on $2$- and $3$-hop spanners for geometric intersection graphs. These include improved upper and lower bounds for $2$- and $3$-hop spanners for many geometric intersection graphs in $\mathbb{R}^d$. For example, we…

We show that $m$ points and $n$ two-dimensional algebraic surfaces in $\mathbb{R}^4$ can have at most $O(m^{\frac{k}{2k-1}}n^{\frac{2k-2}{2k-1}}+m+n)$ incidences, provided that the algebraic surfaces behave like pseudoflats with $k$ degrees…

In contrast to elliptic surfaces, the Fourier restriction problem for hypersurfaces of non-vanishing Gaussian curvature which admit principal curvatures of opposite signs is still hardly understood. In fact, even for 2-surfaces, the only…

This is an addendum to the paper of Braun and Fl{\o}ystad ([BF]) on the bound for the degree of a smooth surface in $\pfour$ not of general type. Using their construction and the regularity of curves in $\pthree$, one may lower the bound a…

In quantum theory on curved backgrounds, Heisenberg's uncertainty principle is usually discussed in terms of ensemble variances and flat-space commutators. Here we take a different, preparation-based viewpoint tailored to sharp position…

We investigate compactness phenomena involving free boundary minimal hypersurfaces in Riemannian manifolds of dimension less than eight. We provide natural geometric conditions that ensure strong one-sheeted graphical subsequential…

We prove the existence of solutions to the asymptotic Plateau problem for hypersurfaces of prescribed mean curvature in Cartan-Hadamard manifolds $N$. More precisely, given a suitable subset $L$ of the asymptotic boundary of $N$ and a…

Hypersurfaces of arbitrary causal character embedded in a spacetime are studied with the aim of extracting necessary and sufficient free data on the submanifold suitable for reconstructing the spacetime metric and its first derivative along…

We give an algorithmic and lower-bound framework that facilitates the construction of subexponential algorithms and matching conditional complexity bounds. It can be applied to intersection graphs of similarly-sized fat objects, yielding…

We study the time complexity of the discrete $k$-center problem and related (exact) geometric set cover problems when $k$ or the size of the cover is small. We obtain a plethora of new results: - We give the first subquadratic algorithm for…

Let $H_d(n,p)$ signify a random $d$-uniform hypergraph with $n$ vertices in which each of the ${n}\choose{d}$ possible edges is present with probability $p=p(n)$ independently, and let $H_d(n,m)$ denote a uniformly distributed with $n$…

We study the boundary behaviors of solutions $f$ to the Dirichlet problem for minimal graphs in the hyperbolic space with singular asymptotic boundaries and characterize the boundary behaviors of $f$ at the points strictly located in the…

Incidence problems between geometric objects is a key area of focus in the field of discrete geometry. Among them, the study of incidence problems over finite fields have received a considerable amount of attention in recent years. In this…

A classical result by Erd\H{o}s, and later on by Bondy and Simonivits, states that every $n$-vertex graph with no cycle of length $2k$ has at most $O(n^{1+1 /k})$ edges. This bound is known to be tight when $k \in \{2,3,5\},$ but it is a…

In this paper we raise a variant of a classic problem in extremal graph theory, which is motivated by a design of fractional repetition codes, a model in distributed storage systems. For any feasible positive integers $d\geq 3$, $n \geq 3$,…