Matching Items (16)
Filtering by
- All Subjects: Mathematics
- Genre: Academic theses
- Genre: Doctoral Dissertation
- Creators: Castillo-Chavez, Carlos
- Creators: Colbourn, Charles
- Member of: Theses and Dissertations
Description
This study contributes to the ongoing discussion of Mathematical Knowledge for Teaching (MKT). It investigates the case of Rico, a high school mathematics teacher who had become known to his colleagues and his students as a superbly effective mathematics teacher. His students not only developed excellent mathematical skills, they also developed deep understanding of the mathematics they learned. Moreover, Rico redesigned his curricula and instruction completely so that they provided a means of support for his students to learn mathematics the way he intended. The purpose of this study was to understand the sources of Rico's effectiveness. The data for this study was generated in three phases. Phase I included videos of Rico's lessons during one semester of an Algebra II course, post-lesson reflections, and Rico's self-constructed instructional materials. An analysis of Phase I data led to Phase II, which consisted of eight extensive stimulated-reflection interviews with Rico. Phase III consisted of a conceptual analysis of the prior phases with the aim of creating models of Rico's mathematical conceptions, his conceptions of his students' mathematical understandings, and his images of instruction and instructional design. Findings revealed that Rico had developed profound personal understandings, grounded in quantitative reasoning, of the mathematics that he taught, and profound pedagogical understandings that supported these very same ways of thinking in his students. Rico's redesign was driven by three factors: (1) the particular way in which Rico himself understood the mathematics he taught, (2) his reflective awareness of those ways of thinking, and (3) his ability to envision what students might learn from different instructional approaches. Rico always considered what someone might already need to understand in order to understand "this" in the way he was thinking of it, and how understanding "this" might help students understand related ideas or methods. Rico's continual reflection on the mathematics he knew so as to make it more coherent, and his continual orientation to imagining how these meanings might work for students' learning, made Rico's mathematics become a mathematics of students--impacting how he assessed his practice and engaging him in a continual process of developing MKT.
ContributorsLage Ramírez, Ana Elisa (Author) / Thompson, Patrick W. (Thesis advisor) / Carlson, Marilyn P. (Committee member) / Castillo-Chavez, Carlos (Committee member) / Saldanha, Luis (Committee member) / Middleton, James A. (Committee member) / Arizona State University (Publisher)
Created2011
Description
A central concept of combinatorics is partitioning structures with given constraints. Partitions of on-line posets and on-line graphs, which are dynamic versions of the more familiar static structures posets and graphs, are examined. In the on-line setting, vertices are continually added to a poset or graph while a chain partition or coloring (respectively) is maintained. %The optima of the static cases cannot be achieved in the on-line setting. Both upper and lower bounds for the optimum of the number of chains needed to partition a width $w$ on-line poset exist. Kierstead's upper bound of $\frac{5^w-1}{4}$ was improved to $w^{14 \lg w}$ by Bosek and Krawczyk. This is improved to $w^{3+6.5 \lg w}$ by employing the First-Fit algorithm on a family of restricted posets (expanding on the work of Bosek and Krawczyk) . Namely, the family of ladder-free posets where the $m$-ladder is the transitive closure of the union of two incomparable chains $x_1\le\dots\le x_m$, $y_1\le\dots\le y_m$ and the set of comparabilities $\{x_1\le y_1,\dots, x_m\le y_m\}$. No upper bound on the number of colors needed to color a general on-line graph exists. To lay this fact plain, the performance of on-line coloring of trees is shown to be particularly problematic. There are trees that require $n$ colors to color on-line for any positive integer $n$. Furthermore, there are trees that usually require many colors to color on-line even if they are presented without any particular strategy. For restricted families of graphs, upper and lower bounds for the optimum number of colors needed to maintain an on-line coloring exist. In particular, circular arc graphs can be colored on-line using less than 8 times the optimum number from the static case. This follows from the work of Pemmaraju, Raman, and Varadarajan in on-line coloring of interval graphs.
ContributorsSmith, Matthew Earl (Author) / Kierstead, Henry A (Thesis advisor) / Colbourn, Charles (Committee member) / Czygrinow, Andrzej (Committee member) / Fishel, Susanna (Committee member) / Hurlbert, Glenn (Committee member) / Arizona State University (Publisher)
Created2012
Description
Mathematical modeling of infectious diseases can help public health officials to make decisions related to the mitigation of epidemic outbreaks. However, over or under estimations of the morbidity of any infectious disease can be problematic. Therefore, public health officials can always make use of better models to study the potential implication of their decisions and strategies prior to their implementation. Previous work focuses on the mechanisms underlying the different epidemic waves observed in Mexico during the novel swine origin influenza H1N1 pandemic of 2009 and showed extensions of classical models in epidemiology by adding temporal variations in different parameters that are likely to change during the time course of an epidemic, such as, the influence of media, social distancing, school closures, and how vaccination policies may affect different aspects of the dynamics of an epidemic. This current work further examines the influence of different factors considering the randomness of events by adding stochastic processes to meta-population models. I present three different approaches to compare different stochastic methods by considering discrete and continuous time. For the continuous time stochastic modeling approach I consider the continuous-time Markov chain process using forward Kolmogorov equations, for the discrete time stochastic modeling I consider stochastic differential equations using Wiener's increment and Poisson point increments, and also I consider the discrete-time Markov chain process. These first two stochastic modeling approaches will be presented in a one city and two city epidemic models using, as a base, our deterministic model. The last one will be discussed briefly on a one city SIS and SIR-type model.
ContributorsCruz-Aponte, Maytee (Author) / Wirkus, Stephen A. (Thesis advisor) / Castillo-Chavez, Carlos (Thesis advisor) / Camacho, Erika T. (Committee member) / Kang, Yun (Committee member) / Arizona State University (Publisher)
Created2014
Description
Every graph can be colored with one more color than its maximum degree. A well-known theorem of Brooks gives the precise conditions under which a graph can be colored with maximum degree colors. It is natural to ask for the required conditions on a graph to color with one less color than the maximum degree; in 1977 Borodin and Kostochka conjectured a solution for graphs with maximum degree at least 9: as long as the graph doesn't contain a maximum-degree-sized clique, it can be colored with one fewer than the maximum degree colors. This study attacks the conjecture on multiple fronts. The first technique is an extension of a vertex shuffling procedure of Catlin and is used to prove the conjecture for graphs with edgeless high vertex subgraphs. This general approach also bears more theoretical fruit. The second technique is an extension of a method Kostochka used to reduce the Borodin-Kostochka conjecture to the maximum degree 9 case. Results on the existence of independent transversals are used to find an independent set intersecting every maximum clique in a graph. The third technique uses list coloring results to exclude induced subgraphs in a counterexample to the conjecture. The classification of such excludable graphs that decompose as the join of two graphs is the backbone of many of the results presented here. The fourth technique uses the structure theorem for quasi-line graphs of Chudnovsky and Seymour in concert with the third technique to prove the Borodin-Kostochka conjecture for claw-free graphs. The fifth technique adds edges to proper induced subgraphs of a minimum counterexample to gain control over the colorings produced by minimality. The sixth technique adapts a recoloring technique originally developed for strong coloring by Haxell and by Aharoni, Berger and Ziv to general coloring. Using this recoloring technique, the Borodin-Kostochka conjectured is proved for graphs where every vertex is in a large clique. The final technique is naive probabilistic coloring as employed by Reed in the proof of the Borodin-Kostochka conjecture for large maximum degree. The technique is adapted to prove the Borodin-Kostochka conjecture for list coloring for large maximum degree.
ContributorsRabern, Landon (Author) / Kierstead, Henry (Thesis advisor) / Colbourn, Charles (Committee member) / Czygrinow, Andrzej (Committee member) / Fishel, Susanna (Committee member) / Hurlbert, Glenn (Committee member) / Arizona State University (Publisher)
Created2013
Description
Different logic-based knowledge representation formalisms have different limitations either with respect to expressivity or with respect to computational efficiency. First-order logic, which is the basis of Description Logics (DLs), is not suitable for defeasible reasoning due to its monotonic nature. The nonmonotonic formalisms that extend first-order logic, such as circumscription and default logic, are expressive but lack efficient implementations. The nonmonotonic formalisms that are based on the declarative logic programming approach, such as Answer Set Programming (ASP), have efficient implementations but are not expressive enough for representing and reasoning with open domains. This dissertation uses the first-order stable model semantics, which extends both first-order logic and ASP, to relate circumscription to ASP, and to integrate DLs and ASP, thereby partially overcoming the limitations of the formalisms. By exploiting the relationship between circumscription and ASP, well-known action formalisms, such as the situation calculus, the event calculus, and Temporal Action Logics, are reformulated in ASP. The advantages of these reformulations are shown with respect to the generality of the reasoning tasks that can be handled and with respect to the computational efficiency. The integration of DLs and ASP presented in this dissertation provides a framework for integrating rules and ontologies for the semantic web. This framework enables us to perform nonmonotonic reasoning with DL knowledge bases. Observing the need to integrate action theories and ontologies, the above results are used to reformulate the problem of integrating action theories and ontologies as a problem of integrating rules and ontologies, thus enabling us to use the computational tools developed in the context of the latter for the former.
ContributorsPalla, Ravi (Author) / Lee, Joohyung (Thesis advisor) / Baral, Chitta (Committee member) / Kambhampati, Subbarao (Committee member) / Lifschitz, Vladimir (Committee member) / Arizona State University (Publisher)
Created2012
Description
The Quantum Harmonic Oscillator is one of the most important models in Quantum Mechanics. Analogous to the classical mass vibrating back and forth on a spring, the quantum oscillator system has attracted substantial attention over the years because of its importance in many advanced and difficult quantum problems. This dissertation deals with solving generalized models of the time-dependent Schrodinger equation which are called generalized quantum harmonic oscillators, and these are characterized by an arbitrary quadratic Hamiltonian of linear momentum and position operators. The primary challenge in this work is that most quantum models with timedependence are not solvable explicitly, yet this challenge became the driving motivation for this work. In this dissertation, the methods used to solve the time-dependent Schrodinger equation are the fundamental singularity (or Green's function) and the Fourier (eigenfunction expansion) methods. Certain Riccati- and Ermakov-type systems arise, and these systems are highlighted and investigated. The overall aims of this dissertation are to show that quadratic Hamiltonian systems are completely integrable systems, and to provide explicit approaches to solving the time-dependent Schr¨odinger equation governed by an arbitrary quadratic Hamiltonian operator. The methods and results established in the dissertation are not yet well recognized in the literature, yet hold for high promise for further future research. Finally, the most recent results in the dissertation correspond to the harmonic oscillator group and its symmetries. A simple derivation of the maximum kinematical invariance groups of the free particle and quantum harmonic oscillator is constructed from the view point of the Riccati- and Ermakov-type systems, which shows an alternative to the traditional Lie Algebra approach. To conclude, a missing class of solutions of the time-dependent Schr¨odinger equation for the simple harmonic oscillator in one dimension is constructed. Probability distributions of the particle linear position and momentum, are emphasized with Mathematica animations. The eigenfunctions qualitatively differ from the traditional standing waves of the one-dimensional Schrodinger equation. The physical relevance of these dynamic states is still questionable, and in order to investigate their physical meaning, animations could also be created for the squeezed coherent states. This will be addressed in future work.
ContributorsLopez, Raquel (Author) / Suslov, Sergei K (Thesis advisor) / Radunskaya, Ami (Committee member) / Castillo-Chavez, Carlos (Committee member) / Platte, Rodrigo (Committee member) / Arizona State University (Publisher)
Created2012
Description
Gray codes are perhaps the best known structures for listing sequences of combinatorial objects, such as binary strings. Simply defined as a minimal change listing, Gray codes vary greatly both in structure and in the types of objects that they list. More specific types of Gray codes are universal cycles and overlap sequences. Universal cycles are Gray codes on a set of strings of length n in which the first n-1 letters of one object are the same as the last n-1 letters of its predecessor in the listing. Overlap sequences allow this overlap to vary between 1 and n-1. Some of our main contributions to the areas of Gray codes and universal cycles include a new Gray code algorithm for fixed weight m-ary words, and results on the existence of universal cycles for weak orders on [n]. Overlap cycles are a relatively new structure with very few published results. We prove the existence of s-overlap cycles for k-permutations of [n], which has been an open research problem for several years, as well as constructing 1- overlap cycles for Steiner triple and quadruple systems of every order. Also included are various other results of a similar nature covering other structures such as binary strings, m-ary strings, subsets, permutations, weak orders, partitions, and designs. These listing structures lend themselves readily to some classes of combinatorial objects, such as binary n-tuples and m-ary n-tuples. Others require more work to find an appropriate structure, such as k-subsets of an n-set, weak orders, and designs. Still more require a modification in the representation of the objects to fit these structures, such as partitions. Determining when and how we can fit these sets of objects into our three listing structures is the focus of this dissertation.
ContributorsHoran, Victoria E (Author) / Hurlbert, Glenn H. (Thesis advisor) / Czygrinow, Andrzej (Committee member) / Fishel, Susanna (Committee member) / Colbourn, Charles (Committee member) / Sen, Arunabha (Committee member) / Arizona State University (Publisher)
Created2012
Description
The primary focus of this dissertation lies in extremal combinatorics, in particular intersection theorems in finite set theory. A seminal result in the area is the theorem of Erdos, Ko and Rado which finds the upper bound on the size of an intersecting family of subsets of an n-element set and characterizes the structure of families which attain this upper bound. A major portion of this dissertation focuses on a recent generalization of the Erdos--Ko--Rado theorem which considers intersecting families of independent sets in graphs. An intersection theorem is proved for a large class of graphs, namely chordal graphs which satisfy an additional condition and similar problems are considered for trees, bipartite graphs and other special classes. A similar extension is also formulated for cross-intersecting families and results are proved for chordal graphs and cycles. A well-known generalization of the EKR theorem for k-wise intersecting families due to Frankl is also considered. A stability version of Frankl's theorem is proved, which provides additional structural information about k-wise intersecting families which have size close to the maximum upper bound. A graph-theoretic generalization of Frankl's theorem is also formulated and proved for perfect matching graphs. Finally, a long-standing conjecture of Chvatal regarding structure of maximum intersecting families in hereditary systems is considered. An intersection theorem is proved for hereditary families which have rank 3 using a powerful tool of Erdos and Rado which is called the Sunflower Lemma.
ContributorsKamat, Vikram M (Author) / Hurlbert, Glenn (Thesis advisor) / Colbourn, Charles (Committee member) / Czygrinow, Andrzej (Committee member) / Fishel, Susanna (Committee member) / Kierstead, Henry (Committee member) / Arizona State University (Publisher)
Created2011
Description
In the traditional setting of quantum mechanics, the Hamiltonian operator does not depend on time. While some Schrödinger equations with time-dependent Hamiltonians have been solved, explicitly solvable cases are typically scarce. This thesis is a collection of papers in which this first author along with Suslov, Suazo, and Lopez, has worked on solving a series of Schrödinger equations with a time-dependent quadratic Hamiltonian that has applications in problems of quantum electrodynamics, lasers, quantum devices such as quantum dots, and external varying fields. In particular the author discusses a new completely integrable case of the time-dependent Schrödinger equation in R^n with variable coefficients for a modified oscillator, which is dual with respect to the time inversion to a model of the quantum oscillator considered by Meiler, Cordero-Soto, and Suslov. A second pair of dual Hamiltonians is found in the momentum representation. Our examples show that in mathematical physics and quantum mechanics a change in the direction of time may require a total change of the system dynamics in order to return the system back to its original quantum state. The author also considers several models of the damped oscillators in nonrelativistic quantum mechanics in a framework of a general approach to the dynamics of the time-dependent Schrödinger equation with variable quadratic Hamiltonians. The Green functions are explicitly found in terms of elementary functions and the corresponding gauge transformations are discussed. The factorization technique is applied to the case of a shifted harmonic oscillator. The time-evolution of the expectation values of the energy related operators is determined for two models of the quantum damped oscillators under consideration. The classical equations of motion for the damped oscillations are derived for the corresponding expectation values of the position operator. Finally, the author constructs integrals of motion for several models of the quantum damped oscillators in a framework of a general approach to the time-dependent Schrödinger equation with variable quadratic Hamiltonians. An extension of the Lewis-Riesenfeld dynamical invariant is given. The time-evolution of the expectation values of the energy related positive operators is determined for the oscillators under consideration. A proof of uniqueness of the corresponding Cauchy initial value problem is discussed as an application.
ContributorsCordero-Soto, Ricardo J (Author) / Suslov, Sergei (Thesis advisor) / Castillo-Chavez, Carlos (Thesis advisor) / Engman, Martin (Committee member) / Herrera-Valdez, Marco (Committee member) / Arizona State University (Publisher)
Created2011
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