Related papers: Intersection patterns and connections to distance …

In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of two main parts. In the first, we address problems and…

We derive a general upper bound for the number of incidences with $k$-dimensional varieties in ${\mathbb R}^d$. The leading term of this new bound generalizes previous bounds for the special cases of $k=1, k=d-1,$ and $k= d/2$, to every…

We study a model of programmable matter systems consisting of $n$ devices lying on a 2-dimensional square grid, which are able to perform the minimal mechanical operation of rotating around each other. The goal is to transform an initial…

Our motivation in this paper is twofold. First, we study the geometry of a class of exploration sets, called exit sets, which are naturally associated with a 2D vector-valued GFF : $\phi : Z^2 \to R^N, N\geq 1$. We prove that, somewhat…

We prove a geometric property of the set A^{-1} of inverses of the nonzero elements of an F_q-subspace A of a finite field involving the size of its intersection with two-dimensional F_q-subspaces. We give some applications, including a new…

In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our…

Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\em fast Fourier…

The present paper generalizes the result from one of the papers by Galstyan. Namely, we consider two nonempty subsets $A$ and $B$ of a metric space $X$, and construct one-parametric family $F_r$ of subsets obtained by intersection between…

We present some elementary ideas to prove the following Sylvester-Gallai type theorems involving incidences between points and lines in the planes over the complex numbers and quaternions. (1) Let A and B be finite sets of at least two…

This paper is the fourth and the last part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the Geometric…

Let $V\subset \mathbb{F}_q^d$ be a \textit{regular} variety, $k\ge 3$ is an integer and $A\subseteq V$. Covert, Koh, and Pi (2017) proved the following generalization of the Erd\H{o}s-Falconer distance problem: If $|A|\gg…

We prove in Theorem $2.2$ that the multiplicatively closed subset generated by at most two elements in the set of natural numbers $\mathbb{N}$ has arbitrarily large gaps by explicitly constructing large integer intervals with known prime…

Here we examine some Erdos-Falconer-type problems in vector spaces over finite fields involving right angles. Our main goals are to show that a) a subset A of F_q^d of size >> q^[(d+2)/3] contains three points which generate a right angle,…

Guth and Katz proved that any point set $\mathcal P$ in the plane determines $\Omega(|\mathcal P|/\log|\mathcal P|)$ distinct distances. We show that when near to this lower bound, a point set $\mathcal P$ of the form $A\times A$ must…

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

The three gap theorem, also known as the Steinhaus conjecture or three distance theorem, states that the gaps in the fractional parts of $\alpha,2\alpha,\ldots, N\alpha$ take at most three distinct values. Motivated by a question of…

We study exceptional sets for the Chacon transformation and, more generally, for a class of cutting-and-stacking transformations called restrictive tight maps. For these systems we explicitly construct a universal exceptional set…

Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…

Let $\alpha(\mathbb{F}_q^d,p)$ denote the maximum size of a general position set in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^2,p)$ up to polylogarithmic factors for all possible…

A celebrated unit distance conjecture due to Erd\H os says that that the unit distances cannot arise more than $C_{\epsilon}n^{1+\epsilon}$ times (for any $\epsilon>0$) among $n$ points in the Euclidean plane (see e.g. \cite{SST84} and the…