Combinatorial Variations on Cantor's Diagonal
Combinatorics
2011-11-29 v3
Abstract
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative results follow and allow to look at the sub-class of the so- called bi-Cantorian tableaux. We conclude with a correspondence between Cantorian-type tableaux and coloring of hypergraphs having a square number of vertices.
Cite
@article{arxiv.1104.1083,
title = {Combinatorial Variations on Cantor's Diagonal},
author = {Srečko Brlek and Jean-Philippe Labbé and Michel Mendès France},
journal= {arXiv preprint arXiv:1104.1083},
year = {2011}
}