On the Eulerian Polynomials of Type D
Abstract
We introduce sub-Eulerian polynomials to count elements of Dn by which a recurrence relation for the Eulerian polynomials of type D is obtained.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.