Fourier dimension and avoidance of linear patterns

DOI10.1016/J.AIM.2022.108252MaRDI QIDQ2118908zbMATH OpenOpenAlexFDO

Authors Malabika Pramanik, Yiyu Liang

Publication date 23 March 2022

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.10941

zbMATH Keywords

Salem setFourier dimension

Mathematics Subject Classification ID

Hausdorff and packing measures (28A78) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Trigonometric series of special types (positive coefficients, monotonic coefficients, etc.) (42A32)

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 �egin{equation} sum_{i=1}^v m_ix_i=m_0x_0, ; ext{ with } (m_0, m_1, cdots, m_v) in mathbb N^{v+1}, m_0 = sum_{i=1}^{v} m_i ext{ and } v geq 2, label{rational-eqn} end{equation} we find a Salem set $Esubseteq[0,1]$ of dimension 1 that contains no nontrivial solution of any of these equations; in other words, there does not exist a vector $(x_0,x_1,cdots,x_v)in{E}^{v+1}$ 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 collection of linear equations to be avoided is uncountable or has irrational coefficients. While such constructions seem to suggest that Salem sets can avoid many configurations, our second type of results offers a counterpoint. We show that a set in $mathbbR$ whose Fourier dimension exceeds $2/(v+1)$ cannot avoid nontrivial solutions of all equations of the above form. In particular, a set of positive Fourier dimension must contain a nontrivial linear pattern of the above form for some $v$, and hence cannot be rationally independent. This is in stark contrast with known results cite{M17} that ensure the existence of rationally independent sets of full Hausdorff dimension. The latter class of results may be viewed as quantitative evidence of the structural richness of Salem sets of positive dimension, even if the dimension is arbitrarily small.

Recommendations

• Large sets avoiding linear patterns
• Large sets avoiding patterns
• Salem sets with no arithmetic progressions
• Improved bounds on the dimensions of sets that avoid approximate arithmetic progressions
• Explicit Salem sets and applications to metrical Diophantine approximation

Cites work

• scientific article; zbMATH DE number 44693 (Why is no real title available?)
• scientific article; zbMATH DE number 739280 (Why is no real title available?)
• scientific article; zbMATH DE number 3255239 (Why is no real title available?)
• scientific article; zbMATH DE number 3255240 (Why is no real title available?)
• A Hausdorff measure version of the Jarník–Schmidt theorem in Diophantine approximation
• A \(1\)-dimensional subset of the reals that intersects each of its translates in at most a single point
• A group-theoretic viewpoint on Erdös-Falconer problems and the Mattila integral
• Arithmetic progressions in sets of fractional dimension
• Construction of one-dimensional subsets of the reals not containing similar copies of given patterns
• Convolution Powers of Salem Measures With Applications
• Explicit Salem sets and applications to metrical Diophantine approximation
• Explicit Salem sets in \(\mathbb{R}^2\)
• Finite chains inside thin subsets of \(\mathbb{R}^d\)
• Finite configurations in sparse sets
• Fourier dimension of random images
• Fourier transforms of measures and algebraic relations on their supports
• Full dimensional sets without given patterns
• How large dimension guarantees a given angle?
• Irregularities of sequences relative to arithmetic progressions. IV
• Large Sets Avoiding Rough Patterns
• Large sets avoiding patterns
• Measures on independent sets, a quantitative version of Rudin’s theorem
• On Certain Sets of Integers
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On a theorem of Kaufman: Cantor-type construction of linear fractal Salem sets
• On necklaces inside thin subsets of \(\mathbb{R}^d\)
• On polynomial configurations in fractal sets
• On sets of integers containing k elements in arithmetic progression
• On sets of integers containing no four elements in arithmetic progression
• On singular monotonic functions whose spectrum has a given Hausdorff dimension
• On the theorem of Jarník and Besicovitch
• On triangles determined by subsets of the Euclidean plane, the associated bilinear operators and applications to discrete geometry
• Random recursive construction of Salem sets
• Salem sets with no arithmetic progressions
• Sets of Fractional Dimensions (IV): On Rational Approximation to Real Numbers
• Sets of Fractional Dimensions which Occur in Some Problems of Number Theory
• Sets of Salem type and sharpness of the \(L^2\)-Fourier restriction theorem
• Sets of large dimension not containing polynomial configurations
• Solving a linear equation in a set of integers I
• Solving a linear equation in a set of integers II
• Spatially independent martingales, intersections, and applications
• The Hausdorff dimension of systems of linear forms

Cited in

(2)

• Large sets avoiding linear patterns
• Salem sets with no arithmetic progressions

This page was built for publication: Fourier dimension and avoidance of linear patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118908)