{"id":{"repo_id":"vilnius","oai_identifier":"oai:vu.lt:elaba:308338069"},"canonical_url":"https://search.ndltd.org/etd/vilnius/oai:vu.lt:elaba:308338069","repository":{"repo_id":"vilnius","name":"Vilnius University","base_url":"https://epublications.vu.lt/oai"},"display":{"title":"3-simetriški daugiakampiai heksagoninės gardelės trikampiame poaibyje /","abstract":"This paper investigates 3-symmetric simple polygons within a triangular subset of a hexagonal lattice. The polygons are constructed by connecting lattice points with edges while forbidding 180° angles between consecutive edges. To search for solutions, an intermediate-point (“skeleton”) method was developed and optimized. Using this method, the first values of the studied sequences were computed, and structural properties of the solutions were analyzed, including possible perimeters, reachable lattice points, and the distribution of skeletons. The paper also examines theoretical questions related to the existence of solutions and the number of unit-length edges. Later, these ideas were applied to a related class of problems involving not simple polygons, but 3-symmetric Hamiltonian cycles in which 180° angles are allowed. In this setting, stronger theoretical results were obtained, including exact formulas for several associated sequences in the general case.","abstract_html":"This paper investigates 3-symmetric simple polygons within a triangular subset of a hexagonal lattice. The polygons are constructed by connecting lattice points with edges while forbidding 180° angles between consecutive edges. To search for solutions, an intermediate-point (“skeleton”) method was developed and optimized. Using this method, the first values of the studied sequences were computed, and structural properties of the solutions were analyzed, including possible perimeters, reachable lattice points, and the distribution of skeletons. The paper also examines theoretical questions related to the existence of solutions and the number of unit-length edges. Later, these ideas were applied to a related class of problems involving not simple polygons, but 3-symmetric Hamiltonian cycles in which 180° angles are allowed. In this setting, stronger theoretical results were obtained, including exact formulas for several associated sequences in the general case.","abstract_has_math":false,"creators":["Sirvydis, Karolis,"],"institution":"Institutional Repository of Vilnius University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026","date_published":"2026","updated_at":"2026-11-19T10:12:59Z","subjects":[],"languages":["lit"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://repository.vu.lt/VU:ELABAETD308338069&prefLang=en_US","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://repository.vu.lt/VU:ELABAETD308338069&prefLang=en_US","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":"open","embargo_until":null,"access_note":null},"source_record":{"url":"https://epublications.vu.lt/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Avu.lt%3Aelaba%3A308338069","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Sirvydis, Karolis,"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2026"]},{"key":"dc:publisher","label":"Institution","values":["Institutional Repository of Vilnius University"]},{"key":"dc:relation","label":"Dc Relation","values":["https://epublications.vu.lt/object/elaba:308338069/308338069.pdf"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/bachelorThesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["lit"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://repository.vu.lt/VU:ELABAETD308338069&prefLang=en_US"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This paper investigates 3-symmetric simple polygons within a triangular subset of a hexagonal lattice. The polygons are constructed by connecting lattice points with edges while forbidding 180° angles between consecutive edges. To search for solutions, an intermediate-point (“skeleton”) method was developed and optimized. Using this method, the first values of the studied sequences were computed, and structural properties of the solutions were analyzed, including possible perimeters, reachable lattice points, and the distribution of skeletons. The paper also examines theoretical questions related to the existence of solutions and the number of unit-length edges. Later, these ideas were applied to a related class of problems involving not simple polygons, but 3-symmetric Hamiltonian cycles in which 180° angles are allowed. In this setting, stronger theoretical results were obtained, including exact formulas for several associated sequences in the general case."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["3-simetriški daugiakampiai heksagoninės gardelės trikampiame poaibyje /","3-symmetric polygons in the triangular subset of the hexagonal lattice."]}]}],"canonical_facts":{"dc:creator":["Sirvydis, Karolis,"],"dc:date":["2026"],"dc:description":["This paper investigates 3-symmetric simple polygons within a triangular subset of a hexagonal lattice. The polygons are constructed by connecting lattice points with edges while forbidding 180° angles between consecutive edges. To search for solutions, an intermediate-point (“skeleton”) method was developed and optimized. Using this method, the first values of the studied sequences were computed, and structural properties of the solutions were analyzed, including possible perimeters, reachable lattice points, and the distribution of skeletons. The paper also examines theoretical questions related to the existence of solutions and the number of unit-length edges. Later, these ideas were applied to a related class of problems involving not simple polygons, but 3-symmetric Hamiltonian cycles in which 180° angles are allowed. In this setting, stronger theoretical results were obtained, including exact formulas for several associated sequences in the general case."],"dc:format":["application/pdf"],"dc:identifier":["https://repository.vu.lt/VU:ELABAETD308338069&prefLang=en_US"],"dc:language":["lit"],"dc:publisher":["Institutional Repository of Vilnius University"],"dc:relation":["https://epublications.vu.lt/object/elaba:308338069/308338069.pdf"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:title":["3-simetriški daugiakampiai heksagoninės gardelės trikampiame poaibyje /","3-symmetric polygons in the triangular subset of the hexagonal lattice."],"dc:type":["info:eu-repo/semantics/bachelorThesis"]},"updated_at":"2026-11-19T10:12:59Z"}