Large Sets Avoiding Rough Patterns

DOI10.1007/978-3-030-61887-2_4MaRDI QIDQ3384128zbMATH OpenOpenAlexFDO

Authors Jacob Denson, Malabika Pramanik, J. Zahl

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

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

Cites work

• A \(1\)-dimensional subset of the reals that intersects each of its translates in at most a single point
• Full dimensional sets without given patterns
• scientific article; zbMATH DE number 739280 (Why is no real title available?)
• Large sets avoiding patterns
• On a problem of Erdős on fractal combinatorial geometry
• Sets of large dimension not containing polynomial configurations
• Some connections between Falconer's distance set conjecture and sets of Furstenburg type

Cited in

(10)

• Large sets avoiding patterns
• Fourier dimension and avoidance of linear patterns
• Density theorems for anisotropic point configurations
• Sets of full measure avoiding Cantor sets
• Large subsets of Euclidean space avoiding infinite arithmetic progressions
• Large Sets Avoiding Rough Patterns
• Large sets containing no copies of a given infinite sequence
• Two-point patterns determined by curves
• Arithmetic progressions and thickness properties in self-similar Cantor sets
• Dimensions of sets avoiding approximate nontrivial zeros of linear patterns

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

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