Skip to main content
Log in

3-Nets realizing a diassociative loop in a projective plane

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

A 3-net of order n is a finite incidence structure consisting of points and three pairwise disjoint classes of lines, each of size n, such that every point incident with two lines from distinct classes is incident with exactly one line from each of the three classes. The current interest around 3-nets (embedded) in a projective plane \(\mathrm{PG}(2,\mathbb {K})\), defined over a field \(\mathbb {K}\) of characteristic p, arose from algebraic geometry; see Falk and Yuzvinsky (Compos Math 143:1069–1088, 2007), Miguel and Buzunáriz (Graphs Comb 25:469–488, 2009), Pereira and Yuzvinsky (Adv Math 219:672–688, 2008), Yuzvinsky (140:1614–1624, 2004), and Yuzvinsky (137:1641–1648, 2009). It is not difficult to find 3-nets in \(\mathrm{PG}(2,\mathbb {K})\) as far as \(0<p\le n\). However, only a few infinite families of 3-nets in \(PG(2,\mathbb {K})\) are known to exist whenever \(p=0\), or \(p>n\). Under this condition, the known families are characterized as the only 3-nets in \(\mathrm{PG}(2,\mathbb {K})\) which can be coordinatized by a group; see Korchmáros et al. (J Algebr Comb 39:939–966, 2014). In this paper we deal with 3-nets in \(PG(2,\mathbb {K})\) which can be coordinatized by a diassociative loop G but not by a group. We prove two structural theorems on G. As a corollary, if G is commutative then every non-trivial element of G has the same order, and G has exponent 2 or 3 where the exponent of a finite diassociative loop is the maximum of the orders of its elements. We also discuss the existence problem for such 3-nets.

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.

Similar content being viewed by others

References

  1. Barlotti A., Strambach K.: The geometry of binary systems. Adv. Math. 72, 1–58 (1988).

  2. Blokhuis A., Korchmáros G., Mazzocca F.: On the structure of 3-net embedded in a projective plane. J. Comb. Theory Ser. A 118, 1228–1238 (2011).

  3. Bogya N., Korchmáros G., Nagy G.P.: Classification of \(k\)-nets. Eur. J. Comb. 48, 177–185 (2015).

  4. Bruck R.H.: A survey of binary systems, Ergebnisse der Mathematik und ihrer Grenzgebiete. Neue Folge, Heft 20. Reihe: Gruppentheorie. Springer, Berlin (1958).

  5. Falk M., Yuzvinsky S.: Multinets, resonance varieties, and pencils of plane curves. Compos. Math. 143, 1069–1088 (2007).

  6. Gagola III S.M.: When are inner mapping groups generated by conjugation maps? Arch. Math. (Basel) 101, 207–212 (2013).

  7. Glauberman G., Wright C.R.B.: Nilpotence of finite Moufang 2-loops. J. Algebra 8, 415–417 (1968).

  8. Goodaire E.G., May S., Raman M.: The Moufang Loops of Order Less Than \(64\). Nova Science Publishers, Hauppauge (1999).

  9. Kinyon M.K., Kunen K., Phillips J.D.: A generalization of Moufang and Steiner loops. Algebra Univers. 48, 81–101 (2002).

  10. Korchmáros G., Nagy G.P., Pace N.: 3-Nets realizing a group in a projective plane. J. Algebr. Comb. 39, 939–966 (2014).

  11. Korchmáros G., Nagy G.P., Pace N.: \(k\)-Nets embedded in a projective plane over a field. Combinatorica 35, 63–74 (2015).

  12. Miguel Á., Buzunáriz M.: A description of the resonance variety of a line combinatorics via combinatorial pencils. Graphs Comb. 25, 469–488 (2009).

  13. Nagy G., Pace N.: Some computational results on small 3-nets embedded in a projective plane over a field. J. Comb. Theory Ser. A 120, 1632–1641 (2013).

  14. Pereira J.V., Yuzvinsky S.: Completely reducible hypersurfaces in a pencil. Adv. Math. 219, 672–688 (2008).

  15. Stipins J.: Old and new examples of \(k\)-nets in \(\mathbb{P}^2\). arXiv:1104.4439v1

  16. Urzúa G.: On line arrangements with applications to 3-nets. Adv. Geom. 10, 287–310 (2010).

  17. Yuzvinsky S.: Realization of finite abelian groups by nets in \(\mathbb{P}^2\). Compos. Math. 140, 1614–1624 (2004).

  18. Yuzvinsky S.: A new bound on the number of special fibers in a pencil of curves. Proc. Am. Math. Soc. 137, 1641–1648 (2009).

Download references

Acknowledgments

The work has been carried out within the Project PRIN (MIUR, Italy) and GNSAGA. The publication is supported by the European Union and co-funded by the European Social Fund. Project title: Telemedicine-focused research activities on the field of Mathematics, Informatics and Medical sciences. Project Number: TAMOP-4.2.2.A-11/1/KONV-2012-0073.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gábor Korchmáros.

Additional information

Research carried out within the activity of GNSAGA and PRIN.

This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Finite Geometries”.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Korchmáros, G., Nagy, G.P. 3-Nets realizing a diassociative loop in a projective plane. Des. Codes Cryptogr. 79, 443–449 (2016). https://doi.org/10.1007/s10623-016-0176-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-016-0176-9

Keywords

Mathematics Subject Classification

Navigation