## Search

Now showing items 1-5 of 5

#### In search of 4 - (12,6,4) designs. Part I

(University of Canterbury, 1993)

As a first step towards finding all 4-(12, 6, 4) designs which are not 5-(12, 6, 1)
designs, it is shown that if such a design has a pair of blocks with five points in common,
then there is a unique way of assigning the ...

#### Infinite antichains of matroids with characteristic set {p}

(University of Canterbury, 1999)

For each prime p, we construct an infinite antichain of matroids in
which each matroid has characteristic set {p}. For p=2, each of the matroids
in our antichain is an excluded minor for the class of matroids representable ...

#### Shortest path algorithms for nearly acyclic directed graphs

(University of Canterbury. Computer Science and Software Engineering, 1997)

Abuaiadh and Kingston gave an efficient algorithm for the single source shortest path problem for a nearly acyclic graph with O(m+n log t) computing time, where m and n are the numbers of edges and vertices of the given ...

#### Determinantal identities for modular Schur symmetric functions

(University of Canterbury. Dept. of Mathematics, 1995)

Modular symmetric functions are a new class of symmetric functions which depend both on a partition ⋋ and an integer modulus
p > 2. For p prime, these functions have representation theoretic
significance as the irreducible ...

#### Rapid evaluation of least squares and minimum evolution criteria on phylogenetic trees

(University of Canterbury. Dept. of Mathematics, 1997)

We present fast new algorithms for evaluating trees with respect to least squares and minimum evolution (ME), the most commonly used criteria for
inferring phylogenetic trees from distance data. These include: an ...