Searcharxiv⌕ Search

arXiv subjects

A. Iosevich

Publications and source records attributed to A. Iosevich.

At least 37 records · Page 2Linked to original sources

Effective support, Dirac combs, and signal recovery

Let $f: {\mathbb Z}_N^d \to {\mathbb C}$ be a signal with the Fourier transform $\widehat{f}: \Bbb Z_N^d\to \Bbb C$. A classical result due to Matolcsi and Szucs (\cite{MS73}), and, independently, to Donoho and Stark (\cite{DS89}) states if a subset of frequencies ${\{\widehat{f}(m)\}}_{m \in S}$ of $f$ are unobserved due to noise or other interference, then $f$ can be recovered exactly and uniquely provided that $$ |E| \cdot |S|<\frac{N^d}{2},$$ where $E$ is the support of $f$, i.e., $E=\{x \in {\mathbb Z}_N^d: f(x) \not=0\}$. In this paper, we consider signals that are Dirac combs of complexity $γ$, meaning they have the form $f(x)=\sum_{i=1}^γ a_i 1_{A_i}(x)$, where the sets $A_i \subset {\mathbb Z}_N^d$ are disjoint, $a_i$ are complex numbers, and $γ\leq N^d$. We will define the concept of effective support of these signals and show that if $γ$ is not too large, a good recovery condition can be obtained by pigeonholing under additional reasonable assumptions on the distribution of values. Our approach produces a non-trivial uncertainty principle and a signal recovery condition in many situations when the support of the function is too large to apply the classical theory.

math.CA↗

Buffon Needle Problem Over Convex Sets

We solve a variant of the classical Buffon Needle problem. More specifically, we inspect the probability that a randomly oriented needle of length $l$ originating in a bounded convex set $X\subset\mathbb{R}^2$ lies entirely within $X$. Using techniques from convex geometry, we prove an isoperimetric type inequality, showing that among sets $X$ with equal perimeter, the disk maximizes this probability.

math.CA↗

Similar point configurations via group actions

We prove that for $d\ge 2,\, k\ge 2$, if the Hausdorff dimension of a compact set $E\subset \mathbb{R}^d$ is greater than $\frac{d^2}{2d-1}$, then, for any given $r > 0$, there exist $(x^1, \dots, x^{k+1})\in E^{k+1}$, $(y^1, \dots, y^{k+1})\in E^{k+1}$, a rotation $θ\in \mathrm{O}_d(\mathbb{R})$, and a vector $a \in \mathbb{R}^d$ such that $rx^j = θy^j - a$ for $1 \leq j \leq k+1$. Such a result on existence of similar $k$-simplices in thin sets had previously been established under a more stringent dimensional threshold in Greenleaf, Iosevich and Mkrtchyan \cite{GIM21}. The argument we are use to prove the main result here was previously employed in Bhowmik and Rakhmonov \cite{BR23} to establish a finite field version. We also show the existence of multi-similarities of arbitrary multiplicity in $\R^d$, show how to extend these results from similarities to arbitrary proper continuous maps, as well as explore a general group-theoretic formulation of this problem in vector spaces over finite fields.

math.CA↗

Multi-linear forms, structure of graphs and Lebesgue spaces

Consider the operator $$T_Kf(x)=\int_{{\mathbb R}^d} K(x,y) f(y) dy,$$ where $K$ is a locally integrable function or a measure. The purpose of this paper is to study the multi-linear form $$ Λ^K_G(f_1, \dots, f_n)=\int \dots \int \prod_{ \{(i,j): 1 \leq i<j \leq n; E(i,j)=1 \} } K(x^i,x^j) \prod_{i=1}^n f_i(x^i) dx^i, $$ where $G$ is a connected graph on $n$ vertices, $E$ is the edge map on $G$, i.e $E(i,j)=1$ if and only if the $i$'th and $j$'th vertices are connected by an edge, $K$ is the aforementioned kernel, and $f_i: {\mathbb R}^d \to {\mathbb R}$, measurable. This paper establishes multi-linear inequalities of the form $$ Λ^K_G(f_1,f_2, \dots,f_n) \leq C {||f_1||}_{L^{p_1}({\mathbb R}^d)} {||f_2||}_{L^{p_2}({\mathbb R}^d)} \dots {||f_n||}_{L^{p_n}({\mathbb R}^d)}$$ and determines how the exponents depend on the structure of the kernel $K$ and the graph $G$.

