Enumeration of Upper Triangular Symplectic Renner Monoids
In this paper, we compute the orders of upper triangular symplectic Renner monoids using admissible sets. We obtain both recursive and closed-form formulas for these orders. We then derive their exponential generating functions and establish connections between these functions and the Laguerre polynomials.
math.CO↗