Combinatorial variations on Cantor's diagonal
From MaRDI portal
(Redirected from Publication:662034)
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.
Recommendations
- Combinatorics of the diagonal harmonics
- The Cantor diagonal
- scientific article; zbMATH DE number 3017953
- Variations of a combinatorial problem on finite sets
- Combinatorial variations on geometric topics
- scientific article; zbMATH DE number 4004151
- Combinatorial analog of the Melvin-Morton conjecture
- Combinatorics of diagrams of permutations
- Combinatorics of diagrams of permutations
- A combinatorial analog of a theorem of F.J. Dyson
Cites work
This page was built for publication: Combinatorial variations on Cantor's diagonal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662034)