55 citations · 97 across the 4 of their papers we have counts for
5 papers
Quantum Max-flow/Min-cut
Shawn X. Cui, Michael H. Freedman, Or Sattath +2
The classical max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. By associating an integ…
Optimal simplices and codes in projective spaces
Henry Cohn, Abhinav Kumar, Gregory Minton
We find many tight codes in compact spaces, i.e., optimal codes whose optimality follows from linear programming bounds. In particular, we show the existence (and abundance) of sev…
Improved Concentration Bounds for Count-Sketch
Gregory T. Minton, Eric Price
We present a refined analysis of the classic Count-Sketch streaming heavy hitters algorithm [CCF02]. Count-Sketch uses O(k log n) linear measurements of a vector x in R^n to give a…
Voting, the symmetric group, and representation theory
Zajj Daugherty, Alexander K. Eustis, Gregory Minton +1
We show how voting may be viewed naturally from an algebraic perspective by viewing voting profiles as elements of certain well-studied -modules. By using only a han…
A new mechanism for non-locality from string theory: UV-IR quantum entanglement and its imprints on the CMB
Gregory Minton, Vatche Sahakian
Puff field theories (PFT) arise as the decoupling limits of D3 branes in a Melvin universe and exhibit spatially non-local dynamics. Unlike other realizations of non-locality in st…