Related papers: Invariable generation and wreath products
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…
We prove that if a finite group $H$ has a generalized involution model, as defined by Bump and Ginzburg, then the wreath product $H \wr S_n$ also has a generalized involution model. This extends the work of Baddeley concerning involution…
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…
Let G1, G2, ... be a sequence of almost simple groups and construct a sequence (Wi) of wreath products via W1 = G1 and, for each i > 1, Wi+1 = Gi+1 wr Wi via the regular action of each Gi. We determine the minimum number d(Wi) of generators…
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…
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…
Given the large class of groups already known to be sofic, there is seemingly a shortfall in results concerning their permanence properties. We address this problem for wreath products, and in particular investigate the behaviour of more…
A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ invariably generates $G$ if $\{g_1^{x_1}, \ldots , g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected value of the random…
A wreath product is a method to construct an association scheme from two association schemes. We determine the automorphism group of a wreath product. We show a known result that a wreath product is Schurian if and only if both components…
We study generalisations of conjugacy separability in restricted wreath products of groups. We provide an effective upper bound for $\mathcal{C}$-conjugacy separability of a wreath product $A \wr B$ in terms of the $\mathcal{C}$-conjugacy…
The irreducible character values of the spin wreath products of the symmetric group and an arbitrary finite group are completely determined.
A permutation group is innately transitive if it has a transitive minimal normal subgroup, which is referred to as a plinth. We study the class of finite, innately transitive permutation groups that can be embedded into wreath products in…
The automorphism group of the composition of graphs $G \circ H$ contains the wreath product $Aut(H) \wr Aut(G)$ of the automorphism groups of the corresponding graphs. The classical problem considered by Sabidussi and Hemminger was under…
For a continuous action of a countable discrete group $G$ on a Polish space $X$, a countable Borel partition $P$ of $X$ is called a generator if $G \cdot P := \{ gC : g \in G, C \in P \}$ generates the Borel $\sigma$-algebra of $X$. For $G…
We introduce ring theoretic constructions that are similar to the construction of wreath product of groups. In particular, for a given graph $\Gamma=(V,E)$ and an associate algebra $A,$ we construct an algebra $B=A\, wr\, L(\Gamma)$ with…
We find some sufficient conditions under which the permutational wreath product of two groups has a minimal generating set. In particular we prove that for a regular rooted tree the group of all automorphisms and the group of all…
Given a morphism $\varphi : G \to A \wr B$ from a finitely presented group $G$ to a wreath product $A \wr B$, we show that, if the image of $\varphi$ is a sufficiently large subgroup, then $\mathrm{ker}(\varphi)$ contains a non-abelian free…
We show that certain groups of piecewise linear homeomorphims of the interval are invariably generated.
Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime…
Braided tensor products have been introduced by the author as a systematic way of making two quantum-group-covariant systems interact in a covariant way, and used in the theory of braided groups. Here we study infinite braided tensor…