Related papers: Classifying complements for groups. Applications

For an Abelian group $G$, any homomorphism $\mu\colon G\otimes G\rightarrow G$ is called a \textsf{multiplication} on $G$. The set $\text{Mult}\,G$ of all multiplications on an Abelian group $G$ is an Abelian group with respect to addition.…

Let $G$ be a finite group and $H$ a subgroup of $G$. Each left transversal (with identity) of $H$ in $G$ has a left loop (left quasigroup with identity) structure induced by the binary operation of $G$. We say two left transversals are…

We give a survey of some recent results on the fusion semirings of compact quantum groups (computations of and applications to discrete quantum groups) by using the following simplifying terminology: we say that a compact quantum group G is…

A qualgebra $G$ is a set having two binary operations that satisfy compatibility conditions which are modeled upon a group under conjugation and multiplication. We develop a homology theory for qualgebras and describe a classifying space…

For a finite group $G$, let $\omega(G)$ be the set of element orders of $G$ and let $h(G)$ be the number of pairwise nonisomorphic finite groups $H$ with $\omega(H)=\omega(G)$. We say that the recognition problem is solved for $G$ if the…

Let $H$ be a group and $E$ a set such that $H \subseteq E$. We shall describe and classify up to an isomorphism of groups that stabilizes $H$ the set of all group structures that can be defined on $E$ such that $H$ is a subgroup of $E$. A…

The codomain category of a generalized homology theory is the category of modules over a ring. For an abelian category A, an A-valued (generalized) homology theory is defined by formally replacing the category of modules with the category…

Combinatorial categories satisfy a stronger form of Yoneda Lemma, namely, the isomorphism type of an object can be recovered by counting the number of homomorphisms from all other objects into it. In this work, we show that this property…

A group $G$ has cube-free order if no prime to the third power divides $|G|$. We describe an algorithm that given two cube-free groups $G$ and $H$ of known order, decides whether $G\cong H$, and, if so, constructs an isomorphism $G\to H$.…

For any positive integer $n$, $\mathcal{A}_n$ is the class of all groups $G$ such that, for $0\leq i\leq n$, $H^i(\hat{G},A)\cong H^i(G,A)$ for every finite discrete $\hat{G}$-module $A$. We describe certain types of free products with…

A collection C of subgroups of a finite group G can give rise to three different standard formulas for the cohomology of G in terms of either: the subgroups in C; or their centralizers; or their normalizers. We give a short but systematic…

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…

The Hadwiger number of a graph $G$, denoted by $h(G)$, is the order of the largest complete minor of $G$. A graph is said to be self-complementary if it is isomorphic to its complement. We prove that for all $n\equiv 0,1 (\text{mod 4})$ and…

`Categorification' is the process of replacing equations by isomorphisms. We describe some of the ways a thoroughgoing emphasis on categorification can simplify and unify mathematics. We begin with elementary arithmetic, where the category…

We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.

We define the notion of a semicharacter of a group G : A function from the group to C*, whose restriction to any abelian subgroup is a homomorphism. We conjecture that for any finite group, the order of the group of semicharacters is…

Let $H$ be a Krull monoid with class group $G$ such that every class contains a prime divisor. Then every nonunit $a \in H$ can be written as a finite product of irreducible elements. If $a=u\_1 \cdot \ldots \cdot u\_k$, with irreducibles…

A subgroup $H$ of a finite group $G$ is said to satisfy $\Pi$-property in $G$ if for every chief factor $L/K$ of $G$, $|G/K:N_{G/K}(HK/K\cap L/K)|$ is a $\pi(HK/K\cap L/K)$-number. A subgroup $H$ of $G$ is called to be $\Pi$-supplemented in…

In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…