Related papers: Fourier dimension and avoidance of linear patterns

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…

We show that subsets of $\mathbb{R}^n$ of large enough Hausdorff and Fourier dimension contain polynomial patterns of the form \begin{align*} ( x ,\, x + A_1 y ,\, \dots,\, x + A_{k-1} y ,\, x + A_k y + Q(y) e_n ), \quad x \in…

Let $E \subseteq R^n$ be a closed set of Hausdorff dimension $\alpha$. For $m \geq n$, let $\{B_1,\ldots,B_k\}$ be $n \times (m-n)$ matrices. We prove that if the system of matrices $B_j$ is non-degenerate in a suitable sense, $\alpha$ is…

In this paper we quantify the notion of antisymmetry of the Fourier transform of certain vector valued measures. The introduced scale is related to the condition appearing in Uchiyama's theorem and is used to give a lower bound for the…

It is known that there exists a network which does not have a scalar linear solution over any finite field but has a vector linear solution when message dimension is $2$ [3]. It is not known whether this result can be generalized for an…

In this paper we construct a new family of sets based on Diophantine approximation in the Euclidean space, and consider their applications in several problems in harmonic analysis. Our first application is on the Hausdorff dimension of our…

Arithmetic progressions of length $3$ may be found in compact subsets of the reals that satisfy certain Fourier -- as well as Hausdorff -- dimensional requirements. It has been shown that a very similar result holds in the integers under…

In this paper we derive new upper bounds for the densities of measurable sets in R^n which avoid a finite set of prescribed distances. The new bounds come from the solution of a linear programming problem. We apply this method to obtain new…

We present a detailed Hausdorff dimension analysis of the set of real numbers where the product of consecutive partial quotients in their continued fraction expansion grow at a certain rate but the growth of the single partial quotient is…

In this note we connect Sobolev estimates in the context of polynomial averages e.g. \[ \| \int_0^1 \prod_{k=1}^m f_k(x-t^k) \|_{1} \leq \text{Const} \cdot 2^{-\text{const} \cdot l} \prod_{i=1}^m \| f_k \|_m \] whenever some $f_i$ vanishes…

We introduce a class of algorithms for constructing Fourier representations of Gaussian processes in $1$ dimension that are valid over ranges of hyperparameter values. The scaling and frequencies of the Fourier basis functions are evaluated…

For any field k and any integers m,n with 0 <= 2m <= n+1, let W_n be the k-vector space of sequences (x_0,...,x_n), and let H_m be the subset of W_n consisting of the sequences that satisfy a degree-m linear recursion, that is, for which…

Let $K$ be a totally real number field of degree $n \geq 2$. The inverse different of $K$ gives rise to a lattice in $\mathbb{R}^n$. We prove that the space of Schwartz Fourier eigenfunctions on $\mathbb{R}^n$ which vanish on the…

A classical result of Kaufman states that, for each $\tau>1,$ the set of well approximable numbers \[ E(\tau)=\{x\in\mathbb{R}: \|qx\| < |q|^{-\tau} \text{ for infinitely many integers q}\} \] is a Salem set with Hausdorff dimension…

A classical result in combinatorial number theory states that the largest subset of $[n]$ avoiding a solution to the equation $x+y=z$ is of size $\lceil n/2 \rceil$. For all integers $k>m$, we prove multicolored extensions of this result…

Marstrand's celebrated projection theorem gives the Hausdorff dimension of the orthogonal projection of a Borel set in Euclidean space for almost all orthogonal projections. It is straightforward to see that sets for which the Fourier and…

We introduce and study the \emph{Fourier spectrum} which is a continuously parametrised family of dimensions living between the Fourier dimension and the Hausdorff dimension for both sets and measures. We establish some fundamental theory…

Ordinary Deep Learning models require having the dimension of their outputs determined by a human practitioner prior to training and operation. For design tasks, this places a hard limit on the maximum complexity of any designs produced by…

Let R be a commutative Noetherian ring of dimension d and B=R[X_1,\ldots,X_m,Y_1^{\pm 1},\ldots,Y_n^{\pm 1}] a Laurent polynomial ring over R. If A=B[Y,f^{-1}] for some f\in R[Y], then we prove the following results: (i) If f is a monic…

Let (G, V) be a prehomogeneous vector space, let O be any G(F_q)-invariant subset of V(F_q), and let f be the characteristic function of O. In this paper we develop a method for explicitly and efficiently evaluating the Fourier transform of…