On Buckhiester's enumeration of \(n \times n\) matrices

DOI10.1016/0097-3165(74)90021-1zbMath0284.05008OpenAlexW2009691121MaRDI QIDQ1844671

Edward A. Bender

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(74)90021-1

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items (5)

Enumerating traceless matrices over compact discrete valuation rings ⋮ Rank-metric codes and their duality theory ⋮ Enumerating classes and characters of 𝑝-groups ⋮ Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints ⋮ Strongly regular matrices revisited

Cites Work

• The number of \(n \times n\) matrices of rank r and trace \(\alpha\) over a finite field

This page was built for publication: On Buckhiester's enumeration of \(n \times n\) matrices