Query complexity and the polynomial Freiman-Ruzsa conjecture

DOI10.1016/j.aim.2021.108043OpenAlexW3203995226WikidataQ113881007 ScholiaQ113881007MaRDI QIDQ2237416

Dömötör Pálvölgyi, Dmitrii Zhelezov

Publication date: 27 October 2021

Published in: Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

sumsetssum-productpolynomial Freiman-Ruzsa

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (2)

Higher convexity and iterated sum sets ⋮ An analytic approach to cardinalities of sumsets

Cites Work

• Unnamed Item
• Unnamed Item
• On sum sets of sets having small product set
• Some consequences of the polynomial Freiman-Ruzsa conjecture
• The Erdős-Szemerédi problem on sum set and product set
• On the Bogolyubov-Ruzsa lemma
• An analytic approach to cardinalities of sumsets
• On the few products, many sums problem
• Sum-product theorems in algebraic number fields
• On the size of $k$-fold sum and product sets of integers
• An update on the sum-product problem
• Few sums, many products
• A Weighted Prékopa–Leindler Inequality and Sumsets with Quasicubes

This page was built for publication: Query complexity and the polynomial Freiman-Ruzsa conjecture