Some Quick Formulas for the Volumes of and the Number of Integer Points in Higher-dimensional Polyhedra
Apparaît dans la collection : Representations, Probability, and Beyond : A Journey into Anatoly Vershik’s World
In this talk, based on joint works with J.A. Hartigan and with M. Rudelson, I discuss some computationally efficient formulas, motivated by the maximum entropy principle from statistical physics, to approximate the volume of and count integer points in some combinatorially interesting families of higher-dimensional polyhedra.