math.CA↗

Fractal dimension, approximation and data sets

The purpose of this paper is to study the fractal phenomena in large data sets and the associated questions of dimension reduction. We examine situations where the classical Principal Component Analysis is not effective in identifying the salient underlying fractal features of the data set. Instead, we employ the discrete energy, a technique borrowed from geometric measure theory, to limit the number of points of a given data set that lie near a $k$-dimensional hyperplane, or, more generally, near a set of a given upper Minkowski dimension. Concrete motivations stemming from naturally arising data sets are described and future directions outlined.

math.ST↗

Dot products in ${\Bbb F}_q^3$ and the Vapnik-Chervonenkis dimension

Given a set $E \subset {\Bbb F}_q^3$, where ${\Bbb F}_q$ is the field with $q$ elements. Consider a set of "classifiers" ${\mathcal H}^3_t(E)=\{h_y: y \in E\}$, where $h_y(x)=1$ if $x \cdot y=t$, $x \in E$, and $0$ otherwise. We are going to prove that if $|E| \ge Cq^{\frac{11}{4}}$, with a sufficiently large constant $C>0$, then the Vapnik-Chervonenkis dimension of ${\mathcal H}^3_t(E)$ is equal to $3$. In particular, this means that for sufficiently large subsets of ${\Bbb F}_q^3$, the Vapnik-Chervonenkis dimension of ${\mathcal H}^3_t(E)$ is the same as the Vapnik-Chervonenkis dimension of ${\mathcal H}^3_t({\Bbb F}_q^3)$. In some sense the proof leads us to consider the most complicated possible configuration that can always be embedded in subsets of ${\Bbb F}_q^3$ of size $\ge Cq^{\frac{11}{4}}$.

math.CO↗

Uniform distribution and geometric incidence theory

A celebrated unit distance conjecture due to Erd\H os says that that the unit distances cannot arise more than $C_εn^{1+ε}$ times (for any $ε>0$) among $n$ points in the Euclidean plane (see e.g. \cite{SST84} and the references contained therein). In three dimensions, the conjectured bound is $Cn^{\frac{4}{3}}$ (see e.g. \cite{KMSS12} and \cite{Z19}). In dimensions four and higher, this problem, in its general formulation, loses meaning because the Lens example shows that one can construct a set of $n$ points in dimension $4$ and higher where the unit distance arises $\approx n^2$ times (see e.g. \cite{B97}). However, the Lens example is one-dimension in nature, which raises the possibility that the unit distance conjecture is still quite interesting in higher dimensions under additional structural assumptions on the point set. This point of view was explored in \cite{I19}, \cite{IS16}, \cite{IMT12}, \cite{IRU14}, \cite{OO15} and has led to some interesting connections between the unit distance problem and its continuous counterparts, especially the Falconer distance conjecture (\cite{Falc85}). In this paper, we study the unit distance problem and its variants under the assumption that the underlying family of point sets is uniformly distributed. We prove several incidence bounds in this setting and clarify some key properties of uniformly distributed sequences in the context of incidence problems in combinatorial geometry.

math.CO↗

The VC-dimension and point configurations in ${\Bbb F}_q^2$

Let $X$ be a set and ${\mathcal H}$ a collection of functions from $X$ to $\{0,1\}$. We say that ${\mathcal H}$ shatters a finite set $C \subset X$ if the restriction of ${\mathcal H}$ yields every possible function from $C$ to $\{0,1\}$. The VC-dimension of ${\mathcal H}$ is the largest number $d$ such that there exists a set of size $d$ shattered by ${\mathcal H}$, and no set of size $d+1$ is shattered by ${\mathcal H}$. Vapnik and Chervonenkis introduced this idea in the early 70s in the context of learning theory, and this idea has also had a significant impact on other areas of mathematics. In this paper we study the VC-dimension of a class of functions ${\mathcal H}$ defined on ${\Bbb F}_q^d$, the $d$-dimensional vector space over the finite field with $q$ elements. Define $$ {\mathcal H}^d_t=\{h_y(x): y \in {\Bbb F}_q^d \},$$ where for $x \in {\Bbb F}_q^d$, $h_y(x)=1$ if $||x-y||=t$, and $0$ otherwise, where here, and throughout, $||x||=x_1^2+x_2^2+\dots+x_d^2$. Here $t \in {\Bbb F}_q$, $t \not=0$. Define ${\mathcal H}_t^d(E)$ the same way with respect to $E \subset {\Bbb F}_q^d$. The learning task here is to find a sphere of radius $t$ centered at some point $y \in E$ unknown to the learner. The learning process consists of taking random samples of elements of $E$ of sufficiently large size. We are going to prove that when $d=2$, and $|E| \ge Cq^{\frac{15}{8}}$, the VC-dimension of ${\mathcal H}^2_t(E)$ is equal to $3$. This leads to an intricate configuration problem which is interesting in its own right and requires a new approach.

