A generalization of Euler numbers to finite Coxeter groups

DOI10.1007/S00026-015-0267-8MaRDI QIDQ2355281zbMATH OpenOpenAlexFDO

Authors Matthieu Josuat-Vergés

Publication date 22 July 2015

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.0902

zbMATH Keywords

Euler numbersfinite Coxeter groupsset partitions

Mathematics Subject Classification ID

Partitions of sets (05A18) Group actions on combinatorial structures (05E18) Bernoulli and Euler numbers and polynomials (11B68) Symmetric groups (20B30) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Abstract: It is known that Euler numbers, defined as the Taylor coefficients of the tangent and secant functions, count alternating permutations in the symmetric group. Springer defined a generalization of these numbers for each finite Coxeter group by considering the largest descent class, and computed the value in each case of the classification. We consider here another generalization of Euler numbers for finite Coxeter groups, building on Stanley's result about the number of orbits of maximal chains of set partitions. We present a method to compute these integers and obtain the value in each case of the classification.

Recommendations

• \(q\)-Eulerian polynomials arising from Coxeter groups
• Eulerian polynomials of spherical type
• CONGRUENCES FOR EULER, BERNOULLI, AND SPRINGER NUMBERS OF COXETER GROUPS
• Eulerian central limit theorems and Carlitz identities in positive elements of classical Weyl groups
• The distribution of descents and length in a Coxeter group

Cites work

• Chains in the Noncrossing Partition Lattice
• Combinatorics of Coxeter Groups
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• scientific article; zbMATH DE number 47598 (Why is no real title available?)
• scientific article; zbMATH DE number 3355039 (Why is no real title available?)
• Parking spaces.
• Principal -cone for a tree
• Refined enumeration of noncrossing chains and hook formulas
• Some aspects of groups acting on finite posets
• The algebraic combinatorics of snakes
• The calculus of snakes and the combinatorics of Bernoulli, Euler and Springer numbers of Coxeter groups

Cited in

(6)

• \(q\)-Eulerian polynomials arising from Coxeter groups
• Eulerian polynomials of spherical type
• scientific article; zbMATH DE number 125567 (Why is no real title available?)
• Eulerian quasisymmetric functions for the type B Coxeter group and other wreath product groups
• Enumeration of permutations by the parity of descent positions
• Refined enumeration of noncrossing chains and hook formulas

This page was built for publication: A generalization of Euler numbers to finite Coxeter groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355281)