AbstractA line of a design is the intersection of all the blocks on two points. There is an upper bound on the number of points in a line of a design. A line of a design which meets this upper bound is said to be of maximal length. Restrictions are obtained on the parameters of a symmetric 2-design in order that it might possess a set of lines of maximal length which partitions the point set of the design (that is, a ‘1-spread’). It is shown that the existence of an affine resolvable design with four blocks in each affine resolution class is equivalent to the existence of a Hadamard design possessing a 1-spread. Two recursive constructions for affine resolvable designs with four blocks in each affine resolution class are also given
AbstractWe provide a characterization of the classical point-line designs PG1(n,q), where n⩾3, among...
AbstractAll Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10 are constru...
Lower bouds on the number of non-isomorphic embeddings of a symmetric net into affine designs with c...
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...
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...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
AbstractRahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a con...
AbstractIt is known that the designs PGn-1(n,q) in some cases have spreads of maximal α-arcs. Here a...
A bound on the 2-rank of an affine designs obtained from a Hadamard design with a line spread via Ra...
The designs considered are such that the design and its dual are symmetric affine resolvable, with u...
AbstractLower bouds on the number of non-isomorphic embeddings of a symmetric net into affine design...
The designs considered are such that the design and its dual are symmetric affine resolvable, with u...
AbstractWe provide a characterization of the classical point-line designs PG1(n,q), where n⩾3, among...
AbstractAll Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10 are constru...
Lower bouds on the number of non-isomorphic embeddings of a symmetric net into affine designs with c...
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...
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...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a constructio...
AbstractRahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a con...
AbstractIt is known that the designs PGn-1(n,q) in some cases have spreads of maximal α-arcs. Here a...
A bound on the 2-rank of an affine designs obtained from a Hadamard design with a line spread via Ra...
The designs considered are such that the design and its dual are symmetric affine resolvable, with u...
AbstractLower bouds on the number of non-isomorphic embeddings of a symmetric net into affine design...
The designs considered are such that the design and its dual are symmetric affine resolvable, with u...
AbstractWe provide a characterization of the classical point-line designs PG1(n,q), where n⩾3, among...
AbstractAll Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10 are constru...
Lower bouds on the number of non-isomorphic embeddings of a symmetric net into affine designs with c...