math.CO↗

Finite point configurations in the plane, rigidity and Erdos problems

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the corresponding vertices of $G$ are connected by an edge. We consider two frameworks the same if the specified edge-distances are the same. We find tight bounds on such distinct-distance drawings for rigid graphs in the plane, deploying the celebrated result of Guth and Katz. We introduce a congruence relation on the wider set of graphs, which behaves nicely in both the real-discrete and continuous settings. We provide a sharp bound on the number of such congruence classes. We then make a conjecture that the tight bound on rigid graphs should apply to all graphs. This appears to be a hard problem even in the case of the non-rigid 2-chain. However we provide evidence to support the conjecture by demonstrating that if the Erd\H os pinned-distance conjecture holds in dimension $d$ then the result for all graphs in dimension $d$ follows.

math.CO↗

On the quotient set of the distance set

Let ${\Bbb F}_q$ be a finite field of order $q.$ We prove that if $d\ge 2$ is even and $E \subset {\Bbb F}_q^d$ with $|E| \ge 9q^{\frac{d}{2}}$ then $$ {\Bbb F}_q=\frac{Δ(E)}{Δ(E)}=\left\{ \frac{a}{b}: a \in Δ(E), b \in Δ(E) \backslash \{0\} \right\},$$ where $$ Δ(E)=\{||x-y||: x,y \in E\}, \ ||x||=x_1^2+x_2^2+\cdots+x_d^2.$$ If the dimension $d$ is odd and $E\subset \mathbb F_q^d$ with $|E|\ge 6q^{\frac{d}{2}},$ then $$ \{0\}\cup\mathbb F_q^+ \subset \frac{Δ(E)}{Δ(E)},$$ where $\mathbb F_q^+$ denotes the set of nonzero quadratic residues in $\mathbb F_q.$ Both results are, in general, best possible, including the conclusion about the nonzero quadratic residues in odd dimensions.

math.CA↗

On Gabor orthonormal bases over finite prime fields

We study Gabor orthonormal windows in $L^2({\Bbb Z}_p^d)$ for translation and modulation sets $A$ and $B$, respectively, where $p$ is prime and $d\geq 2$. We prove that for a set $E\subset \Bbb Z_p^d$, the indicator function $1_E$ is a Gabor window if and only if $E$ tiles and is spectral. Moreover, we prove that for any function $g:\Bbb Z_p^d\to \Bbb C$ with support $E$, if the size of $E$ coincides with the size of the modulation set $B$ or if $g$ is positive, then $g$ is a unimodular function, i.e., $|g|=c1_E$, for some constant $c>0$, and $E$ tiles and is spectral. We also prove the existence of a Gabor window $g$ with full support where neither $|g|$ nor $|\hat g|$ is an indicator function and $|B|<<p^d$. We conclude the paper with an example and open questions.

math.CA↗

Distances from points to planes

We prove that if $E \subset {\Bbb F}_q^d$, $d \ge 2$, $F \subset \operatorname{Graff}(d-1,d)$, the set of affine $d-1$-dimensional planes in ${\Bbb F}_q^d$, then $|Δ(E,F)| \ge \frac{q}{2}$ if $|E||F|>q^{d+1}$, where $Δ(E,F)$ the set of distances from points in $E$ to lines in $F$. In dimension three and higher this significantly improves the exponent obtained by Pham, Phuong, Sang, Vinh and Valculescu.

math.CO↗

Rigidity, graphs and Hausdorff dimension

