TL;DR
This paper studies domino tilings of specific graph grids, representing tilings with linear-recurrent sequences and discovering new mathematical dependencies not listed in OEIS.
Contribution
It introduces novel dependencies for domino tilings of graph grids, expanding the mathematical understanding beyond existing OEIS sequences.
Findings
Representation of tilings via linear-recurrent sequences
Discovery of new dependencies not in OEIS
Enhanced understanding of domino tilings on graph grids
Abstract
This article is dedicated to domino tilings of certain types of graph grids. For each of these grids, the domino tilings are represented using linear-recurrent sequences. New dependencies are proved that are not included in Neil Sloane's Online Encyclopedia of Integer Sequences (OEIS).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Advanced Combinatorial Mathematics · semigroups and automata theory