Showing 2018Show all
2 papers · 1 filter
math.CO2018
On the neighborliness of dual flow polytopes of quivers
Patricio Gallardo, Daniel Mckenzie
In this note we investigate under which conditions the dual of the flow polytope (henceforth referred to as the `dual flow polytope') of a quiver is k-neighborly, for generic weigh…
cs.IT2018
Compressive Sensing for cut improvement and local clustering
Ming-Jun Lai, Daniel Mckenzie
We show how one can phrase the cut improvement problem for graphs as a sparse recovery problem, whence one can use algorithms originally developed for use in compressive sensing (s…