The descent statistic on signed simsun permutations

TL;DR

This paper investigates the generating polynomials for signed simsun permutations, focusing on their properties such as recurrence relations and generating functions, to deepen understanding of their combinatorial structure.

Contribution

It introduces new recurrence relations and generating functions for the descent statistics on signed simsun permutations, advancing combinatorial enumeration methods.

Findings

Derived recurrence relations for the polynomials

Established generating functions for descent enumeration

Analyzed properties of the polynomials

Abstract

In this paper we study the generating polynomials obtained by enumerating signed simsun permutations by number of the descents. Properties of the polynomials, including the recurrence relations and generating functions are studied.