AbstractsMathematics

Volumes and Integer Points of Multi-Index Transportation Polytopes.

by David T. Benson-Putnins




Institution: University of Michigan
Department: Mathematics
Degree: PhD
Year: 2015
Keywords: combinatorics; integer points; transportation polytope; Fourier analysis; Asymptotic counting; Mathematics; Science
Record ID: 2060967
Full text PDF: http://hdl.handle.net/2027.42/111456


Abstract

Counting the integer points of transportation polytopes has important applications in statistics for tests of statistical significance, as well as in several applications in combinatorics. In this dissertation, we derive asymptotic formulas for the number of integer and binary integer points in a wide class of multi-index transportation polytopes. A simple closed form approximation is given as the size of the corresponding arrays goes to infinity. A formula for the volume of $4$-index transportation polytopes is also given. We follow the approach of Barvinok and Hartigan to estimate the quantities through a type of local Central Limit Theorem. By carefully estimating eigenvalues and eigenvectors of certain quadratic forms, we are able to prove strong concentration results for the corresponding multivariate Gaussian random variables. We also estimate correlations between linear functions of Gaussian random variables to produce concentration results for the distribution of certain exponential functions. Combined, these techniques allow us to give a complete accounting of the integrals of several functions that are key to estimating the number of integer or binary integer points in multi-index transportation polytopes. As an additional result, we transform a standard concentration of measure on the sphere argument to a concentration result for Gaussian measures whose quadratic forms contain several small eigenvalues, allowing a similar calculation for the volume of multi-index transportation polytopes.