Hung P. Hoang

activity

20242026

collaborators

4 papers

math.CO2026

Splitting Sandwiches Unevenly via Unique Sink Orientations and Rainbow Arrangements

Michaela Borzechowski, Sebastian Haslebacher, Hung P. Hoang +2

The famous Ham-Sandwich theorem states that any $d$ point sets in $R^{d}$ can be simultaneously bisected by a single hyperplane. The $I^\pm$ -Ham-Sandwich theorem gives a suffic…

cs.CG2025

Flipping odd matchings in geometric and combinatorial settings

Oswin Aichholzer, Sofia Brenner, Joseph Dorfer +4

We study the problem of reconfiguring odd matchings, that is, matchings that cover all but a single vertex. Our reconfiguration operation is a so-called flip where the unmatched ve…

math.CO2025

Minimum maximal matchings in permutahedra

Sofia Brenner, JiÅÃ Fink, Hung. P. Hoang +2

We prove that the minimal size $M (I ¨ _{n})$ of a maximal matching in the permutahedron $I ¨ _{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…