zbMATH — the first resource for mathematics

Wreath products by the symmetric groups and product posets of Young’s lattices. (English) Zbl 0707.05062
The Young lattice is the poset of all partitions of the set of positive integers, namely almost everywhere null never increasing sequences of non-negative integers with positive sum. Studying the connections between wreath products \(G\wr S_ n\) of a finite group G with a symmetric groups \(S_ n\) and powers of the Young lattice, the author is able to give a complete set of mututally orthogonal eigenvectors for the linear mapping \(Ind^ n_{n-1}\circ Res^ n_{n-1}\) of the vector space of class functions of \(G\wr S_ n\), where \(Ind^ n_{n-1}\) is the induction mapping from (the vector space of class functions of) \(G\wr S_{n-1}\) to \(G\wr S_ n\) and \(Res^ n_{n-1}\) is the restriction mapping from (the vector space of class functions of) \(G\wr S_ n\) to \(G\wr S_{n-1}\).
Reviewer: A.Pasini

05E25 Group actions on posets, etc. (MSC2000)
20B25 Finite automorphism groups of algebraic, geometric, or combinatorial structures
06A07 Combinatorics of partially ordered sets
20C30 Representations of finite symmetric groups
Full Text: DOI
[1] Kerber, A, Representations of permutation groups I, () · Zbl 0232.20014
[2] Knuth, D.E, ()
[3] Macdonald, I.G, Symmetric functions and Hall polynomials, (1979), Oxford Univ. Press Oxford · Zbl 0487.20007
[4] Macdonald, I.G, Polynomial functors and wreath products, J. pure appl. algebra, 18, 173-204, (1980) · Zbl 0455.18002
[5] Stanley, R.P, Some aspects of groups acting on finite posets, J. combin. theory ser. A, 32, 132-161, (1982) · Zbl 0496.06001
[6] Stanley, R.P, Differential posets, J. amer. math. soc., 1, 919-961, (1988) · Zbl 0658.05006
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.