National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Periodicity of Jacobi-Perron algorithm
Sgallová, Ester ; Kala, Vítězslav (advisor) ; Vávra, Tomáš (referee)
This thesis aims to study a connection between indecomposable elements in the cubic fields and the Jacobi-Perron algorithm (JPA). JPA is a multidimensional generalization of the usual continued fractions algorithm. We work in the family of Ennola's cubic fields and we examine how the indecomposable elements are related to elements originating from this algorithm and whether some of these elements generate all indecomposable elements in the fields. We formulate conjectures on how to determine which elements will generate the indecomposable elements. We also prove some necessary conditions that have to hold for elements originating from this algorithm to generate indecomposable elements. 1
Primes in discretely ordered quasi-Euclidean domains
Sgallová, Ester ; Šaroch, Jan (advisor) ; Glivická, Jana (referee)
This thesis studies discretely ordered quasi-Euclidean domains. The goal is to study primes and prime pairs in them and to answer the question, whether there can be a cofinal set of them. The first construction gives a domain that does not have a cofinal set primes. Another construction builds a principal ideal domain, which has a cofinal set of primes, but no two distinct non-standard primes differ by a natural number, so there is not a cofinal set of prime pairs. Furthermore, the thesis describes a construction of a principal ideal domain, whitch has a cofinal set of prime a-pairs for any even positive integer a. 1

Interested in being notified about new results for this query?
Subscribe to the RSS feed.