A generalization of Euler numbers to finite Coxeter groups
From MaRDI portal
Publication:2355281
DOI10.1007/s00026-015-0267-8zbMath1316.05129arXiv1304.0902OpenAlexW2075904241MaRDI QIDQ2355281
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Refined enumeration of noncrossing chains and hook formulas ⋮ Enumeration of permutations by the parity of descent positions
Cites Work
- Unnamed Item
- Unnamed Item
- The algebraic combinatorics of snakes
- Parking spaces.
- Principal \(\Gamma\)-cone for a tree
- Refined enumeration of noncrossing chains and hook formulas
- Some aspects of groups acting on finite posets
- Combinatorics of Coxeter Groups
- Chains in the Noncrossing Partition Lattice
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- The calculus of snakes and the combinatorics of Bernoulli, Euler and Springer numbers of Coxeter groups
This page was built for publication: A generalization of Euler numbers to finite Coxeter groups
