Matching Items (18)
152050-Thumbnail Image.png
Description
In 1959, Iwasawa proved that the size of the $p$-part of the class groups of a $\mathbb{Z}_p$-extension grows as a power of $p$ with exponent ${\mu}p^m+{\lambda}\,m+\nu$ for $m$ sufficiently large. Broadly, I construct conditions to verify if a given $m$ is indeed sufficiently large. More precisely, let $CG_m^i$ (class group)

In 1959, Iwasawa proved that the size of the $p$-part of the class groups of a $\mathbb{Z}_p$-extension grows as a power of $p$ with exponent ${\mu}p^m+{\lambda}\,m+\nu$ for $m$ sufficiently large. Broadly, I construct conditions to verify if a given $m$ is indeed sufficiently large. More precisely, let $CG_m^i$ (class group) be the $\epsilon_i$-eigenspace component of the $p$-Sylow subgroup of the class group of the field at the $m$-th level in a $\mathbb{Z}_p$-extension; and let $IACG^i_m$ (Iwasawa analytic class group) be ${\mathbb{Z}_p[[T]]/((1+T)^{p^m}-1,f(T,\omega^{1-i}))}$, where $f$ is the associated Iwasawa power series. It is expected that $CG_m^i$ and $IACG^i_m$ be isomorphic, providing us with a powerful connection between algebraic and analytic techniques; however, as of yet, this isomorphism is unestablished in general. I consider the existence and the properties of an exact sequence $$0\longrightarrow\ker{\longrightarrow}CG_m^i{\longrightarrow}IACG_m^i{\longrightarrow}\textrm{coker}\longrightarrow0.$$ In the case of a $\mathbb{Z}_p$-extension where the Main Conjecture is established, there exists a pseudo-isomorphism between the respective inverse limits of $CG_m^i$ and $IACG_m^i$. I consider conditions for when such a pseudo-isomorphism immediately gives the existence of the desired exact sequence, and I also consider work-around methods that preserve cardinality for otherwise. However, I primarily focus on constructing conditions to verify if a given $m$ is sufficiently large that the kernel and cokernel of the above exact sequence have become well-behaved, providing similarity of growth both in the size and in the structure of $CG_m^i$ and $IACG_m^i$; as well as conditions to determine if any such $m$ exists. The primary motivating idea is that if $IACG_m^i$ is relatively easy to work with, and if the relationship between $CG_m^i$ and $IACG_m^i$ is understood; then $CG_m^i$ becomes easier to work with. Moreover, while the motivating framework is stated concretely in terms of the cyclotomic $\mathbb{Z}_p$-extension of $p$-power roots of unity, all results are generally applicable to arbitrary $\mathbb{Z}_p$-extensions as they are developed in terms of Iwasawa-Theory-inspired, yet abstracted, algebraic results on maps between inverse limits.
ContributorsElledge, Shawn Michael (Author) / Childress, Nancy (Thesis advisor) / Bremner, Andrew (Committee member) / Fishel, Susanna (Committee member) / Jones, John (Committee member) / Paupert, Julien (Committee member) / Arizona State University (Publisher)
Created2013
153445-Thumbnail Image.png
Description
In 1984, Sinnott used $p$-adic measures on $\mathbb{Z}_p$ to give a new proof of the Ferrero-Washington Theorem for abelian number fields by realizing $p$-adic $L$-functions as (essentially) the $Gamma$-transform of certain $p$-adic rational function measures. Shortly afterward, Gillard and Schneps independently adapted Sinnott's techniques to the case of $p$-adic

In 1984, Sinnott used $p$-adic measures on $\mathbb{Z}_p$ to give a new proof of the Ferrero-Washington Theorem for abelian number fields by realizing $p$-adic $L$-functions as (essentially) the $Gamma$-transform of certain $p$-adic rational function measures. Shortly afterward, Gillard and Schneps independently adapted Sinnott's techniques to the case of $p$-adic $L$-functions associated to elliptic curves with complex multiplication (CM) by realizing these $p$-adic $L$-functions as $Gamma$-transforms of certain $p$-adic rational function measures. The results in the CM case give the vanishing of the Iwasawa $mu$-invariant for certain $mathbb{Z}_p$-extensions of imaginary quadratic fields constructed from torsion points of CM elliptic curves.

