Irreducible characters and bitrace for the $q$-rook monoid
Naihuan Jing, Yu Wu, Ning Liu
TL;DR
The paper develops a computation-friendly character theory for the $q$-rook monoid algebra $R_n(q)$ by employing vertex operator techniques to produce a new iterative formula for irreducible characters $\\chi^{\lambda}_{\mu}(q)$ and a rederivation of the Murnaghan–Nakayama rule. It introduces compact closed forms for hook and two-row shapes and extends the framework with the bitrace, a deformed orthogonality relation, providing a general combinatorial formula based on weighted integer matrices. The approach hinges on a Frobenius-type formula connecting characters to modified Hall–Littlewood/ribbon-type symmetric functions and the vertex operator realization of Schur functions. The work yields practical computational tools and includes explicit character data for $|\mu|=5$ in the appendix, broadening the understanding of $R_n(q)$-representations and their connections to Hecke-algebraic structures.
Abstract
This paper studies irreducible characters of the $q$-rook monoid algebra $R_n(q)$ using the vertex algebraic method. Based on the Frobenius formula for $R_n(q)$, a new iterative character formula is derived with the help of the vertex operator realization of the Schur symmetric function. The same idea also leads to a simple proof of the Murnaghan-Nakayama rule for $R_n(q)$. We also introduce the bitrace for the $q$-rook monoid and derive its combinatorial formula as a generalization of the bitrace formula for the Iwahori-Hecke algebra. The character table of $R_n(q)$ with $|μ|=5$ is listed in the appendix.
