Chebyshevskii Sbornik
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Chebyshevskii Sb.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Chebyshevskii Sbornik, 2024, Volume 25, Issue 1, Pages 138–154
DOI: https://doi.org/10.22405/2226-8383-2024-25-1-138-154
(Mi cheb1407)
 

On the number of isohedral polyominoes

A. V. Shutov, А. А. Mokrova

Vladimir State University named after Alexander and Nikolay Stoletovs (Vladimir)
References:
Abstract: A polyomino is a connected figure on a plane composed from a finite number of unit squares adjacent to each other on the sides. A tiling of a plane into polyominoes is called isohedral if the symmetry group acts transitively on it, that is, if for any two polyominoes of the tiling there is a global symmetry of the tiling that moves one polyomino into the second.
The paper considers the problem of counting the number of polyominoes of area $n$ that generate isohedral tilings of the plane. It is shown that the number of such polyominoes does not exceed $C(\varepsilon)n^4(\omega+\varepsilon)^n$, where $\omega$ is the connective constant of the square lattice $\mathbb{Z}^2$. It is known that $\omega<2.7$. Similar estimates were also obtained in the case where the perimeter rather than the area of the polyomino is fixed. In addition, a similar estimate is valid for the number of isohedral tilings of the plane themselves under the additional condition of regularity of the tilings.
Previously, similar results were obtained in the case of lattice tilings of the plane into polyominoes, for the so-called $p2$-tiditgs splits, as well as for lattice tilings into centrally symmetric polyominoes.
The proof is based on the criteria for the existence of an isohedral tiling of the plane into polyominoes obtained by Langerman and Winslow, as well as on counting the number of self-avoiding random walks on the lattice $\mathbb{Z}^2$, both standard and with a given symmetry group.
In conclusion, possible directions for further research and some open problems are briefly discussed.
Keywords: polyominoes, isohedral polyominoes, plane tilings, isohedrality criteria.
Received: 18.12.2023
Accepted: 21.03.2024
Document Type: Article
UDC: 514.174.5
Language: Russian
Citation: A. V. Shutov, А. А. Mokrova, “On the number of isohedral polyominoes”, Chebyshevskii Sb., 25:1 (2024), 138–154
Citation in format AMSBIB
\Bibitem{ShuMok24}
\by A.~V.~Shutov, А.~А.~Mokrova
\paper On the number of isohedral polyominoes
\jour Chebyshevskii Sb.
\yr 2024
\vol 25
\issue 1
\pages 138--154
\mathnet{http://mi.mathnet.ru/cheb1407}
\crossref{https://doi.org/10.22405/2226-8383-2024-25-1-138-154}
Linking options:
  • https://www.mathnet.ru/eng/cheb1407
  • https://www.mathnet.ru/eng/cheb/v25/i1/p138
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:55
    Full-text PDF :13
    References:18
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024