The Eulerian generating function of \(q\)-derangements (Q2501554)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Eulerian generating function of q-derangements |
scientific article; zbMATH DE number 5054410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Eulerian generating function of \(q\)-derangements |
scientific article; zbMATH DE number 5054410 |
Statements
The Eulerian generating function of \(q\)-derangements (English)
0 references
14 September 2006
0 references
Let \(d_q(n,k)\) denote the number of \(n\times n\) matrices over the finite field \(\mathbb{F}_q\) for which the sum of the dimensions of their eigenspaces is equal to \(k\). The Eulerian generating function of \(d_q(n):=d_q(n,0)\), that is, of the number of eigenvalue-free \(n\times n\) matrices over \(\mathbb{F}_q\) (so-called \(q\)-derangements) has been well studied using tools as the rational canonical form and nilpotent matrices. The author gives the following Eulerian bivariate generating function for \(d_q(n,k)\) taking an elementary approach based on Möbius inversion: \[ \sum_{n,k\geq0} d_q(n,k)y^k\frac{x^n}{q^{n\choose 2}({\mathbf n})!}= \bigg(\sum_{n\geq0}(y-1)(y-q)\cdots(y-q^{n-1})\frac{x^n}{q^{n\choose 2}({\mathbf n})!}\bigg)^q \bigg(\sum_{n\geq0}q^{n^2}\frac{x^n}{q^{n\choose 2}({\mathbf n})!}\bigg). \]
0 references
\(q\)-analogue of derangements
0 references
eigenvalue-free matrices over finite fields
0 references
0 references
0.7631425261497498
0 references
0.7548215985298157
0 references
0.7489970326423645
0 references