AbstractWe define and study sub-Eulerian polynomials of type D, which count the elements of the group of even-signed permutations Dn with respect to the number of descents in a refined sense. The recurrence relations and exponential generating functions of the sub-Eulerian polynomials are determined, by which the solution to a problem of Brenti, concerning the recurrence relation for the Eulerian polynomials of type D, is also obtained
A short report on the lecture at the Conference in honor of W. Killing in Muenster on December 7th, ...
Let $\left\langle{n\atop k}\right\rangle$, $\left\langle{B_n\atop k}\right\rangle$, and $\left\langl...
Abstract: In the present paper, we introduce Eulerian polynomials with parameters a and b and give t...
We define and study sub-Eulerian polynomials of type D, which count the elements of the group of eve...
AbstractWe study in this work properties of a combinatorial expansion of the classical Eulerian poly...
AbstractWe study the polynomials obtained by enumerating a finite Coxeter group by number of descent...
International audienceLet $ $, $ $, and $$ be the Eulerian numbers in the types A, B, and D, respect...
The enumeration of permutations by descents, major index, inversion number, and certain three letter...
In the present paper we generalize the Eulerian numbers (also of the second and third orders). The g...
International audienceLet $ $, $ $, and $$ be the Eulerian numbers in the types A, B, and D, respect...
16 pages, published in The Electronic Journal of CombinatoricsInternational audienceThe $(q,r)$-Eule...
The Eulerian numbers count the number of permutations in the symmetric groups with a certain number ...
We consider the generating polynomial of the number of rooted trees on the set {1,2,...,n} counted b...
Let $\Bigl\langle\matrix{n\cr k}\Bigr\rangle$, $\Bigl\langle\matrix{B_n\crk}\Bigr\rangle$, and $\Big...
The classical Eulerian polynomials are defined by setting A(n)(t) = Sigma(sigma is an element of ...
A short report on the lecture at the Conference in honor of W. Killing in Muenster on December 7th, ...
Let $\left\langle{n\atop k}\right\rangle$, $\left\langle{B_n\atop k}\right\rangle$, and $\left\langl...
Abstract: In the present paper, we introduce Eulerian polynomials with parameters a and b and give t...
We define and study sub-Eulerian polynomials of type D, which count the elements of the group of eve...
AbstractWe study in this work properties of a combinatorial expansion of the classical Eulerian poly...
AbstractWe study the polynomials obtained by enumerating a finite Coxeter group by number of descent...
International audienceLet $ $, $ $, and $$ be the Eulerian numbers in the types A, B, and D, respect...
The enumeration of permutations by descents, major index, inversion number, and certain three letter...
In the present paper we generalize the Eulerian numbers (also of the second and third orders). The g...
International audienceLet $ $, $ $, and $$ be the Eulerian numbers in the types A, B, and D, respect...
16 pages, published in The Electronic Journal of CombinatoricsInternational audienceThe $(q,r)$-Eule...
The Eulerian numbers count the number of permutations in the symmetric groups with a certain number ...
We consider the generating polynomial of the number of rooted trees on the set {1,2,...,n} counted b...
Let $\Bigl\langle\matrix{n\cr k}\Bigr\rangle$, $\Bigl\langle\matrix{B_n\crk}\Bigr\rangle$, and $\Big...
The classical Eulerian polynomials are defined by setting A(n)(t) = Sigma(sigma is an element of ...
A short report on the lecture at the Conference in honor of W. Killing in Muenster on December 7th, ...
Let $\left\langle{n\atop k}\right\rangle$, $\left\langle{B_n\atop k}\right\rangle$, and $\left\langl...
Abstract: In the present paper, we introduce Eulerian polynomials with parameters a and b and give t...