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. Les polynômes eul\Ie ...
Conference paper

Les polynômes eul\IeC èriens stables de type B

Mirkó Visontai (1), Nathan Williams ORCID (2)
(1) Department of Mathematics [Philadelphia]
(2) School of Mathematics
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2011
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
Proceedings
DOI
10.46298/dmtcs.3040
License
https://about.hal.science/hal-authorisation-v1
Indicators
569
Views
605
Downloads

Les polynômes eul\IeC èriens stables de type B

Mirkó Visontai (1), Nathan Williams ORCID (2)
(1) Department of Mathematics [Philadelphia]
(2) School of Mathematics
Abstract
English
We give a multivariate analog of the type B Eulerian polynomial introduced by Brenti. We prove that this multivariate polynomial is stable generalizing Brenti's result that every root of the type B Eulerian polynomial is real. Our proof combines a refinement of the descent statistic for signed permutations with the notion of real stability—a generalization of real-rootedness to polynomials in multiple variables. The key is that our refined multivariate Eulerian polynomials satisfy a recurrence given by a stability-preserving linear operator.
French
Nous prèsentons un raffinement multivariè d'un polynôme eulèrien de type B dèfini par Brenti. En prouvant que ce polynôme est stable nous gènèralisons un rèsultat de Brenti selon laquel chaque racine du polynôme eulèrien de type B est rèelle. Notre preuve combine un raffinement de la statistique des descentes pour les permutations signèes avec la stabilitè—une gènèralisation de la propriètè d'avoir uniquement des racines rèelles aux polynômes en plusieurs variables. La connexion est que nos polynômes eulèriens raffinès satisfont une rècurrence donnèe par un opèrateur linèaire qui prèserve la stabilitè.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • type B Eulerian polynomials
  • polynomials with real roots only
  • stability
Preview
Loading PDF preview...