Related papers: Incidence Theorems and Their Applications
We first describe a general class of optimization problems that describe many natural, economic, and statistical phenomena. After noting the existence of a conserved quantity in a transformed coordinate system, we outline several instances…
We present a direct and fairly simple proof of the following incidence bound: Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in ${\mathbb R}^d$, for $d\ge 3$, which lie in a common algebraic two-dimensional surface of degree $D$…
The first goal of this paper is to prove a sharp condition to guarantee of having a positive proportion of all congruence classes of triangles in given sets in $\mathbb{F}_q^2$. More precisely, for $A, B, C\subset \mathbb{F}_q^2$, if…
We consider the light scattering problem for a Gaussian beam and a (spherical) particle at arbitrary location. Within the beam cross section, the total electromagnetic field is the superposition of the incident beam and the scattered wave.…
We prove almost tight bounds on incidences between points and $k$-dimensional varieties of bounded degree in $\R^d$. Our main tools are the Polynomial Ham Sandwich Theorem and induction on both the dimension and the number of points.
We describe a Schubert induction theorem, a tool for analyzing intersections on a Grassmannian over an arbitrary base ring. The key ingredient in the proof is the Geometric Littlewood-Richardson rule, described in a companion paper.…
Intersecting codes are linear codes where every two nonzero codewords have non-trivially intersecting support. In this article we expand on the theory of this family of codes, by showing that nondegenerate intersecting codes correspond to…
The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially-filled tensors subject to rank…
We show that various classical theorems of real/complex linear incidence geometry, such as the theorems of Pappus, Desargues, M\"obius, and so on, can be interpreted as special cases of a single "master theorem" that involves an arbitrary…
The main motivation for this article is to explore the connections between the existence of certain combinatorial patterns (as in van der Corputs's theorem on arithmetic progressions of length $3$) with well-known tools and theorems for…
We develop the methods used by Rudnev and Wheeler to prove an incidence theorem between arbitrary sets of M\"{o}bius transformations and point sets in $\mathbb F_p^2$. We also note some asymmetric incidence results, and give applications of…
For any integer $d \geq 2$ and prime power $q$, we construct unexpectedly large induced matchings in the point-line incidence graph of $\mathbb{F}_{q}^{d}$ by leveraging a new connection with the Furstenberg-S\'ark\"ozy problem from…
We collect some results in combinatorial geometry that follow from an inequality of Langer in algebraic geometry. Langer's inequality gives a lower bound on the number of incidences between a point set and its spanned lines, and was…
This manuscript describes the notions of blocker and interdiction applied to well-known optimization problems. The main interest of these two concepts is the capability to analyze the existence of a combinatorial structure after some…
We introduce a new, elementary method for studying random differences in arithmetic progressions and convergence phenomena along random sequences of integers. We apply our method to obtain significant improvements on previously known…
We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
We give new results for problems in computational and statistical machine learning using tools from high-dimensional geometry and probability. We break up our treatment into two parts. In Part I, we focus on computational considerations in…
Intersection types have been originally developed as an extension of simple types, but they can also be used for refining simple types. In this survey we concentrate on the latter option; more precisely, on the use of intersection types for…
Maximum diversity problems arise in many practical settings from facility location to social networks, and constitute an important class of NP-hard problems in combinatorial optimization. There has been a growing interest in these problems…