Skip to main content
×
Home
    • Aa
    • Aa

Plünnecke's Inequality

  • GIORGIS PETRIDIS (a1)
Abstract

Plünnecke's inequality is a standard tool for obtaining estimates on the cardinality of sumsets and has many applications in additive combinatorics. We present a new proof. The main novelty is that the proof is completed with no reference to Menger's theorem or Cartesian products of graphs. We also investigate the sharpness of the inequality and show that it can be sharp for arbitrarily long, but not for infinite commutative graphs. A key step in our investigation is the construction of arbitrarily long regular commutative graphs. Lastly we prove a necessary condition for the inequality to be attained.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[2] J. L. Malouf (1995) On a theorem of Plünnecke concerning the sum of a basis and a set of positive density. J. Number Theory 54 1222.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 8 *
Loading metrics...

Abstract views

Total abstract views: 79 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 24th September 2017. This data will be updated every 24 hours.