Fourier dimension and avoidance of linear patterns
Yiyu Liang, Malabika Pramanik

TL;DR
This paper constructs large Fourier dimension sets avoiding certain linear solutions and shows that sets with sufficiently high Fourier dimension must contain such solutions, highlighting a contrast between Salem sets and rational independence.
Contribution
It introduces constructions of Salem sets avoiding specific linear equations and establishes lower bounds on Fourier dimension necessary to contain solutions.
Findings
Salem sets of dimension 1 can avoid solutions to certain linear equations.
Sets with Fourier dimension > 2/(v+1) must contain solutions to these equations.
Positive Fourier dimension sets cannot be rationally independent.
Abstract
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 translation-invariant linear equations of the form \begin{equation} \sum_{i=1}^v m_ix_i=m_0x_0, \; \text{ with } (m_0, m_1, \cdots, m_v) \in \mathbb N^{v+1}, m_0 = \sum_{i=1}^{v} m_i \text{ and } v \geq 2, \label{rational-eqn} \end{equation} we find a Salem set of dimension 1 that contains no nontrivial solution of any of these equations; in other words, there does not exist a vector with distinct entries that satisfies any of the given equations. Variants of this construction can also be used to obtain Salem sets that avoid solutions of translation-invariant linear equations of other kinds, for instance, when the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Advanced Topology and Set Theory · semigroups and automata theory
