RUS  ENG
Full version
JOURNALS // Dal'nevostochnyi Matematicheskii Zhurnal // Archive

Dal'nevost. Mat. Zh., 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.

UDC: 514.174

MSC: 52C20

Received: 12.04.2017



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024