Counting and enumerating frequency tables with given margins - Francesca Greselin - Vita e Pensiero - Articolo Statistica & Applicazioni

Counting and enumerating frequency tables with given margins

digital Counting and enumerating frequency tables with given margins
title Counting and enumerating frequency tables with given margins
publisher Vita e Pensiero
format Article | Pdf
online since 09-2017
issn 18246672 (print)
Write a comment for this product

Ebook format Pdf readable on these devices:

The problem of finding the number of rectangular tables of non-negative integers with given row and column sums occurs in many interesting contexts, mainly in combinatorial problems (counting magic squares, enumerating permutation by descents, etc.) and in statistical applications (studying contingency tables with given margins, testing for independence, etc.). In the present paper a new recursive argument is presented to produce a general expression for the number of m×n tables with given margins. The result has the same expressive force of the one presented by Gail and Mantel (1977), but, remarkably, the counting approach suggests, quite naturally, also a recursive algorithm to explicitly generate the entire class of tables.
This work is a necessary step for studying a new measure of association, based on the relative position that a given table assumes in its class, endowed by an association ordering.

Keywords: Contingency tables, frequency tables, enumeration of contingency tables with given margins, counting contingency tables with given margins.

Author biography

Francesca Greselin, Dipartimento di Metodi Quantitativi per le Scienze Economiche e Aziendali, Università degli Studi di Milano Bicocca, Piazza dell’Ateneo Nuovo 1, Milano, I-20126, Italy (e-mail:

This site or third-party tools used by this make use of cookies necessary for the operation and useful for the purposes outlined in the cookie policy.
If you want to learn more or opt out of all or some cookies, see the cookie policy.
By closing this warning, browsing this page, clicking on a link or continuing to browse otherwise, you consent to the use of cookies.

I Agree