Poincaré polynomials of generic torus orbit closures in Schubert varieties

The closure of a generic torus orbit in the flag variety G / B G/B of type A A is known to be a permutohedral variety, and its Poincaré polynomial agrees with the Eulerian polynomial. In this paper, we study the Poincaré polynomial of a generic torus orbit closure in a Schubert variety in G / B G/B . When the generic torus orbit closure in a Schubert variety is smooth, its Poincaré polynomial is known to agree with a certain generalization of the Eulerian polynomial. We extend this result to an arbitrary generic torus orbit closure which is not necessarily smooth.

Gamma Positivity of the Descent Based Eulerian Polynomial in Positive Elements of Classical Weyl Groups

The Eulerian polynomial $A_n(t)$ enumerating descents in $\mathfrak{S}_n$ is known to be gamma positive for all $n$. When enumeration is done over the type B and type D Coxeter groups, the type B and type D Eulerian polynomials are also known to be gamma positive for all $n$. We consider $A_n^+(t)$ and $A_n^-(t)$, the polynomials which enumerate descents in the alternating group $\mathcal{A}_n$ and in $\mathfrak{S}_n - \mathcal{A}_n$ respectively. We show the following results about $A_n^+(t)$ and $A_n^-(t)$: both polynomials are gamma positive iff $n \equiv 0,1$ (mod 4). When $n \equiv 2,3$ (mod 4), both polynomials are not palindromic. When $n \equiv 2$ (mod 4), we show that {\sl two} gamma positive summands add up to give $A_n^+(t)$ and $A_n^-(t)$. When $n \equiv 3$ (mod 4), we show that {\sl three} gamma positive summands add up to give both $A_n^+(t)$ and $A_n^-(t)$. We show similar gamma positivity results about the descent based type B and type D Eulerian polynomials when enumeration is done over the positive elements in the respective Coxeter groups. We also show that the polynomials considered in this work are unimodal.

A two-sided analogue of the Coxeter complex

International audience For any Coxeter system (W, S) of rank n, we introduce an abstract boolean complex (simplicial poset) of dimension 2n − 1 which contains the Coxeter complex as a relative subcomplex. Faces are indexed by triples (J,w,K), where J and K are subsets of the set S of simple generators, and w is a minimal length representative for the double parabolic coset WJ wWK . There is exactly one maximal face for each element of the group W . The complex is shellable and thin, which implies the complex is a sphere for the finite Coxeter groups. In this case, a natural refinement of the h-polynomial is given by the “two-sided” W -Eulerian polynomial, i.e., the generating function for the joint distribution of left and right descents in W .

A Two-Sided Analogue of the Coxeter Complex

For any Coxeter system $(W,S)$ of rank $n$, we study an abstract boolean complex (simplicial poset) of dimension $2n-1$ that contains the Coxeter complex as a relative subcomplex. For finite $W$, this complex is first described in work of Hultman. Faces are indexed by triples $(I,w,J)$, where $I$ and $J$ are subsets of the set $S$ of simple generators, and $w$ is a minimal length representative for the parabolic double coset $W_I w W_J$. There is exactly one maximal face for each element of the group $W$. The complex is shellable and thin, which implies the complex is a sphere for the finite Coxeter groups. In this case, a natural refinement of the $h$-polynomial is given by the "two-sided" $W$-Eulerian polynomial, i.e., the generating function for the joint distribution of left and right descents in $W$.

On Two-Sided Gamma-Positivity for Simple Permutations

Gessel conjectured that the two-sided Eulerian polynomial, recording the common distribution of the descent number of a permutation and that of its inverse, has non-negative integer coefficients when expanded in terms of the gamma basis. This conjecture has been proved recently by Lin.We conjecture that an analogous statement holds for simple permutations, and use the substitution decomposition tree of a permutation (by repeated inflation) to show that this would imply the Gessel-Lin result. We provide supporting evidence for this stronger conjecture.

A Note on the $\gamma$-Coefficients of the Tree Eulerian Polynomial

We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent generating polynomial of the set of permutations of a totally ordered $n$-set, known as the Eulerian polynomial. We show how this extension shares some of the properties of the classical one. A classical product formula shows that this polynomial factors completely over the integers. From this product formula it can be concluded that this polynomial has positive coefficients in the $\gamma$-basis and we show that a formula for these coefficients can also be derived. We discuss various combinatorial interpretations of these coefficients in terms of leaf-labeled binary trees and in terms of the Stirling permutations introduced by Gessel and Stanley. These interpretations are derived from previous results of Liu, Dotsenko-Khoroshkin, Bershtein-Dotsenko-Khoroshkin, González D'León-Wachs and Gonzláez D'León related to the free multibracketed Lie algebra and the poset of weighted partitions.

Eulerian polynomials of type $D$ have only real roots

International audience We give an intrinsic proof of a conjecture of Brenti that all the roots of the Eulerian polynomial of type $D$ are real and a proof of a conjecture of Dilks, Petersen, and Stembridge that all the roots of the affine Eulerian polynomial of type $B$ are real, as well. Nous prouvons, de façon intrinsèque, une conjecture de Brenti affirmant que toutes les racines du polynôme eulérien de type $D$ sont réelles. Nous prouvons également une conjecture de Dilks, Petersen, et Stembridge que toutes les racines du polynôme eulérien affine de type $B$ sont réelles.

Descents of Permutations in a Ferrers Board

The classical Eulerian polynomials are defined by setting $$A_n(t)= \sum_{\sigma \in \mathfrak{S}_n} t^{1+\mathrm{des}(\sigma)}= \sum_{k=1}^n A_{n,k} t^k$$where $A_{n,k}$ is the number of permutations of length $n$ with $k-1$ descents. Let $A_n(t, q) = \sum_{\pi \in \mathfrak{S}_n} t^{1+{\rm des}(\pi)}q^{{\rm inv}(\pi)} $ be the $\mathrm{inv}$ $q$-analogue of the classical Eulerian polynomials whose generating function is well known: \begin{eqnarray}\sum_{n \geq 0} \frac{u^n A_n(t, q)}{[n]_q!} = \frac{1}{\displaystyle 1-t\sum_{k \geq 1} \frac{(1-t)^ku^k}{[k]_q!}}.\qquad\qquad(*)\label{perm_gf abs}\end{eqnarray}In this paper we consider permutations restricted in a Ferrers board and study their descent polynomials. For a general Ferrers board $F$, we derive a formula in the form of permanent for the restricted $q$-Eulerian polynomial $$A_F(t,q) := \sum_{\sigma \in F} t^{1+{\rm des}(\sigma)} q^{{\rm inv}(\sigma)}.$$ If the Ferrers board has the special shape of an $n\times n$ square with a triangular board of size $s$ removed, we prove that $A_F(t,q)$ is a sum of $s+1$ terms, each satisfying an equation that is similar to (*). Then we apply our results to permutations with bounded drop (or excedance) size, for which the descent polynomial was first studied by Chung et al. (European J. Combin., 31(7) (2010):1853-1867). Our method presents an alternative approach.

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

International audience 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. 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è.