30 citations · 42 across the 12 of their papers we have counts for
5 papers · 1 filter
Efficient Determinant Maximization for All Matroids
Adam Brown, Aditi Laddha, Madhusudhan Pittu +1
Determinant maximization provides an elegant generalization of problems in many areas, including convex geometry, statistics, machine learning, fair allocation of goods, and networ…
Enhanced Bishop-Gromov Theorem
Adam R. Brown, Michael H. Freedman
The Bishop-Gromov theorem upperbounds the rate of growth of volume of geodesic balls in a space, in terms of the most negative component of the Ricci curvature. In this paper we pr…
Discrete Microlocal Morse Theory
Adam Brown, Ondrej Draganov
We establish several results combining discrete Morse theory and microlocal sheaf theory in the setting of finite posets and simplicial complexes. Our primary tool is a computation…
Determinant Maximization via Matroid Intersection Algorithms
Adam Brown, Aditi Laddha, Madhusudhan Pittu +2
Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \cite{pukelsheim2006optimal}, convex geometry \cite{Khach…
Polynomial Equivalence of Complexity Geometries
Adam R. Brown
This paper proves the polynomial equivalence of a broad class of definitions of quantum computational complexity. We study right-invariant metrics on the unitary group -- often cal…