Skip to main content
Log in

The semigroup of combinatorial configurations

  • SHORT NOTE
  • Published:
Semigroup Forum Aims and scope Submit manuscript

Abstract

We elaborate on the existence and construction of the so-called combinatorial configurations. The main result is that for fixed degrees the existence of such configurations is given by a numerical semigroup. The proof is constructive giving a method to obtain combinatorial configurations with parameters large enough.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abel, R.J.R., Colbourn, C.J., Dinitz, J.H.: Mutually orthogonal Latin squares (MOLS). In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn., pp. 160–193. Chapman & Hall/CRC Press, London/Boca Raton (2007). Kenneth H. Rosen

    Google Scholar 

  2. Betten, A., Brinkmann, G., Pisanski, T.: Counting symmetric configurations v 3. In: Proceedings of the 5th Twente Workshop on Graphs and Combinatorial Optimization, Enschede, 1997, vol. 99, pp. 331–338 (2000)

    Google Scholar 

  3. De Clerck, F., Thas, J.A., Van Maldeghem, H.: Generalized Polygons and Semipartial Geometries (1996). EIDMA minicourse

    Google Scholar 

  4. Domingo-Ferrer, J., Bras-Amorós, M., Wu, Q., Manjón, J.: User-private information retrieval based on a peer-to-peer community. Data Knowl. Eng. 68(11), 1237–1252 (2009)

    Article  Google Scholar 

  5. Gropp, H.: Non-symmetric configurations with deficiencies 1 and 2. Ann. Discrete Math. 52, 227–239 (1992)

    Article  MathSciNet  Google Scholar 

  6. Gropp, H.: Nonsymmetric configurations with natural index. Discrete Math. 124(1–3), 87–98 (1994) Graphs and combinatorics (Qawra, 1990)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gropp, H.: Existence and enumeration of configurations. Bayreuth. Math. Schr., 74, 123–129 (2005)

    MathSciNet  MATH  Google Scholar 

  8. Gropp, H.: Configurations. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn., pp. 353–355. Chapman & Hall/CRC Press, London/Boca Raton (2007). Kenneth H. Rosen

    Google Scholar 

  9. Grünbaum, B.: Configurations of Points and Lines. Graduate Studies in Mathematics, vol. 103. Am. Math. Soc., Providence (2009)

    MATH  Google Scholar 

  10. Kaski, P., Östergård, P.R.J.: Classification Algorithms for Codes and Designs. Algorithms and Computation in Mathematics, vol. 15. Springer, Berlin (2006). With 1 DVD-ROM (Windows, Macintosh and UNIX)

    MATH  Google Scholar 

  11. Kaski, P., Östergård, P.R.J.: There exists no symmetric configuration with 33 points and line size 6. Australas. J. Combin. 38, 273–277 (2007)

    MathSciNet  MATH  Google Scholar 

  12. Rosales, J.C., García-Sánchez, P.A.: Numerical Semigroups. Developments in Mathematics, vol. 20. Springer, New York (2009)

    Book  MATH  Google Scholar 

  13. Sachs, H.: Regular graphs with given girth and restricted circuits. J. Lond. Math. Soc. 38, 423–429 (1963)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maria Bras-Amorós.

Additional information

Communicated by Jorge Almeida.

This work was partly supported by the Spanish Government through projects TIN2009-11689 “RIPUP'' and CONSOLIDER INGENIO 2010 CSD2007-00004 “ARES'', and by the Government of Catalonia under grant 2009 SGR 1135.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bras-Amorós, M., Stokes, K. The semigroup of combinatorial configurations. Semigroup Forum 84, 91–96 (2012). https://doi.org/10.1007/s00233-011-9343-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00233-011-9343-5

Keywords

Navigation