The semigroup of combinatorial configurations
From MaRDI portal
Publication:415531
DOI10.1007/S00233-011-9343-5zbMATH Open1293.05030arXiv0907.4230OpenAlexW2077806010WikidataQ57728687 ScholiaQ57728687MaRDI QIDQ415531FDOQ415531
Authors: Maria Bras-Amorós, Klara Stokes 
Publication date: 8 May 2012
Published in: Semigroup Forum (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0907.4230
Recommendations
- Patterns in semigroups associated with combinatorial configurations
- Linear, non-homogeneous, symmetric patterns and prime power generators in numerical semigroups associated to combinatorial configurations.
- Associating a numerical semigroup to the triangle-free configurations
- Strongly regular configurations
- Semi-Pappus configurations; combinatorial generalizations of the Pappus configuration
Cites Work
- Classification algorithms for codes and designs
- Numerical semigroups.
- Configurations of points and lines
- Title not available (Why is that?)
- There exists no symmetric configuration with 33 points and line size 6
- Regular Graphs with Given Girth and Restricted Circuits
- Counting symmetric configurations \(v_3\)
- Nonsymmetric configurations with natural index
- Existence and enumeration of configurations
Cited In (20)
- Patterns in semigroups associated with combinatorial configurations
- PIR codes from combinatorial structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Digital semigroups
- Bracelet monoids and numerical semigroups
- Patterns of ideals of numerical semigroups
- Existence and enumeration of configurations
- Sets of positive integers closed under product and the number of decimal digits
- Associating a numerical semigroup to the triangle-free configurations
- Numerical semigroups in a problem about economic incentives for consumers
- Nearly-Regular Hypergraphs and Saturation of Berge Stars
- Variations on Ramsey numbers and minimum numbers of monochromatic triangles in line $2$-colorings of configurations
- Title not available (Why is that?)
- Nonhomogeneous patterns on numerical semigroups.
- Binomial semigroups
- Linear, non-homogeneous, symmetric patterns and prime power generators in numerical semigroups associated to combinatorial configurations.
- Numerical semigroups in a problem about cost-effective transport
- Exploring the rigidity of planar configurations of points and rods
- Semispaces of configurations, cell complexes of arrangements
This page was built for publication: The semigroup of combinatorial configurations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415531)
