Large Sets Avoiding Rough Patterns

DOI10.1007/978-3-030-61887-2_4OpenAlexW2927683184MaRDI QIDQ3384128

Jacob Denson, Joshua Zahl, Malabika Pramanik

Publication date: 14 December 2021

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computer science (68-XX) Number theory (11-XX)

Related Items (4)

Density theorems for anisotropic point configurations ⋮ Large subsets of Euclidean space avoiding infinite arithmetic progressions ⋮ Unnamed Item ⋮ Fourier dimension and avoidance of linear patterns

Cites Work

• Unnamed Item
• Full dimensional sets without given patterns
• On a problem of Erdős on fractal combinatorial geometry
• Large sets avoiding patterns
• Sets of large dimension not containing polynomial configurations
• A \(1\)-dimensional subset of the reals that intersects each of its translates in at most a single point
• Some connections between Falconer's distance set conjecture and sets of Furstenburg type

This page was built for publication: Large Sets Avoiding Rough Patterns