For a compact set $E \subset \mathbb R^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k+1$ points in $E$ such that the distance between a pair of points is specified if the corresponding vertices of $G$ are connected by an edge. We regard two such frameworks as equivalent if the specified distances are the same. We show that in a suitable sense the set of equivalences of such frameworks naturally embeds in ${\mathbb R}^m$ where $m$ is the number of "essential" edges of $G$. We prove that there exists a threshold $s_k<d$ such that if the Hausdorff dimension of $E$ is greater than $s_k$, then the $m$-dimensional Hausdorff measure of the set of equivalences of $G$-frameworks is positive. The proof relies on combinatorial, topological and analytic considerations.

math.CA↗

Wavelet decomposition and bandwidth of functions defined on vector spaces over finite fields

In this paper we study how zeros of the Fourier transform of a function $f: \mathbb{Z}_p^d \to \mathbb{C}$ are related to the structure of the function itself. In particular, we introduce a notion of bandwidth of such functions and discuss its connection with the decomposition of this function into wavelets. Connections of these concepts with the tomography principle and the Nyquist-Shannon sampling theorem are explored. We examine a variety of cases such as when the Fourier transform of the characteristic function of a set $E$ vanishes on specific sets of points, affine subspaces, and algebraic curves. In each of these cases, we prove properties such as equidistribution of $E$ across various surfaces and bounds on the size of $E$. We also establish a finite field Heisenberg uncertainty principle for sets that relates their bandwidth dimension and spatial dimension.

math.CA↗

Tiling sets and spectral sets over finite fields

We study tiling and spectral sets in vector spaces over prime fields. The classical Fuglede conjecture in locally compact abelian groups says that a set is spectral if and only if it tiles by translation. This conjecture was disproved by T. Tao in Euclidean spaces of dimensions 5 and higher, using constructions over prime fields (in vector spaces over finite fields of prime order) and lifting them to the Euclidean setting. Over prime fields, when the dimension of the vector space is less than or equal to $2$ it has recently been proven that the Fuglede conjecture holds (see \cite{IMP15}). In this paper we study this question in higher dimensions over prime fields and provide some results and counterexamples. In particular we prove the existence of spectral sets which do not tile in $\mathbb{Z}_p^5$ for all odd primes $p$ and $\mathbb{Z}_p^4$ for all odd primes $p$ such that $p \equiv 3 \text{ mod } 4$. Although counterexamples in low dimensional groups over cyclic rings $\mathbb{Z}_n$ were previously known they were usually for non prime $n$ or a small, sporadic set of primes $p$ rather than general constructions. This paper is a result of a Research Experience for Undergraduates program ran at the University of Rochester during the summer of 2015 by A. Iosevich, J. Pakianathan and G. Petridis.

math.CA↗

Long paths in the distance graph over large subsets of vector spaces over finite fields

Let $E \subset {\Bbb F}_q^d$, the $d$-dimensional vector space over a finite field with $q$ elements. Construct a graph, called the distance graph of $E$, by letting the vertices be the elements of $E$ and connect a pair of vertices corresponding to vectors $x,y \in E$ by an edge if $||x-y||={(x_1-y_1)}^2+\dots+{(x_d-y_d)}^2=1$. We shall prove that if the size of $E$ is sufficiently large, then the distance graph of $E$ contains long non-overlapping paths and vertices of high degree.

math.CO↗

The square root law and structure of finite rings

Let $R$ be a finite ring and define the hyperbola $H=\{(x,y) \in R \times R: xy=1 \}$. Suppose that for a sequence of finite odd order rings of size tending to infinity, the following "square root law" bound holds with a constant $C>0$ for all non-trivial characters $χ$ on $R^2$: \[ \left| \sum_{(x,y)\in H}χ(x,y)\right|\leq C\sqrt{|H|}. \] Then, with a finite number of exceptions, those rings are fields. For rings of even order we show that there are other infinite families given by Boolean rings and Boolean twists which satisfy this square-root law behavior. We classify the extremal rings, those for which the left hand side of the expression above satisfies the worst possible estimate. We also describe applications of our results to problems in graph theory and geometric combinatorics. These results provide a quantitative connection between the square root law in number theory, Salem sets, Kloosterman sums, geometric combinatorics, and the arithmetic structure of the underlying rings.

math.NT↗