dc.contributor.advisor | Fili, Paul | |
dc.contributor.author | Clark, John Michael | |
dc.date.accessioned | 2020-09-09T21:26:50Z | |
dc.date.available | 2020-09-09T21:26:50Z | |
dc.date.issued | 2020-05 | |
dc.identifier.uri | https://hdl.handle.net/11244/325521 | |
dc.description.abstract | For a minimal polynomial $f$ we denote by $M(f)$ the Mahler measure of the roots of $f$. The classical Lehmer conjecture is concerned with finding a definitive lower bound for $M(f)$. Lehmer's polynomial is known to have the lowest Mahler measure for all polynomials. We look at a version of Lehmer's conjecture involving elliptic curves and investigate the corresponding Mahler measures, looking for those polynomials with minimal Mahler measure on various elliptic curves. We detail the results we have found using genetic algorithms. | |
dc.format | application/pdf | |
dc.language | en_US | |
dc.rights | Copyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material. | |
dc.title | Polynomials with small elliptic Mahler measure via genetic algorithms | |
dc.contributor.committeeMember | Pritsker, Igor | |
dc.contributor.committeeMember | Wright, David | |
osu.filename | Clark_okstate_0664M_16699.pdf | |
osu.accesstype | Open Access | |
dc.type.genre | Thesis | |
dc.type.material | Text | |
dc.subject.keywords | elliptic curve | |
dc.subject.keywords | genetic algorithm | |
dc.subject.keywords | height | |
dc.subject.keywords | lehmer conjecture | |
dc.subject.keywords | machine learning | |
dc.subject.keywords | mahler measure | |
thesis.degree.discipline | Mathematics | |
thesis.degree.grantor | Oklahoma State University | |