Class-preserving coleman automorphisms of permutational wreath products with 2-closed base groups

2016 ◽  
Vol 15 (10) ◽  
pp. 1650189
Author(s):  
Zhengxing Li ◽  
Yuanlin Li
Keyword(s):  
Permutation Group ◽  
Wreath Product ◽  
Direct Consequence ◽  
Wreath Products ◽  
Closed Group ◽  
Arbitrary Permutation ◽  
Finite Set ◽  
Coleman Automorphism ◽  
The Normalizer Property

Let [Formula: see text] be a nontrivial [Formula: see text]-closed group and let [Formula: see text] be an arbitrary permutation group on a finite set [Formula: see text]. Let [Formula: see text] be the corresponding permutational wreath product of [Formula: see text] by [Formula: see text]. It is shown that every class-preserving Coleman automorphism of [Formula: see text]-power order of [Formula: see text] is inner. As a direct consequence, it is obtained that the normalizer property holds for [Formula: see text]. Further, it is shown that every class-preserving Coleman automorphism of [Formula: see text] is inner whenever [Formula: see text] is nilpotent. Our results generalize some known ones.

COLEMAN AUTOMORPHISMS OF STANDARD WREATH PRODUCTS OF NILPOTENT GROUPS BY GROUPS WITH PRESCRIBED SYLOW 2-SUBGROUPS

2014 ◽  
Vol 13 (05) ◽  
pp. 1350156 ◽  
Author(s):  
ZHENGXING LI ◽  
JINKE HAI
Keyword(s):  
Finite Group ◽  
Nilpotent Group ◽  
Direct Consequence ◽  
Nilpotent Groups ◽  
Wreath Products ◽  
Coleman Automorphism ◽  
A Finite Group ◽  
Generalized Quaternion ◽  
Standard Wreath Product ◽  
The Normalizer Property

Let G = N wr H be the standard wreath product of N by H, where N is a finite nilpotent group and H is a finite group whose Sylow 2-subgroups are either cyclic, dihedral or generalized quaternion. It is shown that every Coleman automorphism of G is inner. As a direct consequence of this result, it is obtained that the normalizer property holds for G.

scholarly journals EMBEDDING PERMUTATION GROUPS INTO WREATH PRODUCTS IN PRODUCT ACTION

2012 ◽  
Vol 92 (1) ◽  
pp. 127-136 ◽  
Author(s):  
CHERYL E. PRAEGER ◽  
CSABA SCHNEIDER
Keyword(s):  
Permutation Group ◽  
Wreath Product ◽  
Automorphism Groups ◽  
Wreath Products ◽  
Error Correcting Codes ◽  
Permutation Groups ◽  
Graph Products ◽  
Product Action ◽  
Hamming Graphs

AbstractWe consider the wreath product of two permutation groups G≤Sym Γ and H≤Sym Δ as a permutation group acting on the set Π of functions from Δ to Γ. Such groups play an important role in the O’Nan–Scott theory of permutation groups and they also arise as automorphism groups of graph products and codes. Let X be a subgroup of Sym Γ≀Sym Δ. Our main result is that, in a suitable conjugate of X, the subgroup of SymΓ induced by a stabiliser of a coordinate δ∈Δ only depends on the orbit of δ under the induced action of X on Δ. Hence, if X is transitive on Δ, then X can be embedded into the wreath product of the permutation group induced by the stabiliser Xδ on Γ and the permutation group induced by X on Δ. We use this result to describe the case where X is intransitive on Δ and offer an application to error-correcting codes in Hamming graphs.

scholarly journals Wreath decompositions of finite permutation groups

1989 ◽  
Vol 40 (2) ◽  
pp. 255-279 ◽  
Author(s):  
L. G. Kovács
Keyword(s):  
Permutation Group ◽  
Wreath Product ◽  
Transitive Group ◽  
Wreath Products ◽  
Permutation Groups ◽  
Transitive Permutation Group ◽  
Formal Definition ◽  
The Third ◽  
Product Action ◽  
Factor Decomposition

There is a familiar construction with two finite, transitive permutation groups as input and a finite, transitive permutation group, called their wreath product, as output. The corresponding ‘imprimitive wreath decomposition’ concept is the first subject of this paper. A formal definition is adopted and an overview obtained for all such decompositions of any given finite, transitive group. The result may be heuristically expressed as follows, exploiting the associative nature of the construction. Each finite transitive permutation group may be written, essentially uniquely, as the wreath product of a sequence of wreath-indecomposable groups, amid the two-factor wreath decompositions of the group are precisely those which one obtains by bracketing this many-factor decomposition.If both input groups are nontrivial, the output above is always imprimitive. A similar construction gives a primitive output, called the wreath product in product action, provided the first input group is primitive and not regular. The second subject of the paper is the ‘product action wreath decomposition’ concept dual to this. An analogue of the result stated above is established for primitive groups with nonabelian socle.Given a primitive subgroup G with non-regular socle in some symmetric group S, how many subgroups W of S which contain G and have the same socle, are wreath products in product action? The third part of the paper outlines an algorithm which reduces this count to questions about permutation groups whose degrees are very much smaller than that of G.

scholarly journals WREATH PRODUCTS, NILPOTENT ORBITS AND SYMPLECTIC DEFORMATIONS

2007 ◽  
Vol 18 (05) ◽  
pp. 473-481
Author(s):  
BAOHUA FU
Keyword(s):  
Wreath Product ◽  
Wreath Products ◽  
Nilpotent Orbit ◽  
Nilpotent Orbits ◽  
Symplectic Resolutions

