Skip to main content

Plünnecke’s Inequality for Different Summands

  • Chapter
Building Bridges

Part of the book series: Bolyai Society Mathematical Studies ((BSMS,volume 19))

Abstract

The aim of this paper is to prove a general version of Plünnecke’s inequality. Namely, assume that for finite sets A, B 1 ,…,B k we have information on the size of the sumsets A+Bi 1+…+Bi l for all choices of indices i 1,…,i l . Then we prove the existence of a non-empty subset X of A such that we have good control’ over the size of the sumset X+B 1+…+B k . As an application of this result we generalize an inequality of [1] concerning the submultiplicativity of cardinalities of sumsets.

Supported by Hungarian National Foundation for Scientific Research (OTKA), Grants No. T 43631, T 43623, T 49693.

Supported by Hungarian National Foundation for Scientific Research (OTKA), Grants No. PF-64061, T-049301, T-047276

Supported by Hungarian National Foundation for Scientific Research (OTKA), Grants No. T 43623, T 42750, K 61908.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Gyarmati, M. Matolcsi and I. Z. Ruzsa, A superadditivity and submultiplicativity property for cardinalities of sumsets, Combinatorica, to appear (also arXiv:0707.2707v1).

    Google Scholar 

  2. J. L. Malouf, On a theorem of Plünnecke concerning the sum of a basis and a set of positive density, J. Number Theory, 54.

    Google Scholar 

  3. M. B. Nathanson, Additive number theory: Inverse problems and the geometry of sumsets, Springer, 1996.

    Google Scholar 

  4. H. Plünnecke, Eine zahlentheoretische Anwendung der Graphtheorie, J. Reine Angew. Math., 243 (1970), 171–183.

    MATH  MathSciNet  Google Scholar 

  5. I. Z. Ruzsa, An application of graph theory to additive number theory, Scientia, Ser. A, 3 (1989), 97–109.

    MATH  MathSciNet  Google Scholar 

  6. I. Z. Ruzsa, Addendum to: An application of graph theory to additive number theory, Scientia, Ser. A, 4 (1990/91), 93–94.

    Google Scholar 

  7. T. Tao and V. H. Vu, Additive combinatorics, Cambridge University Press, Cambridge, 2006.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 János Bolyai Mathematical Society and Springer-Verlag

About this chapter

Cite this chapter

Gyarmati, K., Matolcsi, M., Ruzsa, I.Z. (2008). Plünnecke’s Inequality for Different Summands. In: Grötschel, M., Katona, G.O.H., Sági, G. (eds) Building Bridges. Bolyai Society Mathematical Studies, vol 19. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85221-6_10

Download citation

Publish with us

Policies and ethics