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

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

2000-02-21

arxiv.org/abs/math/0002173v2

Mathematics

Number Theory

9 pages. To appear in The Ramanujan Journal

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

N-graphs, modular Sidon and sum-free sets, and partition identities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with N-graphs, modular Sidon and sum-free sets, and partition identities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and N-graphs, modular Sidon and sum-free sets, and partition identities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-504715