On PCF Polynomials
| dc.contributor.advisor | Ingram, Patrick | |
| dc.contributor.author | Fraser, Benjamin Alexander | |
| dc.date.accessioned | 2025-04-10T10:46:12Z | |
| dc.date.available | 2025-04-10T10:46:12Z | |
| dc.date.copyright | 2024-10-07 | |
| dc.date.issued | 2025-04-10 | |
| dc.date.updated | 2025-04-10T10:46:11Z | |
| dc.degree.discipline | Mathematics & Statistics | |
| dc.degree.level | Doctoral | |
| dc.degree.name | PhD - Doctor of Philosophy | |
| dc.description.abstract | The author of [27] proves that the set of post-critically finite (PCF) polynomials of given degree is a set of bounded height, up to PGL_2-conjugacy. This result is extended to show that the set of monic polynomials g(z) with rational coefficients of given degree such that there exists a d ≥ 2 such that g(z^d) is PCF, is also a set of bounded height. Note that by fixing the degree of a polynomial and algebraic degree of its coefficients, the set of such PCF polynomials is in fact finite, and computable. Bounds on the coefficients for quartic PCF polynomials with rational coefficients are computed, and a search of the resulting space yields 16 distinct conjugacy classes. Infinite families of PCF polynomials containing each of these distinct conjugacy classes are found, giving a lower bound on the number of such conjugacy classes in terms of degree d. | |
| dc.identifier.uri | https://hdl.handle.net/10315/42782 | |
| dc.language | en | |
| dc.rights | Author owns copyright, except where explicitly noted. Please contact the author directly with licensing requests. | |
| dc.subject.keywords | Number theory | |
| dc.subject.keywords | Arithmetic dynamics | |
| dc.subject.keywords | Postcritically finite maps | |
| dc.title | On PCF Polynomials | |
| dc.type | Electronic Thesis or Dissertation |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Benjamin_Alexander_Fraser_2024_PhD.pdf
- Size:
- 758.14 KB
- Format:
- Adobe Portable Document Format