Related papers: Triangles with one fixed side-length, a Furstenber…

In this short note, we give a lower bound on the number of congruence classes of triangles in a small set of points in $\mathbb{F}_p^2$. More precisely, for $\mathcal{A}\subset \mathbb{F}_p^2$ with $|\mathcal{A}|\le p^{2/3}$, we prove that…

We prove that if $E \subset {\mathbb F}_q^2$, $q \equiv 3 \mod 4$, has size greater than $Cq^{7/4}$, then $E$ determines a positive proportion of all congruence classes of triangles in ${\mathbb F}_q^2$. The approach in this paper is based…

We prove a new lower bound for the number of pinned distances over finite fields: if $A$ is a sufficiently small subset of $\mathbb{F}_q^2$, then there is an element in $A$ that determines $\gg |A|^{2/3}$ distinct distances to other…

We study a generalization of the Erd\H{o}s-Falconer distance problem over finite fields. For a graph $G$, two embeddings $p, p': V(G) \to \mathbb{F}_q^d$ of a graph $G$ are congruent if for all edges $(v_i, v_j)$ of $G$ we have that…

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…

We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], requires a…

We show that if a finite point set $P\subseteq \mathbb{R}^2$ has the fewest congruence classes of triangles possible, up to a constant $M$, then at least one of the following holds. (1) There is a $\sigma>0$ and a line $l$ which contains…

Let $A$ and $B$ be sets in a finite vector space. In this paper, we study the magnitude of the set $A\cap f(B)$, where $f$ runs through a set of transformations. More precisely, we will focus on the cases that the set of transformations is…

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…

We prove that if the cardinality of a subset of the 2-dimensional vector space over a finite field with $q$ elements is $\ge \rho q^2$, with $\frac{1}{\sqrt{q}}<<\rho \leq 1$, then it contains an isometric copy of $\ge c\rho q^3$ triangles.

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…

Let $P$ be a set of $N$ points in the Euclidean plane, where a positive proportion of points lies off a single straight line. This note points out two facts concerning the number of equivalence classes of triangles that $P$ determines,…

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…

We establish improved finite field Szemeredi-Trotter and Beck type theorems. First we show that if P and L are a set of points and lines respectively in the plane F_p^2, with |P|,|L| \leq N and N<p, then there are at most C_1…

We prove bounds on approximate incidences between families of circles and families of points in the plane. As a consequence, we prove a lower bound for the dimension of circular $(u,v)$-Furstenberg sets, which is new for large $u$ and $v$.

We prove an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…

We give a lower bound for the size of a subset of $\mathbb F_q^n$ containing a rich k-plane in every direction, a k-plane Furstenberg set. The chief novelty of our method is that we use arguments on non-reduced subschemes and flat families…

The Longest Edge Bisection of a triangle is performed by joining the midpoint of its longest edge to the opposite vertex. Applying this procedure iteratively produces an infinite family of triangles. Surprisingly, a classical result of…

In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…

We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the…