In this thesis, I develop the theory of $p$-adic measures on $mathbb{Z}_p^d$, with particular interest given to the case of $d>1$. Although I introduce these measures within the context of $p$-adic integration, this study includes a strong emphasis on the interpretation of $p$-adic measures as $p$-adic power series. With this dual perspective, I describe $p$-adic analytic operations as maps on power series; the most important of these operations is the multivariate $Gamma$-transform on $p$-adic measures.

This thesis gives new significance to product measures, and in particular to the use of product measures to construct measures on $mathbb{Z}_p^2$ from measures on $mathbb{Z}_p$. I introduce a subring of pseudo-polynomial measures on $mathbb{Z}_p^2$ which is closed under the standard operations on measures, including the $Gamma$-transform. I obtain results on the Iwasawa-invariants of such pseudo-polynomial measures, and use these results to deduce certain continuity results for the $Gamma$-transform. As an application, I establish the vanishing of the Iwasawa $mu$-invariant of Yager's two-variable $p$-adic $L$-function from measure theoretic considerations.
ContributorsZinzer, Scott Michael (Author) / Childress, Nancy (Thesis advisor) / Bremner, Andrew (Committee member) / Fishel, Susanna (Committee member) / Jones, John (Committee member) / Spielberg, John (Committee member) / Arizona State University (Publisher)
Created2015
157261-Thumbnail Image.png
Description
Diophantine arithmetic is one of the oldest branches of mathematics, the search

for integer or rational solutions of algebraic equations. Pythagorean triangles are

an early instance. Diophantus of Alexandria wrote the first related treatise in the

fourth century; it was an area extensively studied by the great mathematicians of the seventeenth

Diophantine arithmetic is one of the oldest branches of mathematics, the search

for integer or rational solutions of algebraic equations. Pythagorean triangles are

an early instance. Diophantus of Alexandria wrote the first related treatise in the

fourth century; it was an area extensively studied by the great mathematicians of the seventeenth century, including Euler and Fermat.

The modern approach is to treat the equations as defining geometric objects, curves, surfaces, etc. The theory of elliptic curves (or curves of genus 1, which are much used in modern cryptography) was developed extensively in the twentieth century, and has had great application to Diophantine equations. This theory is used in application to the problems studied in this thesis. This thesis studies some curves of high genus, and possible solutions in both rationals and in algebraic number fields, generalizes some old results and gives answers to some open problems in the literature. The methods involve known techniques together with some ingenious tricks. For example, the equations $y^2=x^6+k$, $k=-39,\,-47$, the two previously unsolved cases for $|k|<50$, are solved using algebraic number theory and the ‘elliptic Chabauty’ method. The thesis also studies the genus three quartic curves $F(x^2,y^2,z^2)=0$ where F is a homogeneous quadratic form, and extend old results of Cassels, and Bremner. It is a very delicate matter to find such curves that have no rational points, yet which do have points in odd-degree extension fields of the rationals.

The principal results of the thesis are related to surfaces where the theory is much less well known. In particular, the thesis studies some specific families of surfaces, and give a negative answer to a question in the literature regarding representation of integers n in the form $n=(x+y+z+w)(1/x+1/y+1/z+1/w).$ Further, an example, the first such known, of a quartic surface $x^4+7y^4=14z^4+18w^4$ is given with remarkable properties: it is everywhere locally solvable, yet has no non-zero rational point, despite having a point in (non-trivial) odd-degree extension fields of the rationals. The ideas here involve manipulation of the Hilbert symbol, together with the theory of elliptic curves.
ContributorsNguyen, Xuan Tho (Author) / Bremner, Andrew (Thesis advisor) / Childress, Nancy (Committee member) / Jones, John (Committee member) / Quigg, John (Committee member) / Fishel, Susanna (Committee member) / Arizona State University (Publisher)
Created2019
134742-Thumbnail Image.png
Description
Pierre de Fermat, an amateur mathematician, set upon the mathematical world a challenge so difficult it took 357 years to prove. This challenge, known as Fermat's Last Theorem, has many different ways of being expressed, but it simply states that for $n > 2$, the equation $x^n + y^n =

