Related papers: On the Erdos distinct distance problem in the plan…

This paper focuses on incidences over finite fields, extending to higher degrees a result by Vinh \cite{VINH20111177} on the number of point-line incidences in the plane $\mathbb{F}^2$, where $\mathbb{F}$ is a finite field. Specifically, we…

Many discrete optimization problems amount to selecting a feasible set of edges of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets.…

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let $X\subset \mathbb{R}^n$ Borel and $k \in [0, n-1]$ be an integer. Let $\dim (X \setminus H) = \dim X$ for every…

Let $ l =[l_0,l_1]$ be the directed line segment from $l_0\in {\mathbb R}^n$ to $l_1\in{\mathbb R}^n.$ Suppose $\bar l=[\bar l_0,\bar l_1]$ is a second segment of equal length such that $l, \bar l$ satisfy the "two sticks condition": $\|…

In the Geometric Median problem with outliers, we are given a finite set of points in d-dimensional real space and an integer m, the goal is to locate a new point in space (center) and choose m of the input points to minimize the sum of the…

We prove that no ball admits a non-harmonic orthogonal basis of exponentials. We use a combinatorial result, originally studied by Erd\H os, which says that the number of distances determined by $n$ points in ${\Bbb R}^d$ is at least $C_d…

In this paper, we solve a separation of singularities problem in the Bergman space. More precisely, we show that if $P\subset \mathbb{C}$ is a convex polygon which is the intersection of $n$ half planes, then the Bergman space on $P$…

Let $d$ and $n$ be positive integers, and $E/F$ be a separable field extension of degree $m=\binom{n+d}{n}$. We show that if $|F| > 2$, then there exists a point $P\in \mathbb{P}^n(E)$ which does not lie on any degree $d$ hypersurface…

In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex…

We show that $m$ points and $n$ smooth algebraic surfaces of bounded degree in $\mathbb{R}^3$ satisfying suitable nondegeneracy conditions can have at most $O(m^{\frac{2k}{3k-1}}n^{\frac{3k-3}{3k-1}}+m+n)$ incidences, provided that any…

Let $\Sigma(f)$ be critical points of a polynomial $f \in \mathbb{K}[x,y]$ in the plane $\mathbb{K}^2$, where $\mathbb{K}$ is $\mathbb{R}$ or $\mathbb{C}$. Our goal is to study the critical point map $\mathfrak{S}_d$, by sending polynomials…

We generalize the Szemer\'edi-Trotter incidence theorem, to bound the number of complete \emph{flags} in higher dimensions. Specifically, for each $i=0,1,\ldots,d-1$, we are given a finite set $S_i$ of $i$-flats in $\R^d$ or in $\C^d$, and…

We give an overview of recent progress around a problem introduced by Elekes and R\'onyai. The prototype problem is to show that a polynomial $f\in \mathbb{R}[x,y]$ has a large image on a Cartesian product $A\times B\subset \mathbb{R}^2$,…

Given a set of points $P$ and axis-aligned rectangles $\mathcal{R}$ in the plane, a point $p \in P$ is called \emph{exposed} if it lies outside all rectangles in $\mathcal{R}$. In the \emph{max-exposure problem}, given an integer parameter…

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…

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…

We prove an intersection formula for two plane branches in terms of their semigroups and key polynomials. Then we provide a strong version of Bayer's theorem on the set of intersection numbers of two branches and apply it to the logarithmic…

We consider the Tur\'an-type problem of bounding the size of a set $M \subseteq \mathbb{F}_2^n$ that does not contain a linear copy of a given fixed set $N \subseteq \mathbb{F}_2^k$, where $n$ is large compared to $k$. An Erd\H{o}s-Stone…

We establish the optimal lower bound $\gtrsim N$ for counting the number of distinct inner products of pairs from any $N$ given vectors in $\R^2$. Essentially, we lift a related incidence structure defined by inner products in the plane to…