| dc.contributor.advisor | Cibulis, Andrejs | en_US |
| dc.contributor.author | Čerņenoks, Juris | en_US |
| dc.contributor.other | Latvijas Universitāte. Fizikas un matemātikas fakultāte | en_US |
| dc.date.accessioned | 2015-03-24T07:36:23Z | |
| dc.date.available | 2015-03-24T07:36:23Z | |
| dc.date.issued | 2012 | en_US |
| dc.identifier.other | 22225 | en_US |
| dc.identifier.uri | https://dspace.lu.lv/dspace/handle/7/19637 | |
| dc.description.abstract | Maģistra darbā risinātas dažas kombinatoriskās ģeometrijas problēmas par tetradiem un pakošanas problēma ar V-pentakubiem. Šo problēmu risināšanai ir izstrādātas speciālas datorprogrammas un iegūti vairāki jauni rezultāti: ir atrasti visi tetradi no polimino, kuru laukums nepārsniedz 60; iegūti paralēlskaldņu n x n x 1, n < 21, un 5 x 5 x 5 blīvākie pakojumi no V-pentakubiem.
Atslēgvārdi: n-mino, pakošana, pentakubs, polimino, tetrads. | en_US |
| dc.description.abstract | This Master thesis deals with some problems of combinatorial geometry on tetrads and packing problem with V-pentacubes. The special computer programmes have been elaborated for solving these problems, and several new results have been obtained: all polyominoes tetrads with area not exceeding 60 have been found, the densest packing of parallelepipeds n x n x 1, n < 21, and 5 x 5 x 5 have been obtained.
Keywords: n-omino, packing, pentacube, polyomino, tetrad. | 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.title | Dažas neatrisinātas problēmas kombinatoriskajā ģeometrijā | en_US |
| dc.title.alternative | Some Unsolved Problems in Combinatorial Geometry | en_US |
| dc.type | info:eu-repo/semantics/masterThesis | en_US |