Pierre de Fermat, an amateur mathematician, set upon the mathematical world a challenge so difficult it took 357 years to prove. This challenge, known as Fermat's Last Theorem, has many different ways of being expressed, but it simply states that for $n > 2$, the equation $x^n + y^n = z^n$ has no nontrivial solution. The first set of attempts of proofs came from mathematicians using the essentially elementary tools provided by number theory: the notable mathematicians were Leonhard Euler, Sophie Germain and Ernst Kummer. Kummer was the final mathematician to try to use essentially elementary number theory as the basis for his proof and even exclaimed that Fermat's Last Theorem could not be solved using number theory alone; Kummer claimed that greater mathematics would have to be developed in order to prove this ever-growing mystery. The 20th century arrives and two Japanese mathematicians, Goro Shimura and Yutaka Taniyama, shock the world by claiming two highly distinct branches of mathematics, elliptic curves and modular forms, were in fact one and the same. Gerhard Frey then took this claim to the extreme by stating that this claim, the Taniyama-Shimura conjecture, was the necessary link to finally prove Fermat's Last Theorem was true. Frey's statement was then validated by Kenneth Ribet by proving that the Frey Curve could not indeed be a modular form. The final piece of the puzzle placed, the English mathematician Andrew Wiles embarked on a 7 year journey to prove Fermat's Last Theorem as now the the proof of the theorem rested in his area of expertise, that being elliptic curves. In 1994, Wiles published his complete proof of Fermat's Last Theorem, putting an end to one of mathematics' greatest mysteries.
ContributorsBoyadjian, Hoveeg Krikor (Author) / Bremner, Andrew (Thesis director) / Jones, John (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2016-12
154926-Thumbnail Image.png
Description
The Tamari lattices have been intensely studied since they first appeared in Dov Tamari’s thesis around 1952. He defined the n-th Tamari lattice T(n) on bracketings of a set of n+1 objects, with a cover relation based on the associativity rule in one direction. Despite their interesting aspects and the

The Tamari lattices have been intensely studied since they first appeared in Dov Tamari’s thesis around 1952. He defined the n-th Tamari lattice T(n) on bracketings of a set of n+1 objects, with a cover relation based on the associativity rule in one direction. Despite their interesting aspects and the attention they have received, a formula for the number of maximal chains in the Tamari lattices is still unknown. The purpose of this thesis is to convey my results on progress toward the solution of this problem and to discuss future work.

A few years ago, Bergeron and Préville-Ratelle generalized the Tamari lattices to the m-Tamari lattices. The original Tamari lattices T(n) are the case m=1. I establish a bijection between maximum length chains in the m-Tamari lattices and standard m-shifted Young tableaux. Using Thrall’s formula, I thus derive the formula for the number of maximum length chains in T(n).

For each i greater or equal to -1 and for all n greater or equal to 1, I define C(i,n) to be the set of maximal chains of length n+i in T(n). I establish several properties of maximal chains (treated as tableaux) and identify a particularly special property: each maximal chain may or may not possess a plus-full-set. I show, surprisingly, that for all n greater or equal to 2i+4, each member of C(i,n) contains a plus-full-set. Utilizing this fact and a collection of maps, I obtain a recursion for the number of elements in C(i,n) and an explicit formula based on predetermined initial values. The formula is a polynomial in n of degree 3i+3. For example, the number of maximal chains of length n in T(n) is n choose 3.

I discuss current work and future plans involving certain equivalence classes of maximal chains in the Tamari lattices. If a maximal chain may be obtained from another by swapping a pair of consecutive edges with another pair in the Hasse diagram, the two maximal chains are said to differ by a square move. Two maximal chains are said to be in the same equivalence class if one may be obtained from the other by making a set of square moves.
ContributorsNelson, Luke (Author) / Fishel, Susanna (Thesis advisor) / Czygrinow, Andrzej (Committee member) / Jones, John (Committee member) / Kierstead, Henry (Committee member) / Spielberg, John (Committee member) / Arizona State University (Publisher)
Created2016
155093-Thumbnail Image.png
Description
The Tamari lattice T(n) was originally defined on bracketings of a set of n+1 objects, with a cover relation based on the associativity rule in one direction. Since then it has been studied in various areas of mathematics including cluster algebras, discrete geometry, algebraic combinatorics, and Catalan theory.

The Tamari lattice T(n) was originally defined on bracketings of a set of n+1 objects, with a cover relation based on the associativity rule in one direction. Since then it has been studied in various areas of mathematics including cluster algebras, discrete geometry, algebraic combinatorics, and Catalan theory. Although in several related lattices the number of maximal chains is known, the enumeration of these chains in Tamari lattices is still an open problem.

This dissertation defines a partially-ordered set on equivalence classes of certain saturated chains of T(n) called the Tamari Block poset, TB(lambda). It further proves TB(lambda) is a graded lattice. It then shows for lambda = (n-1,...,2,1) TB(lambda) is anti-isomorphic to the Higher Stasheff-Tamari orders in dimension 3 on n+2 elements. It also investigates enumeration questions involving TB(lambda), and proves other structural results along the way.
ContributorsTreat, Kevin (Author) / Fishel, Susanna (Thesis advisor) / Czygrinow, Andrzej (Committee member) / Jones, John (Committee member) / Childress, Nancy (Committee member) / Colbourn, Charles (Committee member) / Arizona State University (Publisher)
Created2016
155340-Thumbnail Image.png
Description
The Cambrian lattice corresponding to a Coxeter element c of An, denoted Camb(c),

is the subposet of An induced by the c-sortable elements, and the m-eralized Cambrian

lattice corresponding to c, denoted Cambm(c), is dened as a subposet of the

braid group accompanied with the right weak ordering induced by the c-sortable elements

under

The Cambrian lattice corresponding to a Coxeter element c of An, denoted Camb(c),

is the subposet of An induced by the c-sortable elements, and the m-eralized Cambrian

lattice corresponding to c, denoted Cambm(c), is dened as a subposet of the

braid group accompanied with the right weak ordering induced by the c-sortable elements

under certain conditions. Both of these families generalize the well-studied

Tamari lattice Tn rst introduced by D. Tamari in 1962. S. Fishel and L. Nelson

enumerated the chains of maximum length of Tamari lattices.

In this dissertation, I study the chains of maximum length of the Cambrian and

m-eralized Cambrian lattices, precisely, I enumerate these chains in terms of other

objects, and then nd formulas for the number of these chains for all m-eralized

Cambrian lattices of A1, A2, A3, and A4. Furthermore, I give an alternative proof

for the number of chains of maximum length of the Tamari lattice Tn, and provide

conjectures and corollaries for the number of these chains for all m-eralized Cambrian

lattices of A5.
ContributorsAl-Suleiman, Sultan (Author) / Fishel, Susanna (Thesis advisor) / Childress, Nancy (Committee member) / Czygrinow, Andrzej (Committee member) / Jones, John (Committee member) / Spielberg, John (Committee member) / Arizona State University (Publisher)
Created2017
149583-Thumbnail Image.png
Description
In Iwasawa theory, one studies how an arithmetic or geometric object grows as its field of definition varies over certain sequences of number fields. For example, let $F/\mathbb{Q}$ be a finite extension of fields, and let $E:y^2 = x^3 + Ax + B$ with $A,B \in F$ be an elliptic

In Iwasawa theory, one studies how an arithmetic or geometric object grows as its field of definition varies over certain sequences of number fields. For example, let $F/\mathbb{Q}$ be a finite extension of fields, and let $E:y^2 = x^3 + Ax + B$ with $A,B \in F$ be an elliptic curve. If $F = F_0 \subseteq F_1 \subseteq F_2 \subseteq \cdots F_\infty = \bigcup_{i=0}^\infty F_i$, one may be interested in properties like the ranks and torsion subgroups of the increasing family of curves $E(F_0) \subseteq E(F_1) \subseteq \cdots \subseteq E(F_\infty)$. The main technique for studying this sequence of curves when $\Gal(F_\infty/F)$ has a $p$-adic analytic structure is to use the action of $\Gal(F_n/F)$ on $E(F_n)$ and the Galois cohomology groups attached to $E$, i.e. the Selmer and Tate-Shafarevich groups. As $n$ varies, these Galois actions fit into a coherent family, and taking a direct limit one obtains a short exact sequence of modules $$0 \longrightarrow E(F_\infty) \otimes(\mathbb{Q}_p/\mathbb{Z}_p) \longrightarrow \Sel_E(F_\infty)_p \longrightarrow \Sha_E(F_\infty)_p \longrightarrow 0 $$ over the profinite group algebra $\mathbb{Z}_p[[\Gal(F_\infty/F)]]$. When $\Gal(F_\infty/F) \cong \mathbb{Z}_p$, this ring is isomorphic to $\Lambda = \mathbb{Z}_p[[T]]$, and the $\Lambda$-module structure of $\Sel_E(F_\infty)_p$ and $\Sha_E(F_\infty)_p$ encode all the information about the curves $E(F_n)$ as $n$ varies. In this dissertation, it will be shown how one can classify certain finitely generated $\Lambda$-modules with fixed characteristic polynomial $f(T) \in \mathbb{Z}_p[T]$ up to isomorphism. The results yield explicit generators for each module up to isomorphism. As an application, it is shown how to identify the isomorphism class of $\Sel_E(\mathbb{Q_\infty})_p$ in this explicit form, where $\mathbb{Q}_\infty$ is the cyclotomic $\mathbb{Z}_p$-extension of $\mathbb{Q}$, and $E$ is an elliptic curve over $\mathbb{Q}$ with good ordinary reduction at $p$, and possessing the property that $E(\mathbb{Q})$ has no $p$-torsion.
ContributorsFranks, Chase (Author) / Childress, Nancy (Thesis advisor) / Barcelo, Helene (Committee member) / Bremner, Andrew (Committee member) / Jones, John (Committee member) / Spielberg, Jack (Committee member) / Arizona State University (Publisher)
Created2011
Description

Cheating in Battleship is effortless. Battleship is a popular two-player board game where each player strategically places five ships on his or her concealed board. During this game, one can easily move their ships during a play, falsify an attack, or not even place their ships. A solution to this

Cheating in Battleship is effortless. Battleship is a popular two-player board game where each player strategically places five ships on his or her concealed board. During this game, one can easily move their ships during a play, falsify an attack, or not even place their ships. A solution to this concern is implementing multiparty computation (MPC) encryption to ensure that the location of both players’ ships and the result of attacking a ship is true. This document details the creation and security of a Battleship program that implements an MPC encryption method known as Poker Over the Telephone.

ContributorsHardy, Lauren (Author) / Childress, Nancy (Thesis director) / Jones, John (Committee member) / School of Mathematical and Statistical Sciences (Contributor, Contributor, Contributor) / Barrett, The Honors College (Contributor)
Created2021-05
148348-Thumbnail Image.png
Description

Many current cryptographic algorithms will eventually become easily broken by Shor's Algorithm once quantum computers become more powerful. A number of new algorithms have been proposed which are not compromised by quantum computers, one of which is the Supersingular Isogeny Diffie-Hellman Key Exchange Protocol (SIDH). SIDH works by having both

Many current cryptographic algorithms will eventually become easily broken by Shor's Algorithm once quantum computers become more powerful. A number of new algorithms have been proposed which are not compromised by quantum computers, one of which is the Supersingular Isogeny Diffie-Hellman Key Exchange Protocol (SIDH). SIDH works by having both parties perform random walks between supersingular elliptic curves on isogeny graphs of prime degree and eventually end at the same location, a shared secret.<br/><br/>This thesis seeks to explore some of the theory and concepts underlying the security of SIDH, especially as it relates to finding supersingular elliptic curves, generating isogeny graphs, and implementing SIDH. As elliptic curves and SIDH may be an unfamiliar topic to many readers, the paper begins by providing a brief introduction to elliptic curves, isogenies, and the SIDH Protocol. Next, the paper investigates more efficient methods of generating supersingular elliptic curves, which are important for visualizing the isogeny graphs in the algorithm and the setup of the protocol. Afterwards, the paper focuses on isogeny maps of various degrees, attempting to visualize isogeny maps similar to those used in SIDH. Finally, the paper looks at an implementation of SIDH in PARI/GP and work is done to see the effects of using isogenies of degree greater than 2 and 3 on the security, runtime, and practicality of the algorithm.

ContributorsSteele, Aaron J (Author) / Jones, John (Thesis director) / Childress, Nancy (Committee member) / Computer Science and Engineering Program (Contributor, Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05