Combinatorial variations on Cantor's diagonal

  • Authors:

  • Srečko Brlek;Jean-Philippe Labbé;Michel Mendès France

  • Affiliations:

  • LaCIM, Université du Québec í Montréal, C.P. 8888, Succ. Centre-ville, Montréal (QC) H3C 3P8, Canada;Freie Universität Berlin, Arnimallee 2, 14195 Berlin, Germany;Département de mathématiques, UMR 5251, Université Bordeaux 1, 351 cours de la Libération, F-33405 Talence cedex, France

  • Venue:
  • Journal of Combinatorial Theory Series A
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We 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.