activity
20002019
most citedQuantum Max-flow/Min-cut

27 citations · 29 across the 6 of their papers we have counts for

collaborators

7 papers

econ.TH2019

Guarantees in Fair Division: general or monotone preferences

Anna bogomolnaia, Herve Moulin

To divide a "manna" Ω of private items (commodities, workloads, land, time intervals) between n agents, the worst case measure of fairness is the welfare guaranteed to each agent,…

math.RT2016

A lower bound for the dimension of a highest weight module

Daniel Goldstein, Robert Guralnick, Richard Stong

For each integer and each complex simple Lie algebra , we determine the least dimension of an irreducible highest weight representation of whose…

math.CO2015★ 27 cited

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…

math.HO2015

Partition and sum is fast

Steve Butler, Ron Graham, Richard Stong

We consider the following "partition and sum" operation on a natural number: Treating the number as a long string of digits insert several plus signs in between some of the digits…

math.DG2006★ 1 cited

Comparing Corresponding Dihedral Angles on Classical Geometric Simplices

Thomas Kwok-keung Au, Feng Luo, Richard Stong

In this article, we prove a theorem comparing the dihedral angles of simplices in the hyperbolic, spherical and Euclidean geometries.

math.GT2002

Lengths of simple loops on surfaces with hyperbolic metrics

Feng Luo, Richard Stong

Given a compact orientable surface of negative Euler characteristic, there exists a natural pairing between the Teichmueuller space of the surface and the set of homotopy classes o…