Ars Combinatoria, Volume 26Department of Combinatorics and Optimization, University of Waterloo., 1988 - Combinatorial analysis |
From inside the book
Results 1-3 of 52
Page 53
... partition A. Taking six or seven designs from one class ensures partition A again , so we consider the case where we take five designs from each class . Since designs from different classes have three common blocks or none , the ten ...
... partition A. Taking six or seven designs from one class ensures partition A again , so we consider the case where we take five designs from each class . Since designs from different classes have three common blocks or none , the ten ...
Page 56
... partition . For example designs 1 , 16 , 25 of class I and designs 6 , 14 , 30 of class II all contain the triple 246 ; trading these designs leads to partition B. Additional trades may be carried out in two inequivalent ways . Designs ...
... partition . For example designs 1 , 16 , 25 of class I and designs 6 , 14 , 30 of class II all contain the triple 246 ; trading these designs leads to partition B. Additional trades may be carried out in two inequivalent ways . Designs ...
Page 146
... partition into eight sets of eight blocks mutually intersecting in three elements . The partition given in Table 11 could have been so derived . Again , see Diagram 1 for further clarification . Any of the 30 Fano planes on { T ) can be ...
... partition into eight sets of eight blocks mutually intersecting in three elements . The partition given in Table 11 could have been so derived . Again , see Diagram 1 for further clarification . Any of the 30 Fano planes on { T ) can be ...
Contents
Aldred R E Dept of Mathematics University of Otago P O Box 56 Dunedin | 6 |
Deng ChaiLing Dept of Mathematics University of Malaya 59100 Kuala Lumpur | 65 |
Donovan Diane Mathematics Department University of Queensland St Lucia 4067 | 90 |
Copyright | |
1 other sections not shown
Other editions - View all
Common terms and phrases
1-spread 3-connected cubic graph adjacent apply Lemma automorphism balanced ternary BIBD binomial binomial coefficients bipartite blocks Boolean function CBTD codewords Combinatorial conjugate invariant subgroup construction Corollary coset cubic graph cycle in G cyclic define denote disjoint e₁ edge edge-maximal elements entries example exists Fano plane finite field fully-dependent flat gap sequence triple GBRD given Gxyz Hadamard matrices Hence induced integer irreflexive isomorphic Jennifer Seberry Latin squares Lemma Let G Math Mathematics matroid minimal covers modular cut modulus near-polygonal graph obtain one-point extension one-point lift orthogonal PA(n pair parameters partition perfect codes periodic gap sequence permutation perpendicular array polynomials prime implicants Proof quadruples quasigroup regulus of rank result s-dimensional Seberry Segre variety Steiner triple system subgraph subset subspace Suppose symmetric Table Theorem transitive vertex sequence vertices zero-hole