We recover the wreath product X ≔ Sym 2(ℂ2/± 1) as a transversal slice to a nilpotent orbit in 𝔰𝔭6. By using deformations of Springer resolutions, we construct a symplectic deformation of symplectic resolutions of X.

scholarly journals Transversals in permutation groups and factorisations of complete graphs

2002 ◽  
Vol 65 (2) ◽  
pp. 277-288 ◽  
Author(s):  
Gil Kaplan ◽  
Arieh Lev
Keyword(s):  
Permutation Group ◽  
Directed Graph ◽  
Sufficient Conditions ◽  
Combinatorial Problems ◽  
Permutation Groups ◽  
Transitive Permutation Group ◽  
Complete Graphs ◽  
Frobenius Theorem ◽  
Disjoint Cycles ◽  
Finite Set

Let G be a transitive permutation group acting on a finite set of order n. We discuss certain types of transversals for a point stabiliser A in G: free transversals and global transversals. We give sufficient conditions for the existence of such transversals, and show the connection between these transversals and combinatorial problems of decomposing the complete directed graph into edge disjoint cycles. In particular, we classify all the inner-transitive Oberwolfach factorisations of the complete directed graph. We mention also a connection to Frobenius theorem.

scholarly journals Wreath Product Action on Generalized Boolean Algebras

10.37236/4831 ◽  
2015 ◽  
Vol 22 (2) ◽  
Author(s):  
Ashish Mishra ◽  
Murali K. Srinivasan
Keyword(s):  
Finite Group ◽  
Boolean Algebra ◽  
Wreath Product ◽  
Boolean Algebras ◽  
Product Action ◽  
Finite Set ◽  
A Finite Group ◽  
Multiplicity Free ◽  
Generalized Boolean Algebra ◽  
Generalized Boolean Algebras

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\sim S_n$ on the generalized Boolean algebra $B_X(n)$. We explicitly block diagonalize the commutant of this action.

Automorphisms of Iterated Wreath Product p-Groups

2012 ◽  
Vol 55 (2) ◽  
pp. 390-399 ◽  
Author(s):  
Jeffrey M. Riedl
Keyword(s):  
Automorphism Group ◽  
Representation Theory ◽  
Wreath Product ◽  
Wreath Products ◽  
Cyclic Groups ◽  
Important Family

AbstractWe determine the order of the automorphism group Aut(W) for each member W of an important family of finite p-groups that may be constructed as iterated regular wreath products of cyclic groups. We use a method based on representation theory.

scholarly journals Groups fixing graphas in switching classes

1982 ◽  
Vol 33 (1) ◽  
pp. 76-85
Author(s):  
Martin W. Liebeck
Keyword(s):  
Finite Group ◽  
Symmetric Group ◽  
Permutation Group ◽  
Abelian Groups ◽  
Finite Set ◽  
A Finite Group ◽  
Switching Class

AbstractA permutation group G on a finite set Ω is always exposable if whenever G stabilises a switching class of graphs on Ω, G fixes a graph in the switching class. Here we consider the problem: given a finite group G, which permutation representations of G are always exposable? We present solutions to the problem for (i) 2-generator abelian groups, (ii) all abelian groups in semiregular representations. (iii) generalised quaternion groups and (iv) some representations of the symmetric group Sn.

Simple groups and irreducible lattices in wreath products

2020 ◽  
pp. 1-12 ◽  
Author(s):  
ADRIEN LE BOUDEC
Keyword(s):  
Finite Group ◽  
Wreath Product ◽  
Free Group ◽  
Wreath Products ◽  
Simple Groups ◽  
Finitely Generated ◽  
Locally Compact ◽  
Regular Tree ◽  
Finitely Generated Groups ◽  
A Finite Group

We consider the finitely generated groups acting on a regular tree with almost prescribed local action. We show that these groups embed as cocompact irreducible lattices in some locally compact wreath products. This provides examples of finitely generated simple groups quasi-isometric to a wreath product $C\wr F$ , where $C$ is a finite group and $F$ a non-abelian free group.

W*-superrigidity for wreath products with groups having positive first ℓ2-Betti number

2015 ◽  
Vol 26 (01) ◽  
pp. 1550003 ◽  
Author(s):  
Mihaita Berbec
Keyword(s):  
Wreath Product ◽  
Betti Number ◽  
Von Neumann Algebra ◽  
Von Neumann Algebras ◽  
Wreath Products ◽  
Hyperbolic Groups ◽  
Free Products ◽  
Von Neumann ◽  
Product Group ◽  
Group Von Neumann Algebra

In [M. Berbec and S. Vaes, W*-superrigidity for group von Neumann algebras of left–right wreath products, Proc. London Math. Soc.108 (2014) 1116–1152] we have proven that, for all hyperbolic groups and for all nontrivial free products Γ, the left–right wreath product group 𝒢 ≔ (ℤ/2ℤ)(Γ) ⋊ (Γ × Γ) is W*-superrigid, in the sense that its group von Neumann algebra L𝒢 completely remembers the group 𝒢. In this paper, we extend this result to other classes of countable groups. More precisely, we prove that for weakly amenable groups Γ having positive first ℓ2-Betti number, the same wreath product group 𝒢 is W*-superrigid.

Sign in / Sign up

Export Citation Format

Share Document