dc.contributor.advisor | Cibulis, Andrejs | en_US |
dc.contributor.author | Dziļuma, Sintija | en_US |
dc.contributor.other | Latvijas Universitāte. Fizikas un matemātikas fakultāte | en_US |
dc.date.accessioned | 2015-07-06T01:09:07Z | |
dc.date.available | 2015-07-06T01:09:07Z | |
dc.date.issued | 2015 | en_US |
dc.identifier.other | 50147 | en_US |
dc.identifier.uri | https://dspace.lu.lv/dspace/handle/7/29718 | |
dc.description.abstract | Darbā aplūkota kombinatoriskās ģeometrijas problēma par tādu polimino konstruēšanu, kurus no uzdota k-mino kopijām var salikt tieši n veidos. Galvenā uzmanība pievērsta gadījumiem, kad k-mino lomā tiek ņemts domino un tetramino T. Atšķirībā no domino polimino eksistences problēma tetramino T gadījumā līdz šim nav atrisināta. Bakalaura darbā tā ir atrisināta visiem n <= 100, kā arī visiem Fibonači skaitļiem. | en_US |
dc.description.abstract | This work examines the problem of the combinatorial geometry on constructing such polyominoes which can be tiled from the prescribed k-omino copies exactly in n ways. The main attention has been paid to the cases when in the role of k-mino domino and tetromino T are taken. Unlike domino, the existence problem of polyomino in the case of tetromino T has not been solved yet. In this Bachelor thesis it has been solved for all n <= 100 as well as for all the Fibonacci numbers. | en_US |
dc.language.iso | N/A | en_US |
dc.publisher | Latvijas Universitāte | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Matemātika | en_US |
dc.subject | domino | en_US |
dc.subject | polimino | en_US |
dc.subject | T-tetramino | en_US |
dc.subject | Fibonači skaitļi | en_US |
dc.subject | salikumi | en_US |
dc.title | Polimino ar uzdotu salikumu skaitu konstruēšanas problēma | en_US |
dc.title.alternative | Problem of Constructing a Polyominoes Having Prescribed Number of Tilings | en_US |
dc.type | info:eu-repo/semantics/bachelorThesis | en_US |