Abstract
We define and study sub-Eulerian polynomials of type D, which count the elements of the group of even-signed permutations D n 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
