Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp019c67wq66t
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Bhargava, Manjul | - |
dc.contributor.author | Tyler, Matt | - |
dc.date.accessioned | 2019-07-26T12:20:29Z | - |
dc.date.available | 2019-07-26T12:20:29Z | - |
dc.date.created | 2019-05-06 | - |
dc.date.issued | 2019-07-26 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp019c67wq66t | - |
dc.description.abstract | The Cohen-Lenstra heuristics predict that the \(p\)-part of the class group of a random imaginary quadratic field is isomorphic to an abelian \(p\)-group \(A\) with probability proportional to \(\frac{1}{|\text{Aut} A|}\). This probability distribution has since arisen in a myriad of different settings, and serves as a natural model for a random abelian group. More generally, the Cohen-Lenstra-Martinet heuristics deal with sums of the form \(\sum_M \frac{1}{|\text{Aut} M|}\) over a collection of \(\mathbb{Z}_p[G]\)-modules \(M\), where \(G\) is a group such that \(p \nmid |G|\). When \(p \mid |G|\), however, things become more complicated, and much less is known. We consider the simplest such case, when \(G\) is the cyclic group \(C_p\) of order \(p\). We study modules over \(\mathbb{Z}_p[C_p]\) and evaluate \(\sum_M \frac{1}{|\text{Aut} M|}\) for various collections of \(\mathbb{Z}_p[C_p]\)-modules \(M\). | en_US |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | en_US |
dc.title | Cohen-Lenstra sums over \(\mathbb{Z}_p[C_p]\) | en_US |
dc.type | Princeton University Senior Theses | - |
pu.date.classyear | 2019 | en_US |
pu.department | Mathematics | en_US |
pu.pdf.coverpage | SeniorThesisCoverPage | - |
pu.contributor.authorid | 961150844 | - |
Appears in Collections: | Mathematics, 1934-2020 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
TYLER-MATT-THESIS.pdf | 398.49 kB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.