Related papers: Fourier analysis, linear programming, and densitie…

Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distances rather than their actual values. Lower and upper bounds for…

Recent advances in machine learning have shown promising results for financial prediction using large, over-parameterized models. This paper provides theoretical foundations and empirical validation for understanding when and how these…

We provide estimates for the dimensions of sets in $\mathbb{R}$ which uniformly avoid finite arithmetic progressions. More precisely, we say $F$ uniformly avoids arithmetic progressions of length $k \geq 3$ if there is an $\epsilon>0$ such…

We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…

The results in this paper are of two types. On one hand, we construct sets of large Fourier dimension that avoid nontrivial solutions of certain classes of linear equations. In particular, given any finite collection of…

We show that if a closed discrete subset $A \subseteq \mathbf{R}^d$ is denser than a certain critical threshold, then $A$ is a Fourier uniqueness set, while if $A$ is sparser, then uniqueness fails and one can prescribe arbitrary values for…

We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…

It is now practically the norm for data to be very high dimensional in areas such as genetics, machine vision, image analysis and many others. When analyzing such data, parametric models are often too inflexible while nonparametric…

We study the Falconer distance set problem in Euclidean space and obtain improved dimensional estimates under natural Fourier analytic assumptions cast in terms of the Fourier dimension and spectrum. Interestingly, under reasonably mild…

The problem of finding code distance has been long studied for the generic ensembles of linear codes and led to several algorithms that substantially reduce exponential complexity of this task. However, no asymptotic complexity bounds are…

In this paper, we establish sample complexity bounds for learning high-dimensional simplices in $\mathbb{R}^K$ from noisy data. Specifically, we consider $n$ i.i.d. samples uniformly drawn from an unknown simplex in $\mathbb{R}^K$, each…

We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…

In this article we obtain linear programming bounds for the maximal sphere packing density of commutative spaces. A special case of our results solves a conjecture by Cohn and Zhao on linear programming bounds for sphere packings in…

For any $d\in \mathbb{N}$ and any function $f:(0,\infty)\to [0,1]$ with $f(R)\to 0$ as $R\to \infty$, we construct a set $A \subseteq \mathbb{R}^d$ and a sequence $R_n \to \infty$ such that $\|x-y\| \neq R_n$ for all $x,y\in A$ and…

We obtain new lower bounds on the Hausdorff dimension of distance sets and pinned distance sets of planar Borel sets of dimension slightly larger than $1$, improving recent estimates of Keleti and Shmerkin, and of Liu in this regime. In…

A spherical three-distance set is a finite collection $X$ of unit vectors in $\mathbb{R}^{n}$ such that for each pair of distinct vectors has three inner product values. We use the semidefinite programming method to improve the upper bounds…

We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including sublinear and nonlinear codes. We focus on the general setting of finite translation-invariant metric…

We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n\in\{16,\ldots,30\}$. When $n\leq 21$, our bounds match the best known lower bounds, and we fully enumerate the densest…

We prove that a random linear code over F_q, with probability arbitrarily close to 1, is list decodable at radius (1-1/q-\epsilon) with list size L=O(1/\epsilon^2) and rate R=\Omega_q(\epsilon^2/(log^3(1/\epsilon))). Up to the…

We prove that for any dimension function $h$ with $h \prec x^d$ and for any countable set of linear patterns, there exists a compact set $E$ with $\mathcal{H}^h(E)>0$ avoiding all the given patterns. We also give several applications and…