Related papers: Distribution of distances in five dimensions and r…
Let $F$ be a $\delta-$field (differential field) of characteristic zero with an algebraically closed field of constants $F^\delta$, $A$ be a $\delta-F-$central simple algebra, $K$ be a Picard-Vessiot extension for the $\delta-F-$module $A$…
We prove a point-wise and average bound for the number of incidences between points and hyper-planes in vector spaces over finite fields. While our estimates are, in general, sharp, we observe an improvement for product sets and sets…
Given any $f$ a locally finitely piecewise affine homeomorphism of $\Omega \subset \mathbb{R}^d$ onto $\Delta \subset \mathbb{R}^d$ (for $d=3, 4$) such that $f\in W^{1,p}(\Omega, \mathbb{R}^d)$ and $f^{-1}\in W^{1,q}(\Delta, \mathbb{R}^d)$,…
In this paper we study extension problems, averaging problems, and generalized Erdos-Falconer distance problems associated with arbitrary homogeneous varieties in three dimensional vector space over finite fields. In the case when…
We discuss the general and approximate angular diameter distance in the Friedman-Robertson-Walker cosmological models with nonzero cosmological constant. We modify the equation for the angular diameter distance by taking into account the…
For a finite abelian group $G$, the Erd\H{o}s-Ginzburg-Ziv constant $\mathfrak{s}(G)$ is the smallest $s$ such that every sequence of $s$ (not necessarily distinct) elements of $G$ has a zero-sum subsequence of length…
Given a set $X\subseteq\mathbb{R}^2$ of $n$ points and a distance $d>0$, the multiplicity of $d$ is the number of times the distance $d$ appears between points in $X$. Let $a_1(X) \geq a_2(X) \geq \cdots \geq a_m(X)$ denote the…
Motivated by [7], we study the advection-hyperdiffusion equation in the whole space in two and three dimensions with the goal of understanding the decay in time of the $H^{-1}$- and $L^2$-norm of the solutions. We view the advection term as…
We consider the distance minimization problem to a real algebraic variety $X \subseteq \RR^n$ when the metric is induced by a polyhedral norm. Each point in the variety has a Voronoi cell whose geometry depends on the normal space at the…
Given a set of points $P \subset \mathbb F_q^2$ such that $|P|\geq q^{3/2}$ it is established that $|P|$ determines $\Omega(q^2)$ distinct perpendicular bisectors. It is also proven that, if $|P| \geq q^{4/3}$, then for a positive…
Given a set of points \F in a high dimensional space, the problem of finding a union of subspaces \cup_i V_i\subset \R^N that best explains the data \F increases dramatically with the dimension of \R^N. In this article, we study a class of…
Let F_q be a finite field with odd q elements. In this article, we prove that if E \subseteq \mathbb F_q^d, d\ge 2, and |E|\ge q, then there exists a set Y \subseteq \mathbb F_q^d with |Y|\sim q^d$ such that for all y\in Y, the number of…
We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…
In this paper, we propose the Fourier Discrepancy Function, a new discrepancy to compare discrete probability measures. We show that this discrepancy takes into account the geometry of the underlying space. We prove that the Fourier…
Starting with a similarity function between objects, it is possible to define a distance metric on pairs of objects, and more generally on probability distributions over them. These distance metrics have a deep basis in functional analysis,…
Let $\mathbb{F}_q$ be a finite field of order $q$. In this paper, we study the distribution of rectangles in a given set in $\mathbb{F}_q^2$. More precisely, for any $0<\delta\le 1$, we prove that there exists an integer $q_0=q_0(\delta)$…
We study the problem of constructing a data structure that can store a two-dimensional polygonal curve $P$, such that for any query segment $\overline{ab}$ one can efficiently compute the Fr\'{e}chet distance between $P$ and…
A \emph{tree-partition} of a graph $G$ is a proper partition of its vertex set into `bags', such that identifying the vertices in each bag produces a forest. The \emph{tree-partition-width} of $G$ is the minimum number of vertices in a bag…
In neuroscience, the distribution of a decision time is modelled by means of a one-dimensional Fokker--Planck equation with time-dependent boundaries and space-time-dependent drift. Efficient approximation of the solution to this equation…
In this note, we give a construction of codes on algebraic function field $F/ \mathbb{F}_{q}$ using places of $F$ (not necessarily of degree one) and trace functions from various extensions of $\mathbb{F}_{q}$. This is a generalization of…