Enumerating alternating matrix spaces over finite fields with explicit coordinates
DOI10.1016/j.disc.2021.112580zbMath1485.05079arXiv2007.05108OpenAlexW3194629817MaRDI QIDQ1981706
Publication date: 6 September 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.05108
\(q\)-calculusalternating bilinear mapsalternating matrix spacesEulerian generating functionslabelled graph enumeration
Exact enumeration problems, generating functions (05A15) (q)-calculus and related topics (05A30) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposing \(p\)-groups via Jordan algebras.
- The Eulerian generating function of \(q\)-derangements
- Graphs on unlabelled nodes with a given number of edges
- Existence, algorithms, and asymptotics of direct product decompositions, I
- Enumeration Of Labelled Graphs
- The Number of k-Coloured Graphs on Labelled Nodes
- From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces
- Group-theoretic generalisations of vertex and edge connectivities
- On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
- Asymmetric graphs
- The Factorization of Linear Graphs
- Quantum calculus
This page was built for publication: Enumerating alternating matrix spaces over finite fields with explicit coordinates