Some results in additive number theory I: The critical pair theory (Q4522889)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1548768
Language Label Description Also known as
default for all languages
No label defined
    English
    Some results in additive number theory I: The critical pair theory
    scientific article; zbMATH DE number 1548768

      Statements

      Some results in additive number theory I: The critical pair theory (English)
      0 references
      7 January 2001
      0 references
      subset sums
      0 references
      abelian group
      0 references
      cardinality
      0 references
      bounds
      0 references
      Frobenius number
      0 references
      conjecture of Lewin
      0 references
      Let \(U\subset \mathbb N\) be a finite set with \(\text{gcd}(U)=1\) and \(m= \max(U)\), \(n=\min(U).\) The Frobenius number \(G(U)\) is the maximal integer that cannot be expressed as a sum of elements of \(U\). Let \(G\) be an abelian group, \(A\), \(B\) be finite subsets of \(G\), with \(|A|,|B|\geq 2.\) Many authors investigated the cardinality of \(A+B\) in comparison with \(|G|\). In the present paper the author investigates conditions for the validity of the inequality \[ |A+B|\geq \min\{|G|-1,|A|+|B|-1\}. \] As an application, using a new method, the author proves bounds on the Frobenius number. A conjecture of Lewin is proved which states that \[ G(U)\leq \Biggl[{(m-2)(m-n+1)\over n-1}\Biggr]-1 \] if \(m\) is large enough. A large number of results are also discussed.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references