## Search

Now showing items 31-40 of 61

#### On the classification of toroidal circle planes.

(University of Canterbury, 2017)

We consider the problem of classifying toroidal circle planes with respect to the dimension
of their automorphism groups. With tools from topology, we prove that these groups are
Lie groups of dimension at most 6. From ...

#### Aspects of Matroid Connectivity

(University of Canterbury. School of Mathematics and Statistics, 2014)

Connectivity is a fundamental tool for matroid theorists, which has become increasingly important in the eventual solution of many problems in matroid theory. Loosely speaking, connectivity can be used to help describe a ...

#### Mathematical Modelling of Cancer Cell Population Dynamics

(University of Canterbury. Mathematics and Statistics, 2012)

Mathematical models, that depict the dynamics of a cancer cell population growing out of the human body (in vitro) in unconstrained microenvironment conditions, are considered in this thesis. Cancer cells in vitro grow and ...

#### Maximal quotient rings of prime nonsingular group algebras

(University of Canterbury. Mathematics, 1977)

Recent work by Goodearl and Handelman has shown that a prime, regular, right self-injective ring Q must be precisely one of the following: (a) a full linear ring (being either simple Artinian; or infinite dimensional full ...

#### The quadratic Hermite-Padé approximation

(University of Canterbury. Mathematics, 1989)

This thesis is concerned with the existence, behaviour and performance of the quadratic Hermite-Padé approximation.
It starts with the definition of the general Hermite-Padé approximation. Some of the problems which ...

#### Two topics in the theory of optimal trajectory analysis

(University of Canterbury. Mathematics, 1966)

The work presented in this thesis is concerned with certain problems in the domain of optimal trajectory analysis. The general problem in this field is to determine the ‘best’ way to use a certain travel vehicle to carry ...

#### The symmetry of graphs

(University of Canterbury. Mathematics, 1967)

The history of graphs goes back to the work of Eulerin his discovery of the equation
f – e + v = 2 relating the number of faces, edges and vertices of a polyhedron and his treatment of the puzzle of the bridges of ...

#### A census of 3-(12,6,4) and 2-(11,5,4) designs

(University of Canterbury. Mathematics, 1985)

This thesis documents the development of all possible non-isomorphic 3-(12,6,4) and 2-(11,5,4) designs. A representative copy of each of the 545 non-isomorphic 3-(12,6,4) designs along with all its non-trivial automorphisms ...

#### A new genetic algorithm based clustering for binary and imbalanced class data sets

(University of Canterbury, 2016)

This research was initially driven by the lack of clustering algorithms that specifically focus
on binary data. To overcome this gap in knowledge, a promising technique for analysing this
type of data became the main ...

#### Specializations of generalized Drinfel'd-Sokolov hierarchies

(University of Canterbury. Mathematics, 1996)

The primary objective of this work is to extend the existing body of research on specializations of Drinfel'd-Sokolov hierarchies of partial differential equations and to provide some examples thereof.
The hitherto ...