## Computability of rational points on curves over function fields in characteristic p

dc.contributor.advisor | Bjorn Poonen. | en_US |

dc.contributor.author | Hewett, Campbell L.(Campbell Lucas) | en_US |

dc.contributor.other | Massachusetts Institute of Technology. Department of Mathematics. | en_US |

dc.date.accessioned | 2020-09-03T16:40:53Z | |

dc.date.available | 2020-09-03T16:40:53Z | |

dc.date.copyright | 2020 | en_US |

dc.date.issued | 2020 | en_US |

dc.identifier.uri | https://hdl.handle.net/1721.1/126924 | |

dc.description | Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, May, 2020 | en_US |

dc.description | Cataloged from the official PDF of thesis. | en_US |

dc.description | Includes bibliographical references (pages 103-105). | en_US |

dc.description.abstract | The motivating problem of this thesis is that of explicitly computing the K-rational points of a regular nonsmooth curve X over a αnitely generated αeld K of characteristic p. We start with an in-depth study of such curves in general and the tools exclusive to characteristic p geometry needed to compute their K-points. We describe a combined going-down and going-up approach to compute X(K) that generalizes and makes eﬀective the proof of ﬁniteness of X(K) given by Voloch ([39]). We break the problem up into three separate cases according to the absolute genus of X. In the absolute genus 0 case, we give an algorithm to compute X(K) that is an eﬀective version of a method given by Jeong ([16]). We also implement a special case of this algorithm in Sage and apply it to example curves. In the absolute genus 1 case, we give an algorithm to compute X(K) that works when we make extra assumptions about X, and we make some remarks in the case where those assumptions are removed. In the absolute genus at least 2 case, we give an unconditional algorithm to compute X(K). Some tools and algorithms we provide along the way do not directly involve regular nonsmooth curves and are interesting in their own right. We describe ways to eﬀectively descend curves with respect to transcendental or purely inseparable ﬁeld extensions. We explore the methods of p-descent on elliptic curves in characteristic p and provide explicit equations deﬁning Z/pZ- and [ mu]p-torsors over them. We prove an eﬀective de Franchis-Severi theorem for characteristic p that generalizes the one given by Baker, et al. over number ﬁelds ([3]). Lastly, we use a height bound proved by Szpiro ([34]) to give an algorithm to compute Y (K) for any smooth nonisotrivial curve Y over K followed by an algorithm to compute Y (K¹/p[infinity]), which was proved to be ﬁnite by Kim ([17]). | en_US |

dc.description.statementofresponsibility | by Campbell L. Hewett. | en_US |

dc.format.extent | 105 pages | en_US |

dc.language.iso | eng | en_US |

dc.publisher | Massachusetts Institute of Technology | en_US |

dc.rights | MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided. | en_US |

dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | en_US |

dc.subject | Mathematics. | en_US |

dc.title | Computability of rational points on curves over function fields in characteristic p | en_US |

dc.type | Thesis | en_US |

dc.description.degree | Ph. D. | en_US |

dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |

dc.identifier.oclc | 1191266689 | en_US |

dc.description.collection | Ph.D. Massachusetts Institute of Technology, Department of Mathematics | en_US |

dspace.imported | 2020-09-03T16:40:53Z | en_US |

mit.thesis.degree | Doctoral | en_US |

mit.thesis.department | Math | en_US |