3 papers
cs.DS2026
Faster and simpler traversal of 0/1-polytopes
Jiří Fink, Petr Hladík, Arturo Merino +2
Recently, Merino and Mütze (FOCS'23+SICOMP'24) presented an algorithm for computing a Hamilton path on the skeleton of any 0/1-polytope , where …
math.CO2024
Generating all invertible matrices by row operations
Petr Gregor, Hung P. Hoang, Arturo Merino +1
We show that all invertible matrices over any finite field can be generated in a Gray code fashion. More specifically, there exists a listing such that…
math.CO2022
Combinatorial generation via permutation languages. V. Acyclic orientations
Jean Cardinal, Hung P. Hoang, Arturo Merino +2
In 1993, Savage, Squire, and West described an inductive construction for generating every acyclic orientation of a chordal graph exactly once, flipping one arc at a time. We provi…