AbstractA theory of certain types of translations for generalised nets is developed, and the structure of nets constructed by a special method is analysed, especially with regard to subsets and extensions. This enables nonisomorphism results to be established, along with theorems that the number of nonisomorphic solutions of a certain type (for example, complete or maximal) tends to infinity with k
P. McDonough, V. C. Mavron and H. N. Ward We present a procedure for amalgamating a net and a collec...
AbstractThe celebrated net-embedding theorem of R.H. Bruck asserts that a net with a large number of...
AbstractA line of a design is the intersection of all the blocks on two points. There is an upper bo...
AbstractA theory of certain types of translations for generalised nets is developed, and the structu...
AbstractCertain translation nets are shown to be equivalent to sets of mutually orthogonal Latin squ...
The designs considered are such that the design and its dual are symmetric affine resolvable, with u...
AbstractPartial t-spreads and translation nets of small deficiency are considered (meaning s > (d−1)...
Symmetric nets are affine resolvable designs whose duals are also affine. It is shown that. up to is...
In this survey, we will discuss the existence problem for translation nets, the question of when a t...
AbstractIn this paper, we are concerned with three topics in finite geometry which have generated mu...
Certain translation nets are shown to be equivalent to sets of mutually orthogonal Latin squares con...
The so-called synthesis problem for nets which consists in deciding whether a given automaton is iso...
We present a procedure for amalgamating a net and a collection of designs into a single design. At f...
The so-called synthesis problem for nets, which consists in deciding whether a given graph is isomor...
A graph in said to be a general (g,h) not if and only if (1) it has girth g and (2) it contains a co...
P. McDonough, V. C. Mavron and H. N. Ward We present a procedure for amalgamating a net and a collec...
AbstractThe celebrated net-embedding theorem of R.H. Bruck asserts that a net with a large number of...
AbstractA line of a design is the intersection of all the blocks on two points. There is an upper bo...
AbstractA theory of certain types of translations for generalised nets is developed, and the structu...
AbstractCertain translation nets are shown to be equivalent to sets of mutually orthogonal Latin squ...
The designs considered are such that the design and its dual are symmetric affine resolvable, with u...
AbstractPartial t-spreads and translation nets of small deficiency are considered (meaning s > (d−1)...
Symmetric nets are affine resolvable designs whose duals are also affine. It is shown that. up to is...
In this survey, we will discuss the existence problem for translation nets, the question of when a t...
AbstractIn this paper, we are concerned with three topics in finite geometry which have generated mu...
Certain translation nets are shown to be equivalent to sets of mutually orthogonal Latin squares con...
The so-called synthesis problem for nets which consists in deciding whether a given automaton is iso...
We present a procedure for amalgamating a net and a collection of designs into a single design. At f...
The so-called synthesis problem for nets, which consists in deciding whether a given graph is isomor...
A graph in said to be a general (g,h) not if and only if (1) it has girth g and (2) it contains a co...
P. McDonough, V. C. Mavron and H. N. Ward We present a procedure for amalgamating a net and a collec...
AbstractThe celebrated net-embedding theorem of R.H. Bruck asserts that a net with a large number of...
AbstractA line of a design is the intersection of all the blocks on two points. There is an upper bo...