Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On some generalized ...
Conference paper

On some generalized $q$-Eulerian polynomials

Zhicong Lin (1) (2)
(1) Institut Camille Jordan
(2) Department of Mathematics and Statistics [Lanzhou]
Download article
Open on HAL
Imported on
November 20, 2016
Published on
December 31, 2012
Last modified on
April 1, 2025
Volume
DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Proceedings
DOI
10.46298/dmtcs.12822
License
https://about.hal.science/hal-authorisation-v1
Indicators
407
Views
591
Downloads

On some generalized $q$-Eulerian polynomials

Zhicong Lin (1) (2)
(1) Institut Camille Jordan
(2) Department of Mathematics and Statistics [Lanzhou]
Abstract
English
The $(q,r)$-Eulerian polynomials are the $(\mathrm{maj-exc, fix, exc})$ enumerative polynomials of permutations. Using Shareshian and Wachs' exponential generating function of these Eulerian polynomials, Chung and Graham proved two symmetrical $q$-Eulerian identities and asked for bijective proofs. We provide such proofs using Foata and Han's three-variable statistic $(\mathrm{inv-lec, pix, lec})$. We also prove a new recurrence formula for the $(q,r)$-Eulerian polynomials and study a $q$-analogue of Chung and Graham's restricted Eulerian polynomials. In particular, we obtain a symmetrical identity for these restricted $q$-Eulerian polynomials with a combinatorial proof.
French
Les $(q; r)$-polynômes Eulériens sont les polynômes énumératifs des permutations par rapport au poids $(\mathrm{maj-exc, fix, exc})$. En utilisant la fonction génératrice de ces polynômes Eulériens due à Shareshien et Wachs, Chung et Graham ont démontré deux identités symétriques $q$-Eulériennes et demandé des preuves bijectives. Nous donnons de telles preuves en utilisant les statistiques trivariées $(\mathrm{inv-lec, pix, lec})$ de Foata et Han. Nous démontrons aussi une nouvelle récurrence pour ces $(q; r)$-polynômes Eulériens et étudions un $q$-analogue des polynômes Eulériens restreints de Chung et Graham. En particulier, nous obtenons une identité symétrique pour ces $q$-polynômes Eulériens restreints avec une preuve combinatoire.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Eulerian numbers
  • symmetrical Eulerian identities
  • hook factorization
  • descents
  • admissible inversions
Preview
Loading PDF preview...