William Hua

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will(More)
Let ∆(d, n) be the maximum possible diameter of the vertex-edge graph over all d-dimensional polytopes defined by n inequalities. The Hirsch bound holds for particular n and d if ∆(d, n) ≤ n − d. Francisco San-tos recently resolved a question open for more than five decades by showing that ∆(d, 2d) = d + 1 for d = 43; the dimension was then lowered to 20 by(More)
  • 1