Browsing by Author "Blackman, Claire"

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    Open Access
    The hunt for quasi-periodicities with wavelet and camera
    (2008) Blackman, Claire
    Includes abstract. Includes bibliographical references (p. 357-379).
  • Thumbnail Image
    Item
    Open Access
    Solutions to the conjugacy search and decision problems in the braid group using finite conjugacy class invariants
    (2022) Erasmus, Sane´; Blackman, Claire; Erwin, David
    For two braids, A, B ∈ Bn, the conjugacy decision problem asks whether another braid X ∈ Bn exists such that X−1 A X = B. If we know A, B ∈ Bn are indeed conjugate, the conjugacy search problem asks us to find a braid Y ∈ Bn such that Y −1 A Y = B. In this dissertation we investigate a number of solutions to the conjugacy search problem and conjugacy decision problem in the braid group, all of which use finite invariant subsets of the conjugacy class. In particular, we study the summit set, the super summit set, the improved super summit set algorithm which utilises minimal simple elements, the ultra summit set, improvements to the ultra summit set solution using graph theory, and lastly the set of sliding circuits. As part of this investigation, we also study normal forms of braids, partial orders on the braid group, and the Garside group which generalises the braid group.
  • Thumbnail Image
    Item
    Open Access
    The Classical Lie algebras are more simple than they may appear
    (2021) Brache, Chad; Blackman, Claire
    The purpose of this dissertation is to consider the classical Lie Algebras, namely: so(n, C), sl(n, C) and sp(n, C), n ≥ 2. Our aim will be to prove that if a Lie Algebra L is classical, except for so(2, C) and so(4, C), then it is simple. The classification and analysis will include finding their root systems and the associated Dynkin diagrams. The phrase it's the journey that teaches you a lot about your destination applies quite well here, as the bulk of our discussion will be assembling the tools necessary for proving simplicity. We will begin with some linear algebra proving the Primary decomposition theorem and the Cayley-Hamilton Theorem. Following this, we dive into the world of Lie algebras where we look at Lie algebras of dimensions 1, 2 and 3, representations of Lie algebras, weight spaces, Cartan's criteria and the root space decomposition of a Lie algebra L and define the Dynkin diagram and Cartan matrix. This will all culminate and serve as our arsenal in proving that these classical Lie algebras are all rather simple.