4 papers
On the Hardness of Short and Sign-Compatible Circuit Walks
Steffen Borgwardt, Weston Grewe, Sean Kafer +2
The circuits of a polyhedron are a superset of its edge directions. Circuit walks, a sequence of steps along circuits, generalize edge walks and are "short" if they have few steps…
On the Diameter of a 2-Sum of Polyhedra
Steffen Borgwardt, Weston Grewe, Jon Lee
The study of the combinatorial diameter of a polyhedron is a classical topic in linear-programming theory due to its close connection with the possibility of a polynomial simplex-m…
On the Combinatorial Diameters of Parallel and Series Connections
Steffen Borgwardt, Weston Grewe, Jon Lee
The investigation of combinatorial diameters of polyhedra is a classical topic in linear programming due to its connection with the possibility of an efficient pivot rule for the s…
Non-parallel Flat Portions on the Boundaries of Numerical Ranges of 4-by-4 Nilpotent Matrices
Mackenzie Cox, Weston M. Grewe, Grace K. Hochrein +2
The 4-by-4 nilpotent matrices the numerical ranges of which have non-parallel flat portions on their boundary that are on lines equidistant from the origin are characterized. Their…