相关论文: Generation of Iterated Wreath Products Constructed…

We show that a wreath product of two finitely generated abelian groups is LERF. Consequently the free metabelian groups are LERF.

Given a permutational wreath product sequence of cyclic groups we investigate its minimal generating set, minimal generating set for its commutator and some properties of its commutator subgroup. We strengthen the result of author…

We introduce a new class of groups called wreath-like products. These groups are close relatives of the classical wreath products and arise naturally in the context of group theoretic Dehn filling. Unlike ordinary wreath products, many…

We introduce a new construction of matrix wreath products of algebras that is similar to wreath products of groups. We then use it to prove embedding theorems for Jacobson radical, nil, and primitive algebras. In \S\ref{Section6}, we…

Working in the setting of Deligne categories, we generalize a result of Marin that hooks generate the representation ring of symmetric groups to wreath products of symmetric groups with a fixed finite group or Hopf algebra. In particular,…

In this paper the authors introduce a new notion called the quantum wreath product, which is the algebra $B \wr_Q \mathcal{H}(d)$ produced from a given algebra $B$, a positive integer $d$, and a choice $Q=(R,S,\rho,\sigma)$ of parameters.…

Let $G$ be an irreducible imprimitive subgroup of $\operatorname{GL}_n(\mathbb{F})$, where $\mathbb{F}$ is a field. Any system of imprimitivity for $G$ can be refined to a nonrefinable system of imprimitivity, and we consider the question…

We construct a sequence of balanced finite presentations of the trivial group with two generators and two relators with the following property: The minimal number of relations required to demonstrate that a generator represents the trivial…

Take any word over some alphabet. If it is non-empty, go to any position and print out the letter being scanned. Now repeat the following any number of times (possibly zero): either stay at the current letter, or move one letter leftwards…

We introduce a notion of partition wreath product of a finite group by a partition quantum group, a construction motivated on the one hand by classical wreath products and on the other hand by the free wreath product of J. Bichon. We…

For $n$ at least 7 and $n$ equal to 5, we give generating sets of size 2 for the commutator subgroup of the braid group on $n$ strands. These generating sets are of the smallest possible cardinality. For $n$ equal to 4 or 6, we give…

We suggest a criterion under which for a nilpotent group of finite exponent $A$ and for an abelian group $B$ the variety $var(A \,Wr\, B)$ generated by their wreath product $A \,Wr\, B$ is equal to the product of varieties $var(A)$ and…

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

We provide a necessary and sufficient condition for the restricted wreath product $A\wr B$ to be $\mathcal{C}$-hereditarily conjugacy separable where $\mathcal{C}$ is an extension-closed pseudovariety of finite groups. Moreover, we prove…

The objective of this paper is to study the monoid of all partial transformations of a finite set that preserve a uniform partition. In addition to proving that this monoid is a quotient of a wreath product with respect to a congruence…

The background of this paper is the following: search of the minimal systems of generators for this class of group which still was not founded also problem of representation for this class of group, exploration of systems of generators for…

This article provides a method to calculate the fixed-point proportion of any iterated wreath product acting on a $d$-regular tree. Moreover, the method applies to a generalization of iterated wreath products acting on a $d$-regular tree,…

Wreath products involving symmetric inverse monoids/semigroups/categories arise in many areas of algebra and science, and presentations by generators and relations are crucial tools in such studies. The current paper finds such…

We prove new complexity results for computational problems in certain wreath products of groups and (as an application) for free solvable group. For a finitely generated group we study the so-called power word problem (does a given…

In this note we give an alternative proof of a theorem of Linnell and Warhurst that the number of generators d(G) of a polycyclic group G is at most d(\hat G), where d(\hat G) is the number of generators of the profinite completion of G.…