We present a procedure for amalgamating a net and a collection of designs into a single design. At first this amalgam is just point-regular, but it acquires additional regularities upon imposing restrictions on the ingredients. At its most regular, the amalgam is quasi-symmetric, and designs with the same parameters as those recently constructed by Bracken, McGuire and Ward appear. Along the way we discuss a class of designs generalising Hadamard designs, and we consider the problem of packing projective planes with disjoint line sets into the same point set
AbstractIt is shown that for each λ ⩾ 3, there are only finitely many quasi-residual quasi-symmetric...
AbstractThe first infinite families of symmetric designs were obtained from finite projective geomet...
The coding-theoretical interest in combinatorial designs defined by subspaces of a finite geometry w...
P. McDonough, V. C. Mavron and H. N. Ward We present a procedure for amalgamating a net and a collec...
AbstractIn this article we show that projective planes with a small collineation group of perspectiv...
Combinatorial design theory is a source of simply stated, concrete, yet difficult discrete problems,...
A non-empty subset of points of a symmetric 2 - (v, k, λ) design is a λ-arc if it meets every block ...
A line of a design is the intersection of all the blocks on two points. There is an upper bound on t...
AbstractA line of a design is the intersection of all the blocks on two points. There is an upper bo...
AbstractAll Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10 are constru...
AbstractThe notion of “oval” arose in the study of finite projective planes. We extend the notion to...
We provide a characterization of the classical geometric designs formed by the points and lines of t...
AbstractRahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a con...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
AbstractLower bouds on the number of non-isomorphic embeddings of a symmetric net into affine design...
AbstractIt is shown that for each λ ⩾ 3, there are only finitely many quasi-residual quasi-symmetric...
AbstractThe first infinite families of symmetric designs were obtained from finite projective geomet...
The coding-theoretical interest in combinatorial designs defined by subspaces of a finite geometry w...
P. McDonough, V. C. Mavron and H. N. Ward We present a procedure for amalgamating a net and a collec...
AbstractIn this article we show that projective planes with a small collineation group of perspectiv...
Combinatorial design theory is a source of simply stated, concrete, yet difficult discrete problems,...
A non-empty subset of points of a symmetric 2 - (v, k, λ) design is a λ-arc if it meets every block ...
A line of a design is the intersection of all the blocks on two points. There is an upper bound on t...
AbstractA line of a design is the intersection of all the blocks on two points. There is an upper bo...
AbstractAll Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10 are constru...
AbstractThe notion of “oval” arose in the study of finite projective planes. We extend the notion to...
We provide a characterization of the classical geometric designs formed by the points and lines of t...
AbstractRahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a con...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
AbstractLower bouds on the number of non-isomorphic embeddings of a symmetric net into affine design...
AbstractIt is shown that for each λ ⩾ 3, there are only finitely many quasi-residual quasi-symmetric...
AbstractThe first infinite families of symmetric designs were obtained from finite projective geomet...
The coding-theoretical interest in combinatorial designs defined by subspaces of a finite geometry w...