Diophantine analysis is an area of number theory concerned with finding integral solutions to polynomial equations defined over the rationals, or more generally over a number field. In some cases, it is possible to associate a well behaved recurrence sequence to the solution set of a Diophantine equation, which can be useful in generating explicit results. It is known that the solution set to any norm form equation is naturally associated to a family of linear recurrence sequences. As these sequences have been widely studied, Diophantine problems involving norm forms are well-suited to be studied through their associated sequences. In this dissertation, we use this method to study two such problems
In Part I the diophantine equation [formula] was studied, where [formula] is a linear binary recurre...
We show how the Gelfond-Baker theory and diophantine approximation techniques can be applied to solv...
In Part I the diophantine equation [formula] was studied, where [formula] is a linear binary recurre...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
Let Gn be a k-th (k ≥ 2) order linear recurrence sequence of integers defined by initial terms G0,.....
The field of transcendance has a variety of subfields including : the transcendence of individual nu...
Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units...
Bu çalışma altı bölümden oluşmaktadır. Birinci bölümde, lineer reküransların tanımı, ikinci mertebed...
A thesis submitted to the Faculty of Science, University of the Witwatersrand and to the University...
In this paper we present severals sets of mathematical tools for characterizing the solutions of lin...
In this paper we present severals sets of mathematical tools for characterizing the solutions of lin...
2This version of the thesis was updated in October 2014. The update only concerns the presentation a...
This article presents an innovative and efficient approach for computing linear recurrences, offerin...
In this Masters thesis, we examine linear divisible sequences. A linear divisible sequence is any se...
We show how the Gelfond-Baker theory and diophantine approximation techniques can be applied to solv...
In Part I the diophantine equation [formula] was studied, where [formula] is a linear binary recurre...
We show how the Gelfond-Baker theory and diophantine approximation techniques can be applied to solv...
In Part I the diophantine equation [formula] was studied, where [formula] is a linear binary recurre...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
Let Gn be a k-th (k ≥ 2) order linear recurrence sequence of integers defined by initial terms G0,.....
The field of transcendance has a variety of subfields including : the transcendence of individual nu...
Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units...
Bu çalışma altı bölümden oluşmaktadır. Birinci bölümde, lineer reküransların tanımı, ikinci mertebed...
A thesis submitted to the Faculty of Science, University of the Witwatersrand and to the University...
In this paper we present severals sets of mathematical tools for characterizing the solutions of lin...
In this paper we present severals sets of mathematical tools for characterizing the solutions of lin...
2This version of the thesis was updated in October 2014. The update only concerns the presentation a...
This article presents an innovative and efficient approach for computing linear recurrences, offerin...
In this Masters thesis, we examine linear divisible sequences. A linear divisible sequence is any se...
We show how the Gelfond-Baker theory and diophantine approximation techniques can be applied to solv...
In Part I the diophantine equation [formula] was studied, where [formula] is a linear binary recurre...
We show how the Gelfond-Baker theory and diophantine approximation techniques can be applied to solv...
In Part I the diophantine equation [formula] was studied, where [formula] is a linear binary recurre...