Eulerian numbers, Newcomb's problem and representations of symmetric groups

DOI10.1016/0012-365X(80)90061-8zbMath0445.05008MaRDI QIDQ1145140

H. O. Foulkes

Publication date: 1980

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Stirling numbersrepresentations of symmetric groupsEuler numbersNewcomb's problemKostka numbersenumeration theoryskew hooks

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Bernoulli and Euler numbers and polynomials (11B68) Representations of finite symmetric groups (20C30)

Related Items (18)

On Foulkes characters ⋮ Noncommutative Bell polynomials and the dual immaculate basis ⋮ Block characters of the symmetric groups. ⋮ Noncommutative symmetric functions and an amazing matrix ⋮ Polynomial ring generated by tableau shapes ⋮ Slicing skew-tableau frames ⋮ Topology of arrangements and representation stability. Abstracts from the workshop held January 14--20, 2018 ⋮ Foulkes characters, Eulerian idempotents, and an amazing matrix ⋮ Fonctions symétriques associées à des suites classiques de nombres ⋮ Single-hook characters and hamiltonian circuits^∗ ⋮ Subalgebras of Solomon's descent algebra based on alternating runs ⋮ An asymptotic distribution theory for Eulerian recurrences with applications ⋮ Recurrences for characters of the symmetric group ⋮ Permutations with extremal number of fixed points ⋮ Ribbon Schur functions ⋮ Labeled binary trees, subarrangements of the Catalan arrangements, and Schur positivity ⋮ Signed words and permutations, I: A fundamental transformation ⋮ Counting permutations with given cycle structure and descent set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paths in ordered structures of partitions
• A simple solution of Simon Newcomb's problem
• Enumeration of permutations with prescribed up-down and inversion sequences
• Tangent and secant numbers and representations of symmetric groups
• A nonrecursive combinatorial rule for Eulerian numbers
• A characterization of permutations via skew-hooks
• A decomposition of the group algebra of a finite Coxeter group
• Théorie géométrique des polynômes eulériens
• Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
• Some Aspects of the Random Sequence
• Simon Newcomb’s Problem
• Differential Operators Associated with S -Functions

This page was built for publication: Eulerian numbers, Newcomb's problem and representations of symmetric groups