Arturo Merino

activity

20242026

collaborators

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 $conv (X)$ , where $X \subseteq {0, 1}^{n}$ …

math.CO2025

Minimum maximal matchings in permutahedra

Sofia Brenner, Jiří Fink, Hung. P. Hoang +2

We prove that the minimal size $M (π_{n})$ of a maximal matching in the permutahedron $π_{n}$ is asymptotically $n! /3$ . On the one hand, we obtain a lower bound $M(π_n) \ge n! (n-1) / (…

math.CO2024

Generating all invertible matrices by row operations

Petr Gregor, Hung P. Hoang, Arturo Merino +1

We show that all invertible $n \times n$ matrices over any finite field $F_{q}$ can be generated in a Gray code fashion. More specifically, there exists a listing such that…