This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.

In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.

Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at gradformat@asu.edu.

Displaying 1 - 7 of 7
Filtering by

Clear all filters

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
153004-Thumbnail Image.png
DescriptionReprising the work of Kolpakov and Martelli, a manifold is constructed by face pairings of a four dimensional polytope, the 24-cell. The resulting geometry is a single cusped hyperbolic 4-manifold of finite volume. A short discussion of its geometry and underlying topology is included.
ContributorsAbram, Christopher (Author) / Paupert, Julien (Thesis advisor) / Kawski, Mattias (Committee member) / Kotschwar, Brett (Committee member) / Arizona State University (Publisher)
Created2014
156198-Thumbnail Image.png
Description
The uncrossing partially ordered set $P_n$ is defined on the set of matchings on $2n$ points on a circle represented with wires. The order relation is $\tau'\leq \tau$ in $P_n$ if and only if $\tau'$ is obtained by resolving a crossing of $\tau$. %This partial order has been studied by

The uncrossing partially ordered set $P_n$ is defined on the set of matchings on $2n$ points on a circle represented with wires. The order relation is $\tau'\leq \tau$ in $P_n$ if and only if $\tau'$ is obtained by resolving a crossing of $\tau$. %This partial order has been studied by Alman-Lian-Tran, Huang-Wen-Xie, Kenyon, and Lam. %The posets $P_n$ emerged from studies of circular planar electrical networks. Circular planar electrical networks are finite weighted undirected graphs embedded into a disk, with boundary vertices and interior vertices. By Curtis-Ingerman-Morrow and de Verdi\`ere-Gitler-Vertigan, the electrical networks can be encoded with response matrices. By Lam the space of response matrices for electrical networks has a cell structure, and this cell structure can be described by the uncrossing partial orders. %Lam proves that the posets can be identified with dual Bruhat order on affine permutations of type $(n,2n)$. Using this identification, Lam proves the poset $\hat{P}_n$, the uncrossing poset $P_n$ with a unique minimum element $\hat{0}$ adjoined, is Eulerian. This thesis consists of two sets of results: (1) flag enumeration in intervals in the uncrossing poset $P_n$ and (2) cyclic sieving phenomenon on the set $P_n$.

I identify elements in $P_n$ with affine permutations of type $(0,2n)$. %This identification enables us to explicitly describe the elements in $P_n$ with the elements in $\mathcal{MP}_n$.

Using this identification, I adapt a technique in Reading for finding recursions for the cd-indices of intervals in Bruhat order of Coxeter groups to the uncrossing poset $P_n$. As a result, I produce recursions for the cd-indices of intervals in the uncrossing poset $P_n$. I also obtain a recursion for the ab-indices of intervals in the poset $\hat{P}_n$, the poset $P_n$ with a unique minimum $\hat0$ adjoined. %We define an induced subposet $\mathcal{MP}_n$ of the affine permutations under Bruhat order.

Reiner-Stanton-White defined the cyclic sieving phenomenon (CSP) associated to a finite cyclic group action on a finite set and a polynomial. Sagan observed the CSP on the set of non-crossing matchings with the $q$-Catalan polynomial. Bowling-Liang presented similar results on the set of $k$-crossing matchings for $1\leq k \leq 3$. In this dissertation, I focus on the set of all matchings on $[2n]:=\{1,2,\dots,2n\}$. I find the number of matchings fixed by $\frac{2\pi}{d}$ rotations for $d|2n$. I then find the polynomial $X_n(q)$ such that the set of matchings together with $X_n(q)$ and the cyclic group of order $2n$ exhibits the CSP.
ContributorsKim, Younghwan (Author) / Fishel, Susanna (Thesis advisor) / Bremner, Andrew (Committee member) / Czygrinow, Andrzej (Committee member) / Kierstead, Henry (Committee member) / Paupert, Julien (Committee member) / Arizona State University (Publisher)
Created2018
157198-Thumbnail Image.png
Description
In the 1980's, Gromov and Piatetski-Shapiro introduced a technique called "hybridization'' which allowed them to produce non-arithmetic hyperbolic lattices from two non-commensurable arithmetic lattices. It has been asked whether an analogous hybridization technique exists for complex hyperbolic lattices, because certain geometric obstructions make it unclear how to adapt this technique.

In the 1980's, Gromov and Piatetski-Shapiro introduced a technique called "hybridization'' which allowed them to produce non-arithmetic hyperbolic lattices from two non-commensurable arithmetic lattices. It has been asked whether an analogous hybridization technique exists for complex hyperbolic lattices, because certain geometric obstructions make it unclear how to adapt this technique. This thesis explores one possible construction (originally due to Hunt) in depth and uses it to produce arithmetic lattices, non-arithmetic lattices, and thin subgroups in SU(2,1).
ContributorsWells, Joseph (Author) / Paupert, Julien (Thesis advisor) / Kotschwar, Brett (Committee member) / Childress, Nancy (Committee member) / Fishel, Susanna (Committee member) / Kawski, Matthias (Committee member) / Arizona State University (Publisher)
Created2019
171758-Thumbnail Image.png
Description
The author employs bundle theory to investigate dynamics on C*- algebras. Using methods old and new to define dynamics on topological spaces (often with additional structure), implications of the dynamics are investigated in the non-commutative setting, and in suitable situations the dynamics are classified. As a result, new Morita equivalence

The author employs bundle theory to investigate dynamics on C*- algebras. Using methods old and new to define dynamics on topological spaces (often with additional structure), implications of the dynamics are investigated in the non-commutative setting, and in suitable situations the dynamics are classified. As a result, new Morita equivalence results are derived and new settings introduced in the study of crossed products, whether by group coactions or by actions of groups and groupoids.
ContributorsHall, Lucas (Author) / Quigg, John (Thesis advisor) / Kaliszewski, S. (Committee member) / Spielberg, Jack (Committee member) / Paupert, Julien (Committee member) / Kotschwar, Brett (Committee member) / Arizona State University (Publisher)
Created2022
161884-Thumbnail Image.png
Description
Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or reduced words, and the collection of all such reduced words is denoted $R(\sigma)$. Any

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or reduced words, and the collection of all such reduced words is denoted $R(\sigma)$. Any reduced word of $\sigma$ can be transformed into any other by a sequence of commutation moves or long braid moves. One area of interest in these sets are the congruence classes defined by using only braid moves or only commutation moves. This document will present work towards a conjectured relationship between the number of reduced words and the number of braid classes. The set $R(\sigma)$ can be drawn as a graph, $G(\sigma)$, where the vertices are the reduced words, and the edges denote the presence of a commutation or braid move between the words. This paper will present brand new work on subgraph structures in $G(\sigma)$, as well as new formulas to count the number of braid edges and commutation edges in $G(\sigma)$. The permutation $\sigma$ covers $\tau$ in the weak order poset if the length of $\tau$ is one less than the length of $\sigma$, and there exists a simple transposition $s_i$ such that $\sigma = \tau s_i$. This paper will cover new work on the relationships between the size of $R(\sigma)$ and $R(\tau)$, and how this creates a new method of writing reduced decompositions of $\sigma$ as products of permutations $\alpha$ and $\beta$, where both $\alpha$ and $\beta$ have a length greater than one. Finally, this thesis will also discuss how these results help relate the number of reduced words and the number of braid classes in certain cases.
ContributorsElder, Jennifer E (Author) / Fishel, Susanna (Thesis advisor) / Childress, Nancy (Committee member) / Czygrinow, Andrzej (Committee member) / Paupert, Julien (Committee member) / Vega, Oscar (Committee member) / Arizona State University (Publisher)
Created2021
161819-Thumbnail Image.png
Description
This thesis explores several questions concerning the preservation of geometric structure under the Ricci flow, an evolution equation for Riemannian metrics. Within the class of complete solutions with bounded curvature, short-time existence and uniqueness of solutions guarantee that symmetries and many other geometric features are preserved along the flow. However,

This thesis explores several questions concerning the preservation of geometric structure under the Ricci flow, an evolution equation for Riemannian metrics. Within the class of complete solutions with bounded curvature, short-time existence and uniqueness of solutions guarantee that symmetries and many other geometric features are preserved along the flow. However, much less is known about the analytic and geometric properties of solutions of potentially unbounded curvature. The first part of this thesis contains a proof that the full holonomy group is preserved, up to isomorphism, forward and backward in time. The argument reduces the problem to the preservation of reduced holonomy via an analysis of the equation satisfied by parallel translation around a loop with respect to the evolving metric. The subsequent chapter examines solutions satisfying a certain instantaneous, but nonuniform, curvature bound, and shows that when such solutions split as a product initially, they will continue to split for all time. This problem is encoded as one of uniqueness for an auxiliary system constructed from a family of time-dependent, orthogonal distributions of the tangent bundle. The final section presents some details of an ongoing project concerning the uniqueness of asymptotically product gradient shrinking Ricci solitons, including the construction of a certain system of mixed differential inequalities which measures the extent to which such a soliton fails to split.
ContributorsCook, Mary (Author) / Kotschwar, Brett (Thesis advisor) / Paupert, Julien (Committee member) / Kawski, Matthias (Committee member) / Kaliszewski, Steven (Committee member) / Fishel, Susanna (Committee member) / Arizona State University (Publisher)
Created2021