Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
The Descent Monomials and a Basis for the Diagonally Symmetric Polynomials
Journal of Algebraic Combinatorics: An International Journal
Foulkes characters, Eulerian idempotents, and an amazing matrix
Journal of Algebraic Combinatorics: An International Journal
Hi-index | 0.00 |
A block character of a finite symmetric group is a positive definite function which depends only on the number of cycles in a permutation. We describe the cone of block characters by identifying its extreme rays, and find relations of the characters to descent representations and the coinvariant algebra of ${\mathfrak{S}}_{n}$ . The decomposition of extreme block characters into the sum of characters of irreducible representations gives rise to certain limit shape theorems for random Young diagrams. We also study counterparts of the block characters for the infinite symmetric group ${\mathfrak{S}}_{\infty}$ , along with their connection to the Thoma characters of the infinite linear group GL 驴(q) over a Galois field.