Combinatorial variations on Cantorʼs diagonal

AbstractWe discuss counting problems linked to finite versions of Cantorʼs diagonal of infinite tableaux. We extend previous results of Brlek et al. (2004) [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