N-graphs, modular Sidon and sum-free sets, and partition identities

Simple item page
dc.creatorNathanson, Melvyn B.
dc.date2000-02-21
dc.date2000-02-22
dc.date.accessioned2026-07-07T04:33:59Z
dc.date.available2026-07-07T04:33:59Z
dc.descriptionUsing 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.
dc.description9 pages. To appear in The Ramanujan Journal
dc.identifierhttps://arxiv.org/abs/math/0002173
dc.identifierhttp://arxiv.org/abs/math/0002173
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/58736
dc.subjectNumber Theory
dc.subjectCombinatorics
dc.subjectPrimary 11P81, 11P83. Secondary 11B05, 11B25, 11B75
dc.titleN-graphs, modular Sidon and sum-free sets, and partition identities
dc.typetext

Files

Collections

arXiv