AI summary · arXiv: 2306.13403v1 · math.NT

Sumsets and entropy revisited

Ben Green, Freddie Manners, Terence Tao

Original paper · DOI Submitted to arXiv on 23 Jun. 2023 37 pages License: CC BY 4.0

How to read this summary? Illustrated guide

The essentials

  • Entropic doubling is a variant of the doubling constant in finite subsets of an abelian group
  • It possesses improved properties such as contraction under homomorphisms
  • The authors provide a new proof for a result on the "skew dimension" of subsets in Z^D with small doubling
  • They offer a new proof, along with an improvement, for a result on the dimension of subsets in Z^D with small doubling
  • They demonstrate that the Polynomial Freiman-Ruzsa conjecture over F_2 implies the weak Polynomial Freiman-Ruzsa conjecture over Z
  • The paper consists of nine sections covering various aspects related to entropic doubling and its applications
  • The sections include topics such as improved entropic Ruzsa triangle inequality, converting random variables to sets, entropy distance under homomorphisms, very small entropy doubling, skew dimension and its connection to Pálvölgyi and Zhelezov's result, dimension and its relation to one author's previous work, an entropy formulation of PFR over F_2 (Polynomial Freiman-Ruzsa conjecture), dimension and the weak PFR conjecture.
  • There is an appendix providing basic facts about entropy.
  • The paper expands upon existing knowledge about entropic doubling and its applications in additive combinatorics.

Key points written by AI: they may contain errors, check them against the paper.

AI-generated keywords: Entropic doubling Skew dimension Polynomial Freiman-Ruzsa conjecture Finite subsets Abelian group

Read further

  • Comprehensive Summary
  • Layman's Summary
  • Blog article
  • Original abstract
In the paper "Sumsets and entropy revisited," authors Ben Green, Freddie Manners, and Terence Tao explore the concept of entropic doubling and its applications. Entropic doubling is a variant of the doubling constant in finite subsets of an abelian group, but it possesses improved properties such as contraction under homomorphisms. The authors develop the theory of entropic doubling further and present various applications. Firstly, they provide a new proof for a result by Pálvölgyi and Zhelezov on the "skew dimension" of subsets in Z^D with small doubling. This result sheds light on the behavior of sets with small doubling in high-dimensional spaces. Secondly, they offer a new proof, along with an improvement, for a result by one of the authors on the dimension of subsets in Z^D with small doubling. This result contributes to understanding the structure and size of sets with restricted additive behavior in integer lattices. Lastly, they demonstrate that the Polynomial Freiman-Ruzsa conjecture over F_2 implies the weak Polynomial Freiman-Ruzsa conjecture over Z. The Polynomial Freiman-Ruzsa conjecture relates to characterizing sets with restricted additive structure in abelian groups. The paper consists of nine sections that delve into different aspects related to entropic doubling. These sections cover topics such as an improved entropic Ruzsa triangle inequality, converting random variables to sets, entropy distance under homomorphisms, very small entropy doubling, skew dimension and its connection to Pálvölgyi and Zhelezov's result, dimension and its relation to one author's previous work, an entropy formulation of PFR over F_2 (Polynomial Freiman-Ruzsa conjecture), dimension and the weak PFR conjecture. Additionally, there is an appendix providing basic facts about entropy. Overall, this paper expands upon existing knowledge about entropic doubling and its applications in the field of additive combinatorics. The authors' results contribute to a deeper understanding of the structure and behavior of sets with restricted additive properties in abelian groups; particularly those found within high-dimensional spaces.

Was this synthesis useful?

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

Ask questions about this paper to our AI assistant

Compare with the PDF

You can also chat with multiple papers at once here.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Tools for this paper

Explain it differently 3 free rewrites left today
Save to a collection Group papers in collections to compare them, chat with them and export them. Create a free account Log in

Advanced tools Premium

For researchers who follow a field closely: citation alerts, journal-club slides, version comparison and Zotero export. Discover Premium

Zotero
Citation alerts
Journal club Premium+ Slides to present it
Talk about it in public Premium+ Press kit: release, questions, hype check

Similar papers summarized with our AI tools

Navigate through even more similar papers through a

tree representation

The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.