Orthomorphism graphs of groups (Q5904008)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4110927
Language Label Description Also known as
default for all languages
No label defined
    English
    Orthomorphism graphs of groups
    scientific article; zbMATH DE number 4110927

      Statements

      Orthomorphism graphs of groups (English)
      0 references
      0 references
      1989
      0 references
      The orthomorphism graph of a group G is the set of all bijections \(\alpha\) : \(G\to G\) fixing the identity such that \(g\mapsto g^{- 1}g^{\alpha}\) is bijective, with \(\alpha\), \(\beta\) adjacent precisely if \(g\mapsto (g^{\alpha})^{-1}g^{\beta}\) is bijective. An r-clique in this graph corresponds to a net on \(G^ 2\) with \(r+2\) parallel classes admitting G as a group of translations. The main part of the paper is concerned with upper bounds \(\omega\) (G) for cliques consisting of automorphisms or antiautomorphisms of a finite group G. It turns out that \(\omega (G)=| G| -2\) if and only if G is elementary abelian.
      0 references
      fixed-point free permutation
      0 references
      latin square
      0 references
      orthomorphism graph
      0 references
      r- clique
      0 references
      net
      0 references
      group of translations
      0 references
      automorphisms
      0 references
      antiautomorphisms
      0 references
      finite group
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references