A generalization of Euler numbers to finite Coxeter groups

DOI10.1007/S00026-015-0267-8zbMATH Open1316.05129arXiv1304.0902OpenAlexW2075904241MaRDI QIDQ2355281FDOQ2355281

Authors: Matthieu Josuat-Vergés 

Publication date: 22 July 2015

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

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.

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

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

zbMATH Keywords

Euler numbersset partitionsfinite Coxeter groups

Mathematics Subject Classification ID

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

Cites Work

• Combinatorics of Coxeter Groups
• Title not available (Why is that?)
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Parking spaces.
• Title not available (Why is that?)
• Some aspects of groups acting on finite posets
• The calculus of snakes and the combinatorics of Bernoulli, Euler and Springer numbers of Coxeter groups
• The algebraic combinatorics of snakes
• Chains in the Noncrossing Partition Lattice
• Principal \(\Gamma\)-cone for a tree
• Refined enumeration of noncrossing chains and hook formulas

Cited In (6)

• Eulerian quasisymmetric functions for the type B Coxeter group and other wreath product groups
• \(q\)-Eulerian polynomials arising from Coxeter groups
• Refined enumeration of noncrossing chains and hook formulas
• Title not available (Why is that?)
• Enumeration of permutations by the parity of descent positions
• Eulerian polynomials of spherical type

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)