Abstract: The well--known Freiman--Ruzsa Theorem provides a structural description of a set of integers with as a subset of a --dimensional arithmetic progression with , where and depend only on . The estimation of the constants and involved in the statement has been the object of intense research. Freiman conjectured in 2008 a formula for the largest volume of such a set. In this paper we prove the conjecture for a general class of sets called chains.
Recommendations
Cites work
Cited in
(3)
This page was built for publication: On doubling and volume: chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963290)