Matching Items (18)
Filtering by
- All Subjects: Mathematics
- Genre: Academic theses
- Creators: Spielberg, John
- Creators: Smith, Hal
Description
In this thesis, I investigate the C*-algebras and related constructions that arise from combinatorial structures such as directed graphs and their generalizations. I give a complete characterization of the C*-correspondences associated to directed graphs as well as results about obstructions to a similar characterization of these objects for generalizations of directed graphs. Viewing the higher-dimensional analogues of directed graphs through the lens of product systems, I give a rigorous proof that topological k-graphs are essentially product systems over N^k of topological graphs. I introduce a "compactly aligned" condition for such product systems of graphs and show that this coincides with the similarly-named conditions for topological k-graphs and for the associated product systems over N^k of C*-correspondences. Finally I consider the constructions arising from topological dynamical systems consisting of a locally compact Hausdorff space and k commuting local homeomorphisms. I show that in this case, the associated topological k-graph correspondence is isomorphic to the product system over N^k of C*-correspondences arising from a related Exel-Larsen system. Moreover, I show that the topological k-graph C*-algebra has a crossed product structure in the sense of Larsen.
ContributorsPatani, Nura (Author) / Kaliszewski, Steven (Thesis advisor) / Quigg, John (Thesis advisor) / Bremner, Andrew (Committee member) / Kawski, Matthias (Committee member) / Spielberg, John (Committee member) / Arizona State University (Publisher)
Created2011
Description
The theory of geometric quantum mechanics describes a quantum system as a Hamiltonian dynamical system, with a projective Hilbert space regarded as the phase space. This thesis extends the theory by including some aspects of the symplectic topology of the quantum phase space. It is shown that the quantum mechanical uncertainty principle is a special case of an inequality from J-holomorphic map theory, that is, J-holomorphic curves minimize the difference between the quantum covariance matrix determinant and a symplectic area. An immediate consequence is that a minimal determinant is a topological invariant, within a fixed homology class of the curve. Various choices of quantum operators are studied with reference to the implications of the J-holomorphic condition. The mean curvature vector field and Maslov class are calculated for a lagrangian torus of an integrable quantum system. The mean curvature one-form is simply related to the canonical connection which determines the geometric phases and polarization linear response. Adiabatic deformations of a quantum system are analyzed in terms of vector bundle classifying maps and related to the mean curvature flow of quantum states. The dielectric response function for a periodic solid is calculated to be the curvature of a connection on a vector bundle.
ContributorsSanborn, Barbara (Author) / Suslov, Sergei K (Thesis advisor) / Suslov, Sergei (Committee member) / Spielberg, John (Committee member) / Quigg, John (Committee member) / Menéndez, Jose (Committee member) / Jones, Donald (Committee member) / Arizona State University (Publisher)
Created2011
Description
Bacteriophage (phage) are viruses that infect bacteria. Typical laboratory experiments show that in a chemostat containing phage and susceptible bacteria species, a mutant bacteria species will evolve. This mutant species is usually resistant to the phage infection and less competitive compared to the susceptible bacteria species. In some experiments, both susceptible and resistant bacteria species, as well as phage, can coexist at an equilibrium for hundreds of hours. The current research is inspired by these observations, and the goal is to establish a mathematical model and explore sufficient and necessary conditions for the coexistence. In this dissertation a model with infinite distributed delay terms based on some existing work is established. A rigorous analysis of the well-posedness of this model is provided, and it is proved that the susceptible bacteria persist. To study the persistence of phage species, a "Phage Reproduction Number" (PRN) is defined. The mathematical analysis shows phage persist if PRN > 1 and vanish if PRN < 1. A sufficient condition and a necessary condition for persistence of resistant bacteria are given. The persistence of the phage is essential for the persistence of resistant bacteria. Also, the resistant bacteria persist if its fitness is the same as the susceptible bacteria and if PRN > 1. A special case of the general model leads to a system of ordinary differential equations, for which numerical simulation results are presented.
ContributorsHan, Zhun (Author) / Smith, Hal (Thesis advisor) / Armbruster, Dieter (Committee member) / Kawski, Matthias (Committee member) / Kuang, Yang (Committee member) / Thieme, Horst (Committee member) / Arizona State University (Publisher)
Created2012
DescriptionCantor sets are totally disconnected, compact, metrizable, and contain no isolated points. All Cantor sets are homeomorphic to each other, but the addition of the metric yields new properties which can be detected by their correspondence with the boundaries of infinite rooted trees.
ContributorsAmes, Robert (Author) / Spielberg, John (Thesis advisor) / Kaliszewski, Steven (Committee member) / Quigg, John (Committee member) / Arizona State University (Publisher)
Created2022
DescriptionUnderstanding the evolution of opinions is a delicate task as the dynamics of how one changes their opinion based on their interactions with others are unclear.
ContributorsWeber, Dylan (Author) / Motsch, Sebastien (Thesis advisor) / Lanchier, Nicolas (Committee member) / Platte, Rodrigo (Committee member) / Armbruster, Dieter (Committee member) / Fricks, John (Committee member) / Arizona State University (Publisher)
Created2021
Description
Since the seminal work of Tur ́an, the forbidden subgraph problem has been among the central questions in extremal graph theory. Let ex(n;F) be the smallest number m such that any graph on n vertices with m edges contains F as a subgraph. Then the forbidden subgraph problem asks to find ex(n; F ) for various graphs F . The question can be further generalized by asking for the extreme values of other graph parameters like minimum degree, maximum degree, or connectivity. We call this type of question a Tura ́n-type problem. In this thesis, we will study Tura ́n-type problems and their variants for graphs and hypergraphs.
Chapter 2 contains a Tura ́n-type problem for cycles in dense graphs. The main result in this chapter gives a tight bound for the minimum degree of a graph which guarantees existence of disjoint cycles in the case of dense graphs. This, in particular, answers in the affirmative a question of Faudree, Gould, Jacobson and Magnant in the case of dense graphs.
In Chapter 3, similar problems for trees are investigated. Recently, Faudree, Gould, Jacobson and West studied the minimum degree conditions for the existence of certain spanning caterpillars. They proved certain bounds that guarantee existence of spanning caterpillars. The main result in Chapter 3 significantly improves their result and answers one of their questions by proving a tight minimum degree bound for the existence of such structures.
Chapter 4 includes another Tur ́an-type problem for loose paths of length three in a 3-graph. As a corollary, an upper bound for the multi-color Ramsey number for the loose path of length three in a 3-graph is achieved.
Chapter 2 contains a Tura ́n-type problem for cycles in dense graphs. The main result in this chapter gives a tight bound for the minimum degree of a graph which guarantees existence of disjoint cycles in the case of dense graphs. This, in particular, answers in the affirmative a question of Faudree, Gould, Jacobson and Magnant in the case of dense graphs.
In Chapter 3, similar problems for trees are investigated. Recently, Faudree, Gould, Jacobson and West studied the minimum degree conditions for the existence of certain spanning caterpillars. They proved certain bounds that guarantee existence of spanning caterpillars. The main result in Chapter 3 significantly improves their result and answers one of their questions by proving a tight minimum degree bound for the existence of such structures.
Chapter 4 includes another Tur ́an-type problem for loose paths of length three in a 3-graph. As a corollary, an upper bound for the multi-color Ramsey number for the loose path of length three in a 3-graph is achieved.
ContributorsYie, Jangwon (Author) / Czygrinow, Andrzej (Thesis advisor) / Kierstead, Henry (Committee member) / Colbourn, Charles (Committee member) / Fishel, Susanna (Committee member) / Spielberg, John (Committee member) / Arizona State University (Publisher)
Created2018
Description
The main part of this work establishes existence, uniqueness and regularity properties of measure-valued solutions of a nonlinear hyperbolic conservation law with non-local velocities. Major challenges stem from in- and out-fluxes containing nonzero pure-point parts which cause discontinuities of the velocities. This part is preceded, and motivated, by an extended study which proves that an associated optimal control problem has no optimal $L^1$-solutions that are supported on short time intervals.
The hyperbolic conservation law considered here is a well-established model for a highly re-entrant semiconductor manufacturing system. Prior work established well-posedness for $L^1$-controls and states, and existence of optimal solutions for $L^2$-controls, states, and control objectives. The results on measure-valued solutions presented here reduce to the existing literature in the case of initial state and in-flux being absolutely continuous measures. The surprising well-posedness (in the face of measures containing nonzero pure-point part and discontinuous velocities) is directly related to characteristic features of the model that capture the highly re-entrant nature of the semiconductor manufacturing system.
More specifically, the optimal control problem is to minimize an $L^1$-functional that measures the mismatch between actual and desired accumulated out-flux. The focus is on the transition between equilibria with eventually zero backlog. In the case of a step up to a larger equilibrium, the in-flux not only needs to increase to match the higher desired out-flux, but also needs to increase the mass in the factory and to make up for the backlog caused by an inverse response of the system. The optimality results obtained confirm the heuristic inference that the optimal solution should be an impulsive in-flux, but this is no longer in the space of $L^1$-controls.
The need for impulsive controls motivates the change of the setting from $L^1$-controls and states to controls and states that are Borel measures. The key strategy is to temporarily abandon the Eulerian point of view and first construct Lagrangian solutions. The final section proposes a notion of weak measure-valued solutions and proves existence and uniqueness of such.
In the case of the in-flux containing nonzero pure-point part, the weak solution cannot depend continuously on the time with respect to any norm. However, using semi-norms that are related to the flat norm, a weaker form of continuity of solutions with respect to time is proven. It is conjectured that also a similar weak continuous dependence on initial data holds with respect to a variant of the flat norm.
The hyperbolic conservation law considered here is a well-established model for a highly re-entrant semiconductor manufacturing system. Prior work established well-posedness for $L^1$-controls and states, and existence of optimal solutions for $L^2$-controls, states, and control objectives. The results on measure-valued solutions presented here reduce to the existing literature in the case of initial state and in-flux being absolutely continuous measures. The surprising well-posedness (in the face of measures containing nonzero pure-point part and discontinuous velocities) is directly related to characteristic features of the model that capture the highly re-entrant nature of the semiconductor manufacturing system.
More specifically, the optimal control problem is to minimize an $L^1$-functional that measures the mismatch between actual and desired accumulated out-flux. The focus is on the transition between equilibria with eventually zero backlog. In the case of a step up to a larger equilibrium, the in-flux not only needs to increase to match the higher desired out-flux, but also needs to increase the mass in the factory and to make up for the backlog caused by an inverse response of the system. The optimality results obtained confirm the heuristic inference that the optimal solution should be an impulsive in-flux, but this is no longer in the space of $L^1$-controls.
The need for impulsive controls motivates the change of the setting from $L^1$-controls and states to controls and states that are Borel measures. The key strategy is to temporarily abandon the Eulerian point of view and first construct Lagrangian solutions. The final section proposes a notion of weak measure-valued solutions and proves existence and uniqueness of such.
In the case of the in-flux containing nonzero pure-point part, the weak solution cannot depend continuously on the time with respect to any norm. However, using semi-norms that are related to the flat norm, a weaker form of continuity of solutions with respect to time is proven. It is conjectured that also a similar weak continuous dependence on initial data holds with respect to a variant of the flat norm.
ContributorsGong, Xiaoqian, Ph.D (Author) / Kawski, Matthias (Thesis advisor) / Kaliszewski, Steven (Committee member) / Motsch, Sebastien (Committee member) / Smith, Hal (Committee member) / Thieme, Horst (Committee member) / Arizona State University (Publisher)
Created2019
Description
Rabies is an infectious viral disease. It is usually fatal if a victim reaches the rabid stage, which starts after the appearance of disease symptoms. The disease virus attacks the central nervous system, and then it migrates from peripheral nerves to the spinal cord and brain. At the time when the rabies virus reaches the brain, the incubation period is over and the symptoms of clinical disease appear on the victim. From the brain, the virus travels via nerves to the salivary glands and saliva.
A mathematical model is developed for the spread of rabies in a spatially distributed fox population to model the spread of the rabies epizootic through middle Europe that occurred in the second half of the 20th century. The model considers both territorial and wandering rabid foxes and includes a latent period for the infection. Since the model assumes these two kinds of rabid foxes, it is a system of both partial differential and integral equations (with integration
over space and, occasionally, also over time). To study the spreading speeds of the rabies epidemic, the model is reduced to a scalar Volterra-Hammerstein integral equation, and space-time Laplace transform of the integral equation is used to derive implicit formulas for the spreading speed. The spreading speeds are discussed and implicit formulas are given for latent periods of fixed length, exponentially distributed length, Gamma distributed length, and log-normally distributed length. A number of analytic and numerical results are shown pertaining to the spreading speeds.
Further, a numerical algorithm is described for the simulation
of the spread of rabies in a spatially distributed fox population on a bounded domain with Dirichlet boundary conditions. I propose the following methods for the numerical approximation of solutions. The partial differential and integral equations are discretized in the space variable by central differences of second order and by
the composite trapezoidal rule. Next, the ordinary or delay differential equations that are obtained this way are discretized in time by explicit
continuous Runge-Kutta methods of fourth order for ordinary and delay differential systems. My particular interest
is in how the partition of rabid foxes into
territorial and diffusing rabid foxes influences
the spreading speed, a question that can be answered by purely analytic means only for small basic reproduction numbers. I will restrict the numerical analysis
to latent periods of fixed length and to exponentially
distributed latent periods.
The results of the numerical calculations
are compared for latent periods
of fixed and exponentially distributed length
and for various proportions of territorial
and wandering rabid foxes.
The speeds of spread observed in the
simulations are compared
to spreading speeds obtained by numerically solving the analytic formulas
and to observed speeds of epizootic frontlines
in the European rabies outbreak 1940 to 1980.
A mathematical model is developed for the spread of rabies in a spatially distributed fox population to model the spread of the rabies epizootic through middle Europe that occurred in the second half of the 20th century. The model considers both territorial and wandering rabid foxes and includes a latent period for the infection. Since the model assumes these two kinds of rabid foxes, it is a system of both partial differential and integral equations (with integration
over space and, occasionally, also over time). To study the spreading speeds of the rabies epidemic, the model is reduced to a scalar Volterra-Hammerstein integral equation, and space-time Laplace transform of the integral equation is used to derive implicit formulas for the spreading speed. The spreading speeds are discussed and implicit formulas are given for latent periods of fixed length, exponentially distributed length, Gamma distributed length, and log-normally distributed length. A number of analytic and numerical results are shown pertaining to the spreading speeds.
Further, a numerical algorithm is described for the simulation
of the spread of rabies in a spatially distributed fox population on a bounded domain with Dirichlet boundary conditions. I propose the following methods for the numerical approximation of solutions. The partial differential and integral equations are discretized in the space variable by central differences of second order and by
the composite trapezoidal rule. Next, the ordinary or delay differential equations that are obtained this way are discretized in time by explicit
continuous Runge-Kutta methods of fourth order for ordinary and delay differential systems. My particular interest
is in how the partition of rabid foxes into
territorial and diffusing rabid foxes influences
the spreading speed, a question that can be answered by purely analytic means only for small basic reproduction numbers. I will restrict the numerical analysis
to latent periods of fixed length and to exponentially
distributed latent periods.
The results of the numerical calculations
are compared for latent periods
of fixed and exponentially distributed length
and for various proportions of territorial
and wandering rabid foxes.
The speeds of spread observed in the
simulations are compared
to spreading speeds obtained by numerically solving the analytic formulas
and to observed speeds of epizootic frontlines
in the European rabies outbreak 1940 to 1980.
ContributorsAlanazi, Khalaf Matar (Author) / Thieme, Horst R. (Thesis advisor) / Jackiewicz, Zdzislaw (Committee member) / Baer, Steven (Committee member) / Gardner, Carl (Committee member) / Kuang, Yang (Committee member) / Smith, Hal (Committee member) / Arizona State University (Publisher)
Created2018
Description
In recent decades, marine ecologists have conducted extensive field work and experiments to understand the interactions between bacteria and bacteriophage (phage) in marine environments. This dissertation provides a detailed rigorous framework for gaining deeper insight into these interactions. Specific features of the dissertation include the design of a new deterministic Lotka-Volterra model with n + 1 bacteria, n
+ 1 phage, with explicit nutrient, where the jth phage strain infects the first j bacterial strains, a perfectly nested infection network (NIN). This system is subject to trade-off conditions on the life-history traits of both bacteria and phage given in an earlier study Jover et al. (2013). Sufficient conditions are provided to show that a bacteria-phage community of arbitrary size with NIN can arise through the succession of permanent subcommunities, by the successive addition of one new population. Using uniform persistence theory, this entire community is shown to be permanent (uniformly persistent), meaning that all populations ultimately survive.
It is shown that a modified version of the original NIN Lotka-Volterra model with implicit nutrient considered by Jover et al. (2013) is permanent. A new one-to-one infection network (OIN) is also considered where each bacterium is infected by only one phage, and that phage infects only that bacterium. This model does not use the trade-offs on phage infection range, and bacterium resistance to phage. The OIN model is shown to be permanent, and using Lyapunov function theory, coupled with LaSalle’s Invariance Principle, the unique coexistence equilibrium associated with the NIN is globally asymptotically stable provided that the inter- and intra-specific bacterial competition coefficients are equal across all bacteria.
Finally, the OIN model is extended to a “Kill the Winner” (KtW) Lotka-Volterra model
of marine communities consisting of bacteria, phage, and zooplankton. The zooplankton
acts as a super bacteriophage, which infects all bacteria. This model is shown to be permanent.
+ 1 phage, with explicit nutrient, where the jth phage strain infects the first j bacterial strains, a perfectly nested infection network (NIN). This system is subject to trade-off conditions on the life-history traits of both bacteria and phage given in an earlier study Jover et al. (2013). Sufficient conditions are provided to show that a bacteria-phage community of arbitrary size with NIN can arise through the succession of permanent subcommunities, by the successive addition of one new population. Using uniform persistence theory, this entire community is shown to be permanent (uniformly persistent), meaning that all populations ultimately survive.
It is shown that a modified version of the original NIN Lotka-Volterra model with implicit nutrient considered by Jover et al. (2013) is permanent. A new one-to-one infection network (OIN) is also considered where each bacterium is infected by only one phage, and that phage infects only that bacterium. This model does not use the trade-offs on phage infection range, and bacterium resistance to phage. The OIN model is shown to be permanent, and using Lyapunov function theory, coupled with LaSalle’s Invariance Principle, the unique coexistence equilibrium associated with the NIN is globally asymptotically stable provided that the inter- and intra-specific bacterial competition coefficients are equal across all bacteria.
Finally, the OIN model is extended to a “Kill the Winner” (KtW) Lotka-Volterra model
of marine communities consisting of bacteria, phage, and zooplankton. The zooplankton
acts as a super bacteriophage, which infects all bacteria. This model is shown to be permanent.
ContributorsKorytowski, Daniel (Author) / Smith, Hal (Thesis advisor) / Gumel, Abba (Committee member) / Kuang, Yang (Committee member) / Gardner, Carl (Committee member) / Thieme, Horst (Committee member) / Arizona State University (Publisher)
Created2016
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 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.
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