PreprintCC BY 4.0arXiv
Enumeration of Upper Triangular Symplectic Renner Monoids
Abstract
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.
Related
- mixed Hodge structures on the strictly upper triangular Lie algebras
- The Karcher Mean on Lie Groups of Upper Triangular Matrices
- D(N)-quadruples in upper-triangular 2×2 integer matrices
- Cardinalities of Jordan Diophantine sets of upper triangular integer matrices
- Weighted Power Means on Upper Triangular Matrix Groups
BibTeX
@misc{koo2026enumeration,
title = {{Enumeration of Upper Triangular Symplectic Renner Monoids}},
author = {Reginald Koo and Zhenheng Li},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.05396},
eprint = {2610.05396},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.05396},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Enumeration of Upper Triangular Symplectic Renner Monoids
AU - Reginald Koo
AU - Zhenheng Li
PY - 2026
DA - 2026/10/04
PB - arXiv
DO - 10.48550/arxiv.2610.05396
UR - https://arxiv.org/abs/2610.05396
AB - 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.
ER -