Skip to main content
Log in

N-graphs, Modular Sidon and Sum-Free Sets, and Partition Identities

  • Published:
The Ramanujan Journal Aims and scope Submit manuscript

Abstract

Using a new graphical representation for partitions, the author obtains a family of partition identities associated with partitions into distinct parts of an arithmetic progression, or, more generally, with partitions into distinct parts of a set that is a finite union of arithmetic progressions associated with a modular sum-free Sidon set. Partition identities are also constructed for sets associated with modular sum-free sets.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. K. Alladi, “A variation on a theme of Sylvester-a smoother road to Göllnitz' theorem,” Discrete Math. 196 (1999) 1–11.

    Google Scholar 

  2. P.A. MacMahon, “The theory of modular partitions,” Proc. Cambridge Philos. Soc. 21 (1923) 197–204; reprinted in P.A. MacMahon, Collected Papers, Vol. I, MIT Press, Cambridge, 1978, pp. 1090-1097.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nathanson, M.B. N-graphs, Modular Sidon and Sum-Free Sets, and Partition Identities. The Ramanujan Journal 4, 59–67 (2000). https://doi.org/10.1023/A:1009830023023

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009830023023

Navigation