1 citations · 1 across the 6 of their papers we have counts for
6 papers
Sampling planar tanglegrams and pairs of disjoint triangulations
Alexander E. Black, Kevin Liu, Alex Mcdonough +4
A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that th…
Realizable Standard Young Tableaux
Igor Araujo, Alexander E. Black, Amanda Burcroff +3
Given two vectors and , their outer sum is given by the matrix with entries . If the entries of and are increasing and sufficiently gener…
On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture
Alexander E. Black, Steffen Borgwardt, Matthias Brugger
Circuit diameters of polyhedra are a fundamental tool for studying the complexity of circuit augmentation schemes for linear programming and for finding lower bounds on combinatori…
Underlying Flag Polymatroids
Alexander E. Black, Raman Sanyal
We describe a natural geometric relationship between matroids and underlying flag matroids by relating the geometry of the greedy algorithm to monotone path polytopes. This perspec…
Small Shadows of Lattice Polytopes
Alexander E. Black
The diameter of the graph of a -dimensional lattice polytope is known to be at most due to work by Kleinschmidt and Onn. However, it is an open ques…
The Polyhedral Geometry of Pivot Rules and Monotone Paths
Alexander E. Black, Jesús A. De Loera, Niklas Lütjeharms +1
Motivated by the analysis of the performance of the simplex method we study the behavior of families of pivot rules of linear programs. We introduce normalized-weight pivot rules w…