English
Related papers

Related papers: Conjugacy classes and centralisers in wreath produ…

200 papers

We study infinitely iterated wreath products of finite permutation groups with respect to product actions. In particular, we prove that, for every non-empty class of finite simple groups $\mathcal{X}$, there exists a finitely generated…

Group Theory · Mathematics 2017-02-27 Benjamin Klopsch , Matteo Vannacci

Let G be a finite group and H a normal subgroup such that G/H is cyclic. Given a conjugacy class g^G of G we define its centralizing subgroup to be HC_G(g). Let K be such that H\le K\le G. We show that the G-conjugacy classes contained in K…

Group Theory · Mathematics 2014-02-26 John R. Britnell , Mark Wildon

We give a geometric proof based on recent work of Eskin, Fisher and Whyte that the lamplighter group $L_n$ has infinitely many twisted conjugacy classes for any automorphism $\vp$ only when $n$ is divisible by 2 or 3, originally proved by…

Group Theory · Mathematics 2011-05-11 Jennifer Taback , Peter Wong

We present several multi-variable generating functions for a new pattern matching condition on the wreath product of the cyclic group and the symmetric group. Our new pattern matching condition requires that the underlying permutations…

Combinatorics · Mathematics 2009-08-28 Sergey Kitaev , Andrew Niedermaier , Jeffrey Remmel , Manda Riehl

We define wreath products of cocommutative Hopf algebras, and show that they enjoy a universal property of classifying cleft extensions, analogous to the Kaloujnine-Krasner theorem for groups. We show that the group ring of a wreath product…

Rings and Algebras · Mathematics 2014-07-16 Laurent Bartholdi , Olivier Siegenthaler , Todd Trimble

A result of Farahat and Higman shows that there is a ``universal'' algebra, $\mathrm{FH}$, interpolating the centres of symmetric group algebras, $Z(\mathbb{Z}S_n)$. We explain that this algebra is isomorphic to $\mathcal{R} \otimes…

Representation Theory · Mathematics 2021-07-09 Christopher Ryba

Let G be a finite group acting on the finite set X such that the corresponding (complex) permutation representation is multiplicity free. There is a natural rank and order preserving action of the wreath product G~S_n on the generalized…

Representation Theory · Mathematics 2014-10-31 Ashish Mishra , Murali K. Srinivasan

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…

Group Theory · Mathematics 2007-05-23 Cheryl E. Praeger , Robert W. Baddeley , Csaba Schneider

We use wreath products to provide criteria for a group to be conjugacy separable or omnipotent. These criteria are in terms of virtual retractions onto cyclic subgroups. We give two applications: a straightforward topological proof of the…

Group Theory · Mathematics 2008-09-16 Henry Wilton

We give a complete description of conjugacy classes of finite subgroups of the mapping class group of the sphere with r marked points. As a corollary we obtain a description of conjugacy classes of maximal finite subgroups of the…

Geometric Topology · Mathematics 2014-02-18 Michal Stukow

We prove that the complexity of the Conjugacy Problems for wreath products and for free solvable groups is decidable in polynomial time. For the wreath product AwrB, we must assume the decidability in polynomial time of the Conjugacy…

Group Theory · Mathematics 2010-11-30 Svetla Vassileva

We give a partial solution a question of Grigorchuk, Nekrashevych, Sushchanskii and \v{S}uni\'k by giving an algorithm to test whether a finite state element of an infinite iterated (permutational) wreath product $\hat G = \mathbb…

Group Theory · Mathematics 2007-05-23 Benjamin Steinberg

There is a well-known classification of conjugacy classes of involutions in finite Coxeter groups, in terms of subsets of nodes of their Coxeter graphs. In many cases, the product of an involution with the longest element is again an…

Group Theory · Mathematics 2022-02-10 Marcus Zibrowius

Let $G$ be a closed highly homogeneous subgroup of $S_{\infty}$ not involving circular orderings. We show that the closure of a conjugacy class from $G$ contains a conjugacy class which is comeagre in it. Furthermore, we show that the…

Logic · Mathematics 2025-04-23 Monika Drzewiecka , Aleksander Ivanov , Bartosz Mokry

Given a finite group $G$ acting on a set $X$ let $\delta_k(G,X)$ denote the proportion of elements in $G$ that have exactly $k$ fixed points in $X$. Let $\mathrm{S}_n$ denote the symmetric group acting on $[n]=\{1,2,\dots,n\}$. For…

Group Theory · Mathematics 2023-07-18 Vishnuram Arumugam , Heiko Dietrich , S. P. Glasby

We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollary we get that, given two conjugate elements in a [f.g. free]-by-cyclic group, the set of conjugators can be computed and that the conjugacy…

Group Theory · Mathematics 2023-10-16 André Carvalho

For a class of wreath-like product groups with property (T), we describe explicitly all the embeddings between their von Neumann algebras. This allows us to provide a continuum of ICC groups with property (T) whose von Neumann algebras are…

Operator Algebras · Mathematics 2025-11-12 Ionut Chifan , Adrian Ioana , Denis Osin , Bin Sun

This paper introduces the notion of orbit coherence in a permutation group. Let $G$ be a group of permutations of a set $\Omega$. Let $\pi(G)$ be the set of partitions of $\Omega$ which arise as the orbit partition of an element of $G$. The…

Group Theory · Mathematics 2012-06-05 John R. Britnell , Mark Wildon

The generalized wreath product of permutation groups is introduced. By means of it we study the schurity problem for S-rings over a cyclic group $G$ and the automorphism groups of them. Criteria for the schurity and non-schurity of the…

Combinatorics · Mathematics 2015-05-07 Sergei Evdokimov , Ilya Ponomarenko

We construct two practical algorithms for twisted conjugacy classes of polycyclic-by-finite groups. The first algorithm determines whether two elements of a group are twisted conjugate for two given endomorphisms, under the condition that…

Group Theory · Mathematics 2021-10-22 Karel Dekimpe , Sam Tertooy