UJDigispace Repository

Browsing Department of Mathematics (Pure and Applied Mathematics) (ETDs) by Title

Browsing Department of Mathematics (Pure and Applied Mathematics) (ETDs) by Title

Sort by: Order: Results:

  • Dorfling, Michael Jacobus (2001)
    The aim of this thesis is to investigate the topic of edge-colourings of graphs in the context of hereditary graph properties. We particularly aim to investigate analogues of reducibility, unique factorization and some ...
  • De Greef, Jacqueline (2013)
    Entanglement is a quantum resource with applications in quantum communication as well as quantum computing amongst others. Since quantum entanglement is such an abstract concept numerous mathematical measures exist. ...
  • Hardy, Yorick (May 2005)
    Keywords: entanglement, complexity, entropy, measurement In chapter 1 the basic principles of communication complexity are introduced. Two-party communication is described explicitly, and multi-party communication ...
  • Musekiwa, Alfred. (2005-11)
    In this study we consider the problem ofestiniating the slope in the simple linear errors-in-variables model. There are two different types of relationship that can he specified in the errors-in-variables model: one that ...
  • Marcon, Alister Justin (2012)
    In Chapter 1, we consider the relevant theory pertaining to graphs and digraphs that will be used in the study of flows in networks. Warshall’s algorithm for reachability is also considered since it will allow us to ...
  • Dorfling, Michael Jacobus (1999-02)
    The aim of the thesis is to develop game-theoretic techniques for dealing with common problems in model theory, mainly that of showing logical equivalence between structures, and to illustrate the effectiveness of the ...
  • Dorfling, Samantha (2001)
    In this thesis we investigate generalized chromatic numbers in the context of hereditary graph properties. We also investigate the general topic of invariants of graphs as well as graph properties. In Chapter 1 we give ...
  • Anderson, Keegan Doig (2011-11)
    Important ideas from dynamical systems theory and the restricted three-body problem are introduced. The intention is the application of dynamical systems theory techniques to the restricted three-body problem to better ...
  • Hardy, Alexandre (May 2005)
    The creation of smooth interpolating curves and surfaces is an important aspect of computer graphics. Trigonometric interpolation in the form of the Fourier transform has been a popular technique. For computer graphics, ...
  • Van der Straaten, Sjané Monique (2003)
    The basis for this study rests upon the question whether typical human reasoning is reliant upon the application of formal inference rules or not. Two major approaches on this topic, formal logic and mental model theory, ...
  • Ndzinisa, Dumsani Raymond (2013)
    Explicit schemes for integrating ODEs and time–dependent partial differential equations (in the method of lines–MoL–approach) are very well–known to be stable as long as the maximum sizes of their timesteps remain below a ...
  • Garner, Charles R. (2004)
    In this thesis, the ranks of many types of regular and strongly regular graphs are determined. Also determined are ranks of regular graphs under unary operations: the line graph, the complement, the subdivision graph, ...
  • Loubser, Anelda (1997)
    Die leerder met Wiskunde sukkel omdat hy nie 'n metode het om Wiskunde te leer nie. Groot druk word op die onderwyser geplaas, want hy moet nou vir die leerder leer hoe om Wiskunde te leer. Die vraag ontstaan of daar 'n ...
  • Moagi, Samuel John Teboho (1998)
    In this work we will need the basic knowledge of Graph Theory as our background and as we go along we will state and prove some of the Lattice and Set Theory results. Every graph in this work is considered as a finite ...
  • Le Roux, Jaco (2011-10-04)
    In this thesis we study the techniques used to calculate the Hamilton operators related to linear optical quantum computing. We also discuss the basic building blocks of linear optical quantum computing (LOQC) by looking ...
  • Kellerman, Ruaan (2005)
    The geometric relation of orthogonality - when the angle determined by two lines is a right angle - has a rich and interesting theory. We investigate geometric orthogonality structures from a formal logical and model ...
  • Marcon, Sinclair Antony (2012)
    In chapter 1, we give the reader some background concerning digraphs that are used in the discussion of Markov chains; namely, their Markov digraphs. Warshall’s Algorithm for reachability is also introduced as this is ...
  • Berger, Amelie Julie (2000)
    After giving basic definitions concerning additive hereditary properties of graphs, this document is divided into three main sections, concerning minimal reducible bounds, minimal forbidden subgraphs and prime ideals. We ...
  • Korostenski, Mareli (1975)
    Die eienskappe van 'n ring het 'n bepalende invloed op die eienskappe van die module oor daardie ring. So kan belangrike klasse van ringe gekarakteriseer word met behulp van module oar sodanige ringe. Origens blyk dat ...

Search UJDigispace


Browse

My Account