Matrices with restricted entries and q-analogues of permutations
From MaRDI portal
(Redirected from Publication:446005)
Matrices with restricted entries and \(q\)-analogues of permutations
Matrices with restricted entries and \(q\)-analogues of permutations
Abstract: We study the functions that count matrices of given rank over a finite field with specified positions equal to zero. We show that these matrices are -analogues of permutations with certain restricted values. We obtain a simple closed formula for the number of invertible matrices with zero diagonal, a -analogue of derangements, and a curious relationship between invertible skew-symmetric matrices and invertible symmetric matrices with zero diagonal. In addition, we provide recursions to enumerate matrices and symmetric matrices with zero diagonal by rank, and we frame some of our results in the context of Lie theory. Finally, we provide a brief exposition of polynomiality results for enumeration questions related to those mentioned, and give several open questions.
Recommendations
- scientific article; zbMATH DE number 6683614
- Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams
- The Eulerian generating function of \(q\)-derangements
- \(q\)-analogs of the inclusion-exclusion principle and permutations with restricted position
- Permutation polynomials on symmetric matrices
Cited in
(16)- scientific article; zbMATH DE number 6683614 (Why is no real title available?)
- Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams
- \(q\)-analogs of the inclusion-exclusion principle and permutations with restricted position
- Almost all permutation matrices have bounded saturation functions
- Homotopy cardinality via extrapolation of Morava-Euler characteristics
- The Eulerian generating function of \(q\)-derangements
- Combinatorics of diagrams of permutations
- Rook theory of the finite general linear group
- Enumerating traceless matrices over compact discrete valuation rings
- Enumerating alternating matrix spaces over finite fields with explicit coordinates
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Duality of codes supported on regular lattices, with an application to enumerative combinatorics
- Linear relations with disjoint supports and average sizes of kernels
- Jacobi-Trudi determinants over finite fields
- Probability theory for random groups arising in number theory
- Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints
This page was built for publication: Matrices with restricted entries and \(q\)-analogues of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q446005)