On the number of isohedral polyominoes
From MaRDI portal
Publication:6570128
DOI10.22405/2226-8383-2024-25-1-138-154zbMATH Open1543.05021MaRDI QIDQ6570128FDOQ6570128
Al'bina Andreevna Mokrova, Anton Shutov
Publication date: 10 July 2024
Published in: Chebyshevskiĭ Sbornik (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Polyominoes (05B50) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Cites Work
- Title not available (Why is that?)
- Checker Boards and Polyominoes
- Planar tilings by polyominoes, polyhexes, and polyiamonds
- On the tiling by translation problem
- On translating one polyomino to tile the plane
- Tilings by translation: enumeration by a rational language approach
- Isohedral polyomino tiling of the plane
- Will It Tile? Try the Conway Criterion!
- An algorithm for deciding if a polyomino tiles the plane
- The eighty-one types of isohedral tilings in the plane
- A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
- Polymorphic Polyominoes
- Tiling complexity of small n-ominoes \((N<10)\)
- Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry
- Title not available (Why is that?)
- Mathematical problems. Lecture delivered before the international congress of mathematicians at Paris in 1900. Translated by \textit{Mary Winston Newson}.
- John Conway, tilings, and me
- Title not available (Why is that?)
- A method to generate polyominoes and polyiamonds for tilings with rotational symmetry
- On the Number of p4-Tilings by an n-Omino
This page was built for publication: On the number of isohedral polyominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570128)
