We 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-n is also obtained. (C) 2003 Elsevier Science Ltd. All rights reserved
Motivated by a number of recent investigations, we define and investigate the various properties of ...
AbstractWe study Eulerian polynomials as the generating polynomials of the descent statistic over St...
AbstractIn this paper, we focus on applications of q-Euler polynomials and obtain some new combinato...
AbstractWe define and study sub-Eulerian polynomials of type D, which count the elements of the grou...
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...
The cardinalities of the sets of even and odd permutations with a given ascent number are investigat...
16 pages, published in The Electronic Journal of CombinatoricsInternational audienceThe $(q,r)$-Eule...
In this paper, we introduce some new generalizations of classical descent and inversion statistics o...
International audienceLet $ $, $ $, and $$ be the Eulerian numbers in the types A, B, and D, respect...
International audienceLet $ $, $ $, and $$ be the Eulerian numbers in the types A, B, and D, respect...
AbstractIn this paper, the author develops a general formula for numbers which are extensions of the...
The Eulerian numbers count the number of permutations in the symmetric groups with a certain number ...
The classical Eulerian polynomials are defined by setting A(n)(t) = Sigma(sigma is an element of ...
Abstract. In this paper we derive some identities on Eulerian polynomials of higher order from non-l...
Motivated by a number of recent investigations, we define and investigate the various properties of ...
AbstractWe study Eulerian polynomials as the generating polynomials of the descent statistic over St...
AbstractIn this paper, we focus on applications of q-Euler polynomials and obtain some new combinato...
AbstractWe define and study sub-Eulerian polynomials of type D, which count the elements of the grou...
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...
The cardinalities of the sets of even and odd permutations with a given ascent number are investigat...
16 pages, published in The Electronic Journal of CombinatoricsInternational audienceThe $(q,r)$-Eule...
In this paper, we introduce some new generalizations of classical descent and inversion statistics o...
International audienceLet $ $, $ $, and $$ be the Eulerian numbers in the types A, B, and D, respect...
International audienceLet $ $, $ $, and $$ be the Eulerian numbers in the types A, B, and D, respect...
AbstractIn this paper, the author develops a general formula for numbers which are extensions of the...
The Eulerian numbers count the number of permutations in the symmetric groups with a certain number ...
The classical Eulerian polynomials are defined by setting A(n)(t) = Sigma(sigma is an element of ...
Abstract. In this paper we derive some identities on Eulerian polynomials of higher order from non-l...
Motivated by a number of recent investigations, we define and investigate the various properties of ...
AbstractWe study Eulerian polynomials as the generating polynomials of the descent statistic over St...
AbstractIn this paper, we focus on applications of q-Euler polynomials and obtain some new combinato...
DOI