Abstract: We investigate the structure of finite sets where is large. We present a combinatorial construction that serves as a counterexample to natural conjectures in the pursuit of an "anti-Freiman" theory in additive combinatorics. In particular, we answer a question along these lines posed by O'Bryant. Our construction also answers several questions about the nature of finite unions of and sets, and enables us to construct a set which does not contain large or sets.
Recommendations
Cites work
- scientific article; zbMATH DE number 3425719 (Why is no real title available?)
- scientific article; zbMATH DE number 3148545 (Why is no real title available?)
- scientific article; zbMATH DE number 4200287 (Why is no real title available?)
- scientific article; zbMATH DE number 5652361 (Why is no real title available?)
- scientific article; zbMATH DE number 3897012 (Why is no real title available?)
- scientific article; zbMATH DE number 3734512 (Why is no real title available?)
- scientific article; zbMATH DE number 3784967 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- A complete annotated bibliography of work related to Sidon sequences
- An application of graph theory to additive number theory
- Bounded orthogonal systems and the \(\Lambda\) (p)-set problem
- Endomorphismes des idéaux fermés de $L^1,(G)$, classes de Hardy et séries de Fourier lacunaires
- Examples of Λ(4) sets E and a graph structure in E x E
- Some applications of Ramsey's theorem to additive number theory
- Topics in Harmonic Analysis Related to the Littlewood-Paley Theory. (AM-63)
- Two Proofs in Combinatorial Number Theory
- \(\Lambda_p\)-sets in analysis: Results, problems and related aspects
This page was built for publication: On the structure of sets of large doubling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q641544)