A Finiteness Theorem in Algebraic StatisticsBernd SturmfelsBerkeley
December 11,

ABSTRACT


The set of all nonnegative integer pxqtables with fixed row sums and column sums can be connected by local moves involving changes in 2x2subtables in each step. The difficult question of finding analogous moves for random walks on higherdimensional contingency tables arises in statistics. Aoki and Takemura proved recently that 3x3xrtables can be connected by moves of format 3x3x5, and they conjectured a similar finiteness theorem for pxqxrtables when p and q are fixed and r increases. In this talk we prove their conjecture, by developing a general theory of higher Lawrence polytopes. Joint work with Francisco Santos (math.CO/0209326) 
Combinatorics Seminar, Mathematics Department, MIT, sara(atsign)math.mit.edu 

