Ekstremālie polimino un polimondi
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
lav
Abstract
Maģistra darbā aplūkotas dažas jaunas kombinatoriskās ģeometrijas problēmas. Īpaša uzmanība pievērsta tādiem polimino, ar kuru kopijām plakni var pārklāt tikai vienā veidā, ja pirmā kopija tiek fiksēta. Pierādīta šādu unikālu n-mino eksistence visiem n > 21. Mazākais darbā atrastais unikālais polimino ir oktamino.
In the master’s thesis some new problems of combinatorial geometry have been dealt with. A particular attention has been paid to such polyominoes with the copies of which the plane can be tiled only in one way, if the first copy is fixed. The existence of such unique n-ominoes has been proved for all n > 21. The smallest unique polyomino found in the work is an octomino.
In the master’s thesis some new problems of combinatorial geometry have been dealt with. A particular attention has been paid to such polyominoes with the copies of which the plane can be tiled only in one way, if the first copy is fixed. The existence of such unique n-ominoes has been proved for all n > 21. The smallest unique polyomino found in the work is an octomino.