Orders of Finite Reductive Monoids
Zhuo Li, Zhenheng Li, and You'an Cao

TL;DR
This paper derives formulas to compute the orders of finite reductive monoids, applies them to specific classes including symplectic monoids, and explores their connections to algebraic invariants like Betti numbers.
Contribution
It introduces four formulas for calculating orders of finite reductive monoids and applies these to various classes, including symplectic monoids, with explicit formulas and connections to algebraic topology.
Findings
Formulas for orders of finite reductive monoids are established.
Explicit order formulas for symplectic monoids are provided.
Connections to H-polynomials and Betti numbers are demonstrated.
Abstract
We show four formulas for calculating the orders of finite reductive monoids with zero. As applications, these formulas are then used to calculate the orders of finite reductive monoids induced from the -split -irreducible monoids where is a simple algebraic group over the algebraic closure of , and is the irreducible representation associated with any dominant weight. Finally, we give an explicit formula for the orders of finite symplectic monoids associated with the last fundamental dominant weight of type ; the connections to -polynomials and Betti numbers are shown.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · semigroups and automata theory · Geometric and Algebraic Topology
