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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
