|
|
Dal'nevostochnyi Matematicheskii Zhurnal, 2017, Volume 17, Number 2, Pages 257–264
(Mi dvmg358)
|
|
|
|
On a number of polyhex plane tilings
A. V. Shutova, E. V. Kolomeikinab a Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
b Bauman Moscow State Technical University
Abstract:
A tiling is called a lattice tiling if there is a group of translations which acts on the set of the tiles transitively. In the paper the low and upper bounds for the number of lattice tilings of plane with centrally symmetrical polyhexes are found.
Key words:
tilings, lattice tilings, polyhexes, self-avoiding walks.
Received: 12.04.2017
Citation:
A. V. Shutov, E. V. Kolomeikina, “On a number of polyhex plane tilings”, Dal'nevost. Mat. Zh., 17:2 (2017), 257–264
Linking options:
https://www.mathnet.ru/eng/dvmg358 https://www.mathnet.ru/eng/dvmg/v17/i2/p257
|
| Statistics & downloads: |
| Abstract page: | 290 | | Full-text PDF : | 109 | | References: | 60 |
|