Maximal Sidon Sets and Matroids

Details Maximal Sidon Sets and Matroids Maximal Sidon Sets and Matroids

2005-04-11

arxiv.org/abs/math/0504226v1

Mathematics

Number Theory

9 pages

Scientific paper

Let X be a subset of an abelian group and a_1,...,a_h,a'_1,...,a'_h a sequence of 2h elements of X such that a_1 + ... + a_h = a'_1 + ... + a'_h. The set X is a Sidon set of order h if, after renumbering, a_i = a'_i for i = 1,..., h. For k \leq h, the set X is a generalized Sidon set of order (h,k), if, after renumbering, a_i = a'_i for i = 1,..., k. It is proved that if X is a generalized Sidon set of order (2h-1,h-1), then the maximal Sidon sets of order h contained in X have the same cardinality. Moreover, X is a matroid where the independent subsets of X are the Sidon sets of order h.

Affiliated with

Also associated with

No associations

Rating

Maximal Sidon Sets and Matroids 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 Maximal Sidon Sets and Matroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximal Sidon Sets and Matroids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-21491