نتایج جستجو برای: 3 k

تعداد نتایج: 2093019  

2015
Renling Jin

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.”

Journal: :Discrete Mathematics 2000

Journal: :Topology and its Applications 2014

Journal: :Hyperfine Interactions 1996

Journal: :Pure and Applied Mathematics Quarterly 2018

Journal: :Transactions of the American Mathematical Society 1986

Journal: :Journal of Topology and Analysis 2019

Journal: :Journal of Combinatorial Theory, Series B 2013

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید