The Semigroup of Combinatorial Configurations

Details The Semigroup of Combinatorial Configurations The Semigroup of Combinatorial Configurations

2009-07-24

arxiv.org/abs/0907.4230v3

Computer Science

Discrete Mathematics

Title changed, article shortened

Scientific paper

A (v,b,r,k) combinatorial configuration is a (r,k)-biregular bipartite graph with v vertices on the left and b vertices on the right and with no cycle of length 4. Combinatorial configurations have become very important for some cryptographic applications to sensor networks and to peer-to-peer communities. Configurable tuples are those tuples (v,b,r,k) for which a (v,b,r,k) combinatorial configuration exists. It is proved in this work that the set of configurable tuples with fixed r and k has the structure of a numerical semigroup. The numerical semigroup is completely described for r=2 and r=3.

Affiliated with

Also associated with

No associations

Rating

The Semigroup of Combinatorial Configurations 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 The Semigroup of Combinatorial Configurations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Semigroup of Combinatorial Configurations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-309312