AbstractIt is well known that for a prime power s and a positive integer m, the set of d-flats in AG(m,s) forms a 2-design. In this article, it is shown that the 2-design formed by the 2-flats in AG(m,3) for even m can be decomposed into more subdesigns than a previously known decomposition. Exact calculation of the number of the resulting subdesigns is also demonstrated by examining the distribution of points in cyclotomic cosets
AbstractWe develop some powerful techniques by which (certain classes of) combinatorial designs with...
Let k, m, n, λ, and μ be positive integers. A decomposition of math formula into edge-disjoint subgr...
AbstractWe consider the construction of several configurations, including: •overlarge sets of 2-(11,...
AbstractIt is well known that for a prime power s and a positive integer m, the set of d-flats in AG...
AbstractWe give a construction of a 2-(mn2+1,mn,(n+1)(mn−1)) design starting from a Steiner system S...
AbstractDenote by Mv the set of integers b for which there exists a 2-design (linear space) with v p...
A design is additive under an abelian group $G$ (briefly, $G$-additive) if, up to isomorphism, its p...
Abstract(Ω, D) is called a t-(ν, k, λ) design provided ∥Ω∥ = ν and D is a family of k-subsets of Ω s...
AbstractA CB(v,k,λ) means a cyclic 2-design of block size k coincidence number λ, and with v points....
A 2-(v,k,λ) block design (P,B) is additive if, up to isomorphism, P can be represented as a subset o...
AbstractRahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a con...
AbstractWe present an orderly algorithm for classifying triple systems. Subsequently, we show that t...
AbstractIn a recent paper, two of the authors used polarities in PG(2d−1,p) (p⩾2 prime, d⩾2) to cons...
AbstractResolvable designs, especially those that are multiply resolvable, have been of interest for...
AbstractThis paper defines a class of designs which generalise t-designs, resolvable designs, and or...
AbstractWe develop some powerful techniques by which (certain classes of) combinatorial designs with...
Let k, m, n, λ, and μ be positive integers. A decomposition of math formula into edge-disjoint subgr...
AbstractWe consider the construction of several configurations, including: •overlarge sets of 2-(11,...
AbstractIt is well known that for a prime power s and a positive integer m, the set of d-flats in AG...
AbstractWe give a construction of a 2-(mn2+1,mn,(n+1)(mn−1)) design starting from a Steiner system S...
AbstractDenote by Mv the set of integers b for which there exists a 2-design (linear space) with v p...
A design is additive under an abelian group $G$ (briefly, $G$-additive) if, up to isomorphism, its p...
Abstract(Ω, D) is called a t-(ν, k, λ) design provided ∥Ω∥ = ν and D is a family of k-subsets of Ω s...
AbstractA CB(v,k,λ) means a cyclic 2-design of block size k coincidence number λ, and with v points....
A 2-(v,k,λ) block design (P,B) is additive if, up to isomorphism, P can be represented as a subset o...
AbstractRahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a con...
AbstractWe present an orderly algorithm for classifying triple systems. Subsequently, we show that t...
AbstractIn a recent paper, two of the authors used polarities in PG(2d−1,p) (p⩾2 prime, d⩾2) to cons...
AbstractResolvable designs, especially those that are multiply resolvable, have been of interest for...
AbstractThis paper defines a class of designs which generalise t-designs, resolvable designs, and or...
AbstractWe develop some powerful techniques by which (certain classes of) combinatorial designs with...
Let k, m, n, λ, and μ be positive integers. A decomposition of math formula into edge-disjoint subgr...
AbstractWe consider the construction of several configurations, including: •overlarge sets of 2-(11,...