Let A be a set of k integers. We study Freiman’s inverse problem with small doublings and continue the work of G. A. Freiman, I. Bardaji and D. J. Grynkiewicz by characterizing the detailed structure of A in Theorem 2.2 below when the sumset A + A contains exactly 3k 3 integers. Besides some familiar structures, such a set A can have a configuration composed of “additively minimal triangles.
展开▼
机译:让A成为一组K整数。通过在SUMET a + A恰好包含3K 3整数时,我们研究Freiman的逆问题,并继续使用G. A. Freiman,I. Bardaji和D.J.Grynkiewicz的工作。除了一些熟悉的结构之外,这种组A可以具有由“加容量最小三角形的配置。
展开▼