Related papers: Quantifying conjugacy separability in wreath produ…
Let $G$ be the generalized free product of two groups with an amalgamated subgroup. We propose an approach that allows one to use results on the residual $p$-finiteness of $G$ for proving that this generalized free product is residually a…
The multiplicity-free subgroups (strong Gelfand subgroups) of wreath products are investigated. Various useful reduction arguments are presented. In particular, we show that for every finite group $F$, the wreath product $F\wr S_\lambda$,…
The equivalence classes of irreducible representations of wreath product $\mathfrak{S}_n(T) = T^n \rtimes \mathfrak{S}_n$ of finite group $T$ with respect to symmetric group $\mathfrak{S}_n$ are parametrized by $\mathbb{Y}_n(\widehat{T})$,…
We study the effects of subgroup distortion in the wreath products A wr Z, where A is finitely generated abelian. We show that every finitely generated subgroup of A wr Z has distortion function equivalent to some polynomial. Moreover, for…
Let I be a finite partially ordered set and let (Sym({\Delta}i),{\Delta}i)i be a sequence of symmetric groups indexed by I. Construct the generalised wreath product (F, {\Delta}) on this sequence of permutation groups. We determine the…
The study of the poset of hyperbolic structures on a group $G$ was initiated in a paper by C.Abbott, S.Balasubramanya and D.Osin. However, this poset is still very far from being understood and several questions remain unanswered. In this…
We obtain strong information on the asymptotic behaviour of the counting function for nilpotent Galois extensions with bounded discriminant of arbitrary number fields. This extends previous investigations for the case of abelian groups. In…
We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…
Generators and defining relations for wreath products of groups are given. Under some condition (conormality of the generators) they are minimal. In particular, it is just the case for the Sylow subgroups of the symmetric groups.
Let $G_{1}$, $G_{2}$, ... be a sequence of groups each of which is either an alternating group, a symmetric group or a cyclic group and construct a sequence $(W_{i})$ of wreath products via $W_{1} = G_{1}$ and, for each $i \geq 1$, $W_{i+1}…
We here consider inner amenability from a geometric and group theoretical perspective. We prove that for every non-elementary action of a group $G$ on a finite dimensional irreducible CAT(0) cube complex, there is a nonempty $G$-invariant…
The irreducible character values of the spin wreath products of the symmetric group and an arbitrary finite group are completely determined.
In this article, some necessary conditions of group vertex magicness of graphs with at least one pendant, group vertex magicness of product graphs, are proved. A characterization of group vertex magicness of trees of diameter up to 5. for…
A subset of a group is product-free if it does not contain elements a, b, c such that ab = c. We review progress on the problem of determining the size of the largest product-free subset of an arbitrary finite group, including a lower bound…
In this article, we initiate the study of the large-scale geometry of permutational wreath products of the form $F\wr_{H/N}H$, where $H$ is finitely presented and where $N$ is a normal subgroup of $H$ satisfying a certain assumption of non…
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 prove that the wreath product $C=A wr B$ of a semigroup $A$ with zero and an infinite cyclic semigroup $B$ is $q_\omega$-compact (logically Noetherian). Our result partially solves the Plotkin`s problem about wreath products
Whiston proved that the maximum size of an irredundant generating set in the symmetric group $S_n$ is $n-1$, and Cameron and Cara characterized all irredundant generating sets of $S_n$ that achieve this size. Our goal is to extend their…
The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…
Reidemeister (or twisted conjugacy) classes are considered in restricted wreath products of the form $G\wr \mathbb{Z}^k$, where $G$ is a finite group. For an automorphism $\varphi$ of finite order (supposed to be the same for the torsion…