pith. sign in

arxiv: 0907.4230 · v3 · pith:JMWMWTPWnew · submitted 2009-07-24 · 💻 cs.DM

The Semigroup of Combinatorial Configurations

classification 💻 cs.DM
keywords combinatorialsemigrouptuplesconfigurableconfigurationconfigurationsnumericalvertices
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.