F. RAPALLO

This paper presents the computation of Markov bases for contingency tables when the cell entries are bounded. Markov bases allow a connected random walk on the reference set of the table. Using some theory in Commutative Algebra, we show that a Markov basis for bounded contingency tables is in general different from the Markov basis for...

No description

In this paper we show how to describe sudoku games under the language of design of experiments, and to translate sudoku grids into contingency tables. Then, we present the application of some techniques from Algebraic Statistics to describe the structure of the sudoku grids, at least for the 4 x 4 grids. We also show that this approach has...