An Algorithm for Constructing Hjelmslev Planes

  • Conference paper
Algebraic Design Theory and Hadamard Matrices

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 133))

Abstract

Projective Hjelmslev planes and affine Hjelmslev planes are generalisations of projective planes and affine planes. We present an algorithm for constructing projective Hjelmslev planes and affine Hjelmslev planes that uses projective planes, affine planes and orthogonal arrays. We show that all 2-uniform projective Hjelmslev planes and all 2-uniform affine Hjelmslev planes can be constructed in this way. As a corollary it is shown that all 2-uniform affine Hjelmslev planes are sub-geometries of 2-uniform projective Hjelmslev planes.

This paper is in final form and no similar paper has been or is being submitted elsewhere.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (Spain)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 85.59
Price includes VAT (Spain)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 103.99
Price includes VAT (Spain)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book
EUR 103.99
Price includes VAT (Spain)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Bacon, P.Y.: On the extension of projectively uniform affine Hjelmslev planes. Abh. Math. Sem. Hamburg 41(1), 185–189 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bailey, R., Cameron, P.J., Dobcsányi, P., Morgan, J.P., Soicher, L.H.: DesignTheory.org. U.K. Engineering and Physical Sciences Research Council (Updated 2012). designtheory.org

    Google Scholar 

  3. Beth, T., Jungnickel, D., Lenz, H.: Design Theory, vol. 69. Cambridge University Press, Cambridge (1999)

    Book  Google Scholar 

  4. Colbourn, C.J., Dinitz, J.H.: Handbook of Combinatorial Designs. CRC Press, Boca Raton (2010)

    Google Scholar 

  5. Craig, R.T.: Extensions of finite projective planes. I. Uniform Hjelmslev planes. Can. J. Math 16, 261–266 (1964)

    MathSciNet  MATH  Google Scholar 

  6. Dembowski, P.: Finite Geometries. Classics in Mathematics, vol. 44. Springer, Berlin (1996)

    Google Scholar 

  7. Drake, D.A.: On n- uniform Hjelmslev planes. J. Comb. Theory 9(3), 267–288 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  8. Drake, D.A.: Nonexistence results for finite Hjelmslev planes. Abh. Math. Sem. Hamburg, 40(1), 100–110 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  9. Drake, D.A., Shult, E.E.: Construction of Hjelmslev planes from (t, k)-nets. Geom. Dedicata 5(3), 377–392 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hanssens, G., Van Maldeghem, H.: A universal construction for projective Hjelmslev planes of level n. Compos. Math. 71(3), 285–294 (1989)

    Google Scholar 

  11. Hjelmslev, J.: Die Geometrie der Wirklichkeit. Acta Math. 40(1), 35–66 (1916)

    Article  MathSciNet  Google Scholar 

  12. Honold, T., Kiermaier, M.: The existence of maximal (q 2, 2)-arcs in projective Hjelmslev planes over chain rings of length 2 and odd prime characteristic. Design Code Cryptogr. 68(1-3), 105–126 (2013)

    Google Scholar 

  13. Honold, T., Landjev, I.: On arcs in projective Hjelmslev planes. Discret. Math. 231(1), 265–278 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  14. Honold, T., Landjev, I.: Non-free extensions of the simplex codes over a chain ring with four elements. Design Code Crypt. 66(1–3), 27–38 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kiermaier, M., Koch, M., Kurz, S.: 2-arcs of maximal size in the affine and the projective Hjelmslev plane over Z 25. Adv. Math. Commun. 5(2), 287–301 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kiermaier, M., Zwanzger, J.: New ring-linear codes from dualization in projective Hjelmslev geometries. Design. Code. Crypt. 66(1–3), 39–55 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kleinfeld, E. : Finite Hjelmslev planes. Illinois J. Math. 3(3), 403–407 (1959)

    MathSciNet  MATH  Google Scholar 

  18. Klingenberg, W.: Projektive und affine Ebenen mit Nachbarelementen. Math. Z. 60(1), 384–406 (1954)

    Article  MathSciNet  MATH  Google Scholar 

  19. Saniga, M., Planat, M.: Hjelmslev geometry of mutually unbiased bases. J. Phys. A Math. Gen. 39(2), 435 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  20. Sloane., N.J.A.: A library of orthogonal arrays. http://neilsloane.com/oadir/

  21. Veldkamp, F.D.: Geometry over rings. In: Buekenhout, F. (ed.) Handbook of Incidence Geometry, pp. 1033–1084. Elsevier, Amsterdam (1995)

    Chapter  Google Scholar 

Download references

Acknowledgements

Thanks to Jesse Waechter-Cornwill for the coding and visualisation of Algorithm 4.1. Thanks are due to Cathy Baker for highlighting reference [10].

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Asha Rao .

Editor information

Editors and Affiliations

Additional information

Dedicated to Hadi Kharaghani on the occasion on his 70th birthday

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Hall, J.L., Rao, A. (2015). An Algorithm for Constructing Hjelmslev Planes. In: Colbourn, C. (eds) Algebraic Design Theory and Hadamard Matrices. Springer Proceedings in Mathematics & Statistics, vol 133. Springer, Cham. https://doi.org/10.1007/978-3-319-17729-8_11

Download citation

Publish with us

Policies and ethics

Navigation