Related papers: Generation of Iterated Wreath Products Constructed…

In the note some construction of Lie algebras is introduced. It is proved that the construction has the same property as a well known wreath product of groups [1]: Any extension of groups can be embedded into their wreath product [2].

A subset $S$ of a group $G$ invariably generates $G$ if, when each element of $S$ is replaced by an arbitrary conjugate, the resulting set generates $G.$ An invariable generating set $X$ of $G$ is called minimal if no proper subset of $X$…

We consider generators of algebraic curvature tensors R which can be constructed by a Young symmetrization of product tensors U*w or w*U, where U and w are covariant tensors of order 3 and 1. We assume that U belongs to a class of the…

Let $K$ be field of characteristic 2 and let $G$ be a finite non-abelian 2-group with the cyclic derived subgroup $G'$, and there exists a central element $z$ of order 2 in $Z(G) \backslash G'$. We prove that the unit group of the group…

For $R_1,R_2,R_3,\dots$ a family of non isomorphic rings (or algebras) having each only 2 idempotents ($1$ and $0$), we classify up to isomorphism the rings (or algebras) obtained by taking products of powers of the different $R_i$. We show…

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…

Full details are given for the definition and construction of the wreath product of two arbitrary Lie algebras, in the hope that it can lead to the definition of a suitable Lie group to be the wreath product of two given Lie groups. In the…

It is shown that membership in rational subsets of wreath products H \wr V with H a finite group and V a virtually free group is decidable. On the other hand, it is shown that there exists a fixed finitely generated submonoid in the wreath…

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

The degree of commutativity of a finite group is the probability that two uniformly and randomly chosen elements commute. This notion extends naturally to finitely generated groups $G$: the degree of commutativity $\text{dc}_S(G)$, with…

We study the isoperimetric profiles of certain families of finitely generated groups defined via marked Schreier graphs and permutation wreath products. The groups we study are among the "simplest" examples within a much larger class of…

It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the…

In this paper we study the complexity of solving orientable quadratic equations in wreath products $A\wr B$ of finitely generated abelian groups. We give a classification of cases (depending on genus and other characteristics of a given…

The diameter of a finite group $G$ with respect to a generating set $A$ is the smallest non-negative integer $n$ such that every element of $G$ can be written as a product of at most $n$ elements of $A \cup A^{-1}$. We denote this invariant…

A transitive simple subgroup of a finite symmetric group is very rarely contained in a full wreath product in product action. All such simple permutation groups are determined in this paper. This remarkable conclusion is reached after a…

Generalizing Krieger's finite generation theorem, we give conditions for an ergodic system to be generated by a pair of partitions, each required to be measurable with respect to a given sub-algebra, and also required to have a fixed size.

Suppose that G is a nontrivial torsion-free group and w is a word in the alphabet G\cup\{x_1^{\pm1},...,x_n^{\pm1}\} such that the word w' obtained from w by erasing all letters belonging to G is not a proper power in the free group…

Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…

We introduce the depth parameters of a finite semigroup, which measure how hard it is to produce an element in the minimum ideal when we consider generating sets satisfying some minimality conditions. We estimate such parameters for some…

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…