Abstract
In Chapter 1 we defined orthomorphisms and orthogonality of orthomorphisms. As orthogonality is a symmetric relation, we can define and study orthomorphism graphs: graphs whose vertices are orthomorphisms, and in which adjacency implies orthogonality. In this chapter we introduce orthomorphism graphs of groups. We describe the main problems of interest in the study of orthomorphism graphs, and we describe automorphisms and congruences of orthomorphism graphs. We describe some classes of orthomorphism graphs: the orthomorphism graph \(\mathcal {P}(G)\), composed of orthomorphisms of the form x↦xr, orthomorphism graphs derived from difference sets, orthomorphism graphs obtained from automorphisms, and orthomorphism graphs whose vertices are strong complete mappings.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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, Florida (2007)
Afsarinejad, K.: On mutually orthogonal Knut Vik designs. Statist. Probab. Lett. 5, 323–324 (1987)
Anderson, B.A.: Sequencings and houses. Congr. Numer. 43, 23–43 (1984)
Bailey, R.A., Jungnickel, D.: Translation nets and fixed-point-free group automorphisms. J. Combin. Theory Ser. A 55, 1–13 (1990)
Baumert, L.D., Gordon, D.M.: On the existence of cyclic difference sets with small parameters. In: High primes and misdemeanours, pp. 61–68. Amer. Math. Soc., Providence RI (2004)
Beth, T., Jungnickel, D., Lenz, H.: Design Theory, 2nd. edn. Cambridge University Press, Cambridge (1999)
Bruck, R.H.: Difference sets in a finite group. Trans. Amer. Math. Soc. 78, 464–481 (1955)
Bruck, R.H.: Finite nets II, uniqueness and imbedding. Pacific J. Math. 13, 421–457 (1963)
Chang, L.Q., Hsiang, K., Tai, S.: Congruent mappings and congruence classes of orthomorphisms of groups. Acta Math. Sinica 14, 747–756 (1964), Chinese. Translated as: Chinese Math. Acta 6, 141–152 (1965)
Colbourn, C.J., Dinitz, J.H. (eds): Handbook of Combinatorial Designs, 2nd. edn. Chapman & Hall/CRC, Florida (2007)
Drake, D.A.: Maximal sets of Latin squares and partial transversals. J. Statist. Plann. Inference 1, 143–149 (1977)
Erdős, P., Evans, A.B.: Representations of graphs and orthogonal Latin square graphs. J. Graph Theory 13, 593–595 (1989)
Erdős, P., Evans, A.B.: Sets of prime numbers satisfying a divisibility condition. J. Number Theory 61, 39–43 (1996)
Euler, L.: Recherche sur une nouvelle espèce de quarrès magiques. Leonardi Euleri Opera Omnia series 1 7, 291–392 (1923)
Evans, A.B.: Orthomorphism graphs of groups. J. Geom. 35, 66–74 (1989)
Evans, A.B.: On strong complete mappings. Congr. Numer. 70, 241–248 (1990)
Evans, A.B.: Maximal sets of mutually orthogonal Latin squares I. European J. Combin. 12, 477–482 (1991)
Evans, A.B.: The existence of strong complete mappings. Electron. J. Combin. 19, # P34 (2012)
Evans, A.B.: The existence of strong complete mappings of finite groups: a survey. Discrete Math. 313, 1191–1196 (2013)
Evans, A.B., Fricke, G.H., Maneri, C.C., McKee, T.A., Perkel, M.: Representations of graphs modulo n. J. Graph Theory 18, 801–815 (1994)
Evans, A.B., Isaak, G., Narayan, D.A.: Representations of graphs modulo n. Discrete Math. 223, 109–123 (2000)
Evans, A.B., Narayan, D.A.. Urick, J.: Representations of graphs modulo n: Some problems. Bull. Inst. Combin. Appl. 56, 85–97 (2009)
Ganley, M.J., Spence, E.: Relative difference sets and quasiregular collineation groups. J. Combin. Theory Ser. A 19, 134–153 (1975)
Gao, S., Wei, W.: On non-abelian group difference sets. Discrete Math. 112, 93–102 (1993)
Gordon, D.M.: The prime power conjecture is true for n < 2, 000, 000. Electron. J. Combin. 1, R6 (1994)
Gorenstein, D.: Finite groups. Harper & Row, New York (1968)
Hachenberger, D.: Constructions of large translation nets with nonabelian translation groups. Des. Codes Cryptogr. 1, 219–236 (1991)
Hachenberger, D.: On the existence of translation nets. J. Algebra 152, 207–229 (1992)
Hachenberger, D., Jungnickel, D.: Bruck nets with a transitive direction. Geom. Dedicata 36, 287–313 (1990)
Hachenberger, D., Jungnickel, D.: Translation nets: a survey. Discrete Math. 106/107, 231–242 (1992)
Hedayat, A.: A complete solution to the existence and non-existence of Knut Vic designs and orthogonal Knut Vic designs. J. Combin. Theory Ser. A 22, 331–337 (1977)
Hedayat, A., Federer, W.T.: On the non-existence of Knut Vic designs for all even orders. Ann. Statist. 3, 445–447 (1975)
Horton, J.D.: Orthogonal starters in finite abelian groups. Discrete Math. 79, 265–278 (1990)
Hsu, D.F., Keedwell, A.D.: Generalized complete mappings, neofields, sequenceable groups and block designs. II. Pacific J. Math. 117(2), 291–312 (1985)
Huppert, B.: Endliche Gruppen I. Springer, Berlin-Heidelberg-New York (1967)
Johnson, D.M., Dulmage, A.L., Mendelsohn, N.S.: Orthomorphisms of groups and orthogonal Latin squares. I. Canad. J. Math. 13, 356–372 (1961)
Jungnickel, D.: On regular sets of Latin squares. In: Problemes combinatoires et theorie des graphes, pp. 255–256. Colloq. Internat. CNRS 260, Paris (1978)
Jungnickel, D.: On difference matrices and regular Latin squares. Abh. Math. Semin. Univ. Hambg. 50, 219–231 (1980)
Jungnickel, D.: Einige neue Differenzenmatrizen. Mitt. Math. Semin. Giessen 149, 47–57 (1981)
Jungnickel, D.: Existence results for translation nets II. J. Algebra 122, 288–298 (1989)
Jungnickel, D.: Partial spreads over \(\mathbb {Z}_q\). Linear Algebra Appl. 114, 95–102 (1989)
Jungnickel, D., Grams, G.: Maximal difference matrices of order ≤ 10. Discrete Math. 58, 199–203 (1986)
Jungnickel, D., Pott, A.: Computational non-existence results for abelian affine difference sets. Congr. Numer. 68, 91–98 (1989)
Jungnickel, D., Pott, A., Smith K.W.: Difference sets. In: Colbourn, C.J., Dinitz, J.H. (eds) Handbook of Combinatorial Designs, 2nd. edn., pp. 419–435. Chapman & Hall/CRC, Florida (2007)
Klotz, W., Sander, T.: Some properties of unitary Cayley graphs. Electron. J. Combin. 14, #R45 (2007)
Lindner, C.C., Mendelsohn, E., Mendelsohn, N.S., Wolk, B.: Orthogonal Latin square graphs. J. Graph Theory 3, 325–338 (1979)
Mann, H.B.: The construction of orthogonal Latin squares. Ann. Math. Statist. 13, 418–423 (1942)
Michler, G.O.: Theory of finite simple groups. Cambridge University Press, Cambridge (2006).
Narayan, D.A.: An upper bound for representation number of graphs with fixed order. Integers A12, 1–4 (2003)
Parker, E.T.: Construction of some sets of mutually orthogonal Latin squares. Proc. Amer. Math. Soc. 10, 946–949 (1959)
Pott, A: Finite geometry and character theory. Lecture Notes in Mathematics 1601, Springer-Verlag, Berlin (1995)
Shieh, Y.-P., Hsiang, J., Hsu, D.F.: On the existence problems of complete mappings. Preprint.
Singer, J.: A class of groups associated with Latin squares. Amer. Math. Monthly 67, 235–240 (1960)
Sprague, A.P.: Translation nets. Mitt. Math. Semin. Giessen 157, 46–68 (1982)
Thompson, J.: Finite groups with fixed-point-free automorphisms of prime order. Proc. Natl. Acad. Sci. USA 45, 578–581 (1959).
Xiang, Q.: Recent progress in algebraic design theory. Finite Fields Appl. 11, 622–653 (2005)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Evans, A.B. (2018). Orthomorphism Graphs of Groups. In: Orthogonal Latin Squares Based on Groups. Developments in Mathematics, vol 57. Springer, Cham. https://doi.org/10.1007/978-3-319-94430-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-94430-2_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94429-6
Online ISBN: 978-3-319-94430-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)