Brunn-Minkowski Inequalities for Contingency Tables and Integer Flows
Alexander Barvinok
Abstract
Given a non-negative mxn matrix W=(wij) and positive integer vectors R=(r1, >..., rm) and C=(c1, ..., cn), we consider the total weight T(R, C; W) of mxn non-negative integer matrices (contingency tables) D with the row sums ri, the column sums cj, and the weight of D=(dij) equal to product of wijdij. In particular, if W is a 0-1 matrix, T(R, C; W) is the number of integer feasible flows in a bipartite network. We prove a version of the Brunn-Minkowski inequality relating the numbers T(R, C; W) and T(Rk, Ck; W), where (R, C) is a convex combination of (Rk, Ck) for k=1, ..., p.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.