Showing math.COShow all
2 papers · 1 filter
math.CO2026
A simplified min-max formula for the inverse arborescence problem
András Frank, Hanna Szabrina Horváth
A simple min-max theorem is formulated and proved for the smallest modification (measured in -norm) of an input cost function that makes a target arborescence of a…
math.CO2025
Prefix-bounded matrices
Nóra A. Borsik, András Frank, Péter Madarasi +1
By unifying various earlier extensions of alternating sign matrices (ASMs), we introduce the notion of prefix-bounded matrices (PBMs). It is shown that the convex hull of these mat…