summary:Let $G(\circ)$ and $G(*)$ be two groups of finite order $n$, and suppose that they share a normal subgroup $S$ such that $u\circ v = u *v$ if $u \in S$ or $v \in S$. Cases when $G/S$ is cyclic or dihedral and when $u \circ v \ne u*v$ for exactly $n^2/4$ pairs $(u,v) \in G\times G$ have been shown to be of crucial importance when studying pairs of 2-groups with the latter property. In such cases one can describe two general constructions how to get all possible $G(*)$ from a given $G = G(\circ)$. The constructions, denoted by $G[\alpha,h]$ and $G[\beta,\gamma,h]$, respectively, depend on a coset $\alpha$ (or two cosets $\beta$ and $\gamma$) modulo $S$, and on an element $h \in S$ (certain additional properties must be satisfied as we...
L. Fuchs and S. Golomb considered the following problem. In a finite group G of order n, let p(G) de...
This paper will consider the growth of the number of normal subgroups in a nonabelian group under th...
An automorphism of a graph describes its structural symmetry and the concept of fixing number of a g...
summary:Let $G(\circ)$ and $G(*)$ be two groups of finite order $n$, and suppose that they share a n...
AbstractLet G(∘) and G(*) be two groups of the finite order n, and let d be the size of the set {(a,...
Let $G$ be a finite group. In this paper, we study the structure of finite groups having $|G|-r$ cyc...
AbstractLet D be an (m,n;k;λ1,λ2)-group divisible difference set (GDDS) of a group G, written additi...
summary:The paper reports the results of a search for pairs of groups of order $n$ that can be place...
Put dist(G(·), G(*)) = card{(a, b) εG2; a · b ≠ a * b} for any two groups G(·), G(*) with the same u...
summary:This paper completely solves the isomorphism problem for Moufang loops $Q = GC$ where $G\unl...
AbstractLet G be any of the groups (P)GL(n,q), (P)SL(n,q). Define a (simple) graph Γ=Γ(G) on the set...
AbstractUsing coset diagrams it is shown that for every sufficiently large positive integer n, both ...
AbstractLet n≥23 be an integer and let D2n be the dihedral group of order 2n. It is proved that, if ...
AbstractThis is the third of three parts. A description of the contents may be found in the introduc...
AbstractLetGbe an arbitrary group with a subgroupA. Each double cosetAgAis a union of right cosetsAu...
L. Fuchs and S. Golomb considered the following problem. In a finite group G of order n, let p(G) de...
This paper will consider the growth of the number of normal subgroups in a nonabelian group under th...
An automorphism of a graph describes its structural symmetry and the concept of fixing number of a g...
summary:Let $G(\circ)$ and $G(*)$ be two groups of finite order $n$, and suppose that they share a n...
AbstractLet G(∘) and G(*) be two groups of the finite order n, and let d be the size of the set {(a,...
Let $G$ be a finite group. In this paper, we study the structure of finite groups having $|G|-r$ cyc...
AbstractLet D be an (m,n;k;λ1,λ2)-group divisible difference set (GDDS) of a group G, written additi...
summary:The paper reports the results of a search for pairs of groups of order $n$ that can be place...
Put dist(G(·), G(*)) = card{(a, b) εG2; a · b ≠ a * b} for any two groups G(·), G(*) with the same u...
summary:This paper completely solves the isomorphism problem for Moufang loops $Q = GC$ where $G\unl...
AbstractLet G be any of the groups (P)GL(n,q), (P)SL(n,q). Define a (simple) graph Γ=Γ(G) on the set...
AbstractUsing coset diagrams it is shown that for every sufficiently large positive integer n, both ...
AbstractLet n≥23 be an integer and let D2n be the dihedral group of order 2n. It is proved that, if ...
AbstractThis is the third of three parts. A description of the contents may be found in the introduc...
AbstractLetGbe an arbitrary group with a subgroupA. Each double cosetAgAis a union of right cosetsAu...
L. Fuchs and S. Golomb considered the following problem. In a finite group G of order n, let p(G) de...
This paper will consider the growth of the number of normal subgroups in a nonabelian group under th...
An automorphism of a graph describes its structural symmetry and the concept of fixing number of a g...