Dimensions of sets avoiding approximate nontrivial zeros of linear patterns

DOI10.1017/S0004972725100336MaRDI QIDQ7262490zbMATH OpenFDO

Authors Zhigang Tian, Lei Shang

Publication date 11 June 2026

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972725100336

zbMATH Keywords

Hausdorff dimensionnontrivial zeros of linear patternstranslation-invariant linear equations

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Hausdorff and packing measures (28A78) Fractals (28A80)

Cites work

• A \(1\)-dimensional subset of the reals that intersects each of its translates in at most a single point
• Arithmetic progressions in sets of fractional dimension
• Construction of one-dimensional subsets of the reals not containing similar copies of given patterns
• Dimensions of sets which uniformly avoid arithmetic progressions
• Finite chains inside thin subsets of \(\mathbb{R}^d\)
• Finite configurations in sparse sets
• Fourier dimension and avoidance of linear patterns
• Full dimensional sets without given patterns
• How large dimension guarantees a given angle?
• Improved bounds on the dimensions of sets that avoid approximate arithmetic progressions
• Large sets avoiding patterns
• Large Sets Avoiding Rough Patterns
• On Certain Sets of Integers
• On sets of integers containing k elements in arithmetic progression
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• Quantitative results using variants of Schmidt's game: dimension bounds, arithmetic progressions, and more
• Salem sets with no arithmetic progressions
• Sets of large dimension not containing polynomial configurations
• Thickness and a Gap Lemma in ℝd

This page was built for publication: Dimensions of sets avoiding approximate nontrivial zeros of linear patterns

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