Related papers: Construction of groups with triality and their cor…
Let $G$ be a finite group and $C_2$ the cyclic group of order 2. Consider the 8 multiplicative operations $(x,y)\mapsto (x^iy^j)^k$, where $i$, $j$, $k\in\{-1, 1\}$. Define a new multiplication on $G\times C_2$ by assigning one of the above…
The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…
Code loops are certain Moufang $2$-loops constructed from doubly even binary codes that play an important role in the construction of local subgroups of sporadic groups. More precisely, code loops are central extensions of the group of…
Let $L$ be a Moufang loop which is centrally nilpotent of class 2. We first show that the nuclearly-derived subloop (normal associator subloop) $L^*$ of $L$ has exponent dividing 6. It follows that $L_p$ (the subloop of $L$ of elements of…
Let $G$ be a group which admits the structure of an iterated semidirect product of finitely generated free groups. We construct a finite, free resolution of the integers over the group ring of $G$. This resolution is used to define…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain $3$-designs with $2$-transitive permutation groups. The incidence…
Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes, namely the factorization conjecture and the triangle conjecture,…
We construct a Moufang loop $M$ of order $3^{19}$ and a pair $a,b$ of its elements such that the set of all elements of $M$ that associate with $a$ and $b$ does not form a subloop. This is also an example of a nonassociative Moufang loop…
We investigate the structure of crossed product von Neumann algebras arising from Bogoljubov actions of countable groups on Shlyakhtenko's free Araki-Woods factors. Among other results, we settle the questions of factoriality and Connes'…
Uhlenbeck proved that a set of simple elements generates the group of rational loops in GL(n,C) that satisfy the U(n)-reality condition. For an arbitrary complex reductive group, a choice of representation defines a notion of rationality…
We show that for every $N\ge 3$ the free unitary group $U^+_N$ is topologically generated by its classical counterpart $U_N$ and the lower-rank $U^+_{N-1}$. This allows for a uniform inductive proof that a number of finiteness properties,…
Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…
We study abelian-by-cyclic Moufang loops. We construct all split $3$-divisible abelian-by-cyclic Moufang loops from so-called Moufang permutations on abelian groups $(X,+)$, which are permutations that deviate from an automorphism of…
Given a group $G = H_1 \ast_A H_2$ which is the free product of two finitely generated groups $H_1$ and $H_2$ with amalgamation over a cyclic subgroup $A$ which is malnormal in $G$, we study relations between the structure of its subgroups…
A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…
In this paper we revisit and extend the constructions of Glauberman and Doro on groups with triality and Moufang loops to Hopf algebras. We prove that the universal enveloping algebra of any Lie algebra with triality is a Hopf algebra with…
Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class…
In 2004, Cs\"{o}rg\H{o} constructed a loop of nilpotency class three with abelian group of inner mappings. Until now, no other examples were known. We construct many such loops from groups of nilpotency class two by replacing the product…
We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all $n\in\mathbb{N}$, a residually free group is of…
The decomposition theorem for torsion abelian groups holds analogously for torsion commutative diassociative loops. With this theorem in mind, we investigate commutative diassociative loops satisfying the additional condition (trivially…