Generating all invertible matrices by row operations

DOI10.1016/J.DISC.2025.114851MaRDI QIDQ6884349zbMATH OpenFDO

Authors Petr Gregor, Hung P. Hoang, Arturo I. Merino, Ondřej Mička

Publication date 15 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114851

zbMATH Keywords

combinatorial Gray codefinite fieldgeneral linear groupgeneration algorithmsHamilton cycleinvertible matrices

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Combinatorial generation via permutation languages. I: Fundamentals
• Combinatorial Gray codes -- an updated survey
• Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
• Hamilton-connected derangement graphs on \(S_ n\)
• scientific article; zbMATH DE number 3733976 (Why is no real title available?)
• scientific article; zbMATH DE number 3801574 (Why is no real title available?)
• scientific article; zbMATH DE number 1436005 (Why is no real title available?)
• scientific article; zbMATH DE number 3257168 (Why is no real title available?)
• Laceable knights
• On generating invertible circulant binary matrices with a prescribed number of ones
• Properly coloured Hamiltonian paths in edge-coloured complete graphs
• Reasons to fall (more) in love with combinatorial reconfiguration
• Solving the sigma-tau problem
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• The Hamilton compression of highly symmetric graphs
• Two generators for the general linear groups over finite fields

This page was built for publication: Generating all invertible matrices by row operations

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