On Buckhiester's enumeration of n n matrices

DOI10.1016/0097-3165(74)90021-1MaRDI QIDQ1844671zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• The number of n n matrices of rank r and trace over a finite field

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844671)