Generalized $q$-Stirling numbers and normal ordering
Roberto B. Corcino, Ken Joffaniel M. Gonzales, Richell O. Celeste

TL;DR
This paper explores generalized $q$-Stirling numbers and their connection to normal ordering, rook numbers, and Bell numbers, providing new formulas, recurrences, and extensions for these combinatorial quantities.
Contribution
It introduces a unified framework for generalized $q$-Stirling numbers, linking them to rook numbers and Bell numbers, with explicit formulas and extensions to real parameters.
Findings
Derived recurrences and explicit formulas for generalized $q$-Stirling numbers.
Established connections between these numbers and rook numbers under a new rule.
Extended rook number models to real parameters s.
Abstract
The normal ordering coefficients of strings consisting of which satisfy () are considered. These coefficients are studied in two contexts: first, as a multiple of a sequence satisfying a generalized recurrence, and second, as -analogues of rook numbers under the row creation rule introduced by Goldman and Haglund. A number of properties are derived, including recurrences, expressions involving other -analogues and explicit formulas. We also give a Dobinsky-type formula for the associated Bell numbers and the corresponding extension of Spivey's Bell number formula. The coefficients, viewed as rook numbers, are extended to the case via a modified rook model.
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
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Algebraic structures and combinatorial models
