No label defined (Q4828847)

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 2119445
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 2119445

      Statements

      0 references
      26 November 2004
      0 references
      distances of groups
      0 references
      Cayley tables
      0 references
      Hamming distances
      0 references
      finite 2-groups
      0 references
      The paper is concerned with two group constructions which are based on changing the operation of a group \(G\) in a quarter of pairs \((u,v)\in G\times G\) in such a way that the new operation, say \(*\), also yields a group. Only cases when \(u*v\neq uv\) will be described: The first construction requires the existence of a subgroup \(S<G\) of index two and of an element \(h\in Z(G)\cap S\). One sets \(u*v=uvh\), if \(u,v\in G\setminus S\), and denotes the group \(G(*)\) by \(G[S,h]\). The second construction requires the existence of subgroups \(U<G\) and \(V<G\) that are of index two, with \(S=U\cap V\) of index four, and the existence of \(h\in Z(U\cap V)\), \(hxh=x\) for all \(x\in U\setminus S\) and \(x\in V\setminus S\). One sets \(u*v=uvh\) when \(u\notin U\) and \(v\in U\setminus S\), and \(u*v=uvh^{-1}\) when \(u\notin U\) and \(v\in G\setminus(U\cup V)\). The group \(G(*)\) is in this case denoted by \(G[U,V,h]\). Say that groups \(G_2\) and \(G_1\) are 2-related, if \(G_2\cong G_1[S,h]\) for some \(S\) and \(h\), and that they are 4-related if \(G_2\cong G_1[U,V,h]\) for some \(U\), \(V\) and \(h\). The paper describes groups that are 2-related and 4-related to dihedral, semidihedral and generalized quaternion 2-groups, and shows that there exists a group of order 32 that is 2-related or 4-related to no nonisomorphic group. It also refers to computations that have shown that any two groups of order 16 can be connected by a sequence of groups in which the elements of every successive pair are 2-related or 4-related. A similar result has been achieved for order 32, with the single exception of the group mentioned above. However, that group can be connected to other groups by a different method -- where the connection concerns the existence of a group operation \(*\) with the distance equal to \(n^2/4\) (where \(n\) is the order of the group, and distance means the number of pairs \((u,v)\) with \(uv\neq u*v\)).
      0 references

      Identifiers