A general group theoretic approach is used to find resolvable designs. Infinitely many resolvable 3-designs are obtained where each is block transitive und.

Dec 3, 2019 · Definition 1.1.A t- -design is said to be s-resolvable, or to have an s-resolution, with , if its block set can be partitioned into classes such ...

A remarkable property of the method is that it enables the construction of 2-resolvable t-designs with a large variety of block sizes. For t = 4, it is required ...

Jun 27, 2024 · The purpose of the present paper is to introduce recursive methods for constructing simple t-designs, s-resolvable t-designs, and large sets ...

The purpose of the present paper is to introduce recursive methods for constructing simple t-designs, s-resolvable t-designs, and large sets of t-designs.

Oct 22, 2024 · Through super-simple resolvable t-designs, under the discrete discrepancy, a new method is proposed for constructing uniform designs U n(q m), ...

Abstract. An extending theorem for s-resolvable t-designs is presented, which may be viewed as an extension of Qiu-rong Wu's result.

In this study t-design is constructed by relating known BIB designs, combinatorial designs and algebraic structures with t-designs. Additionally, an alternative ...

The nonextendability and extendability of both a t-(v, k, λt) design (with k ⩽ v 2 and its complementary t-design are discussed in four cases: (A) a ...

Jul 1, 2022 · The paper introduces a method for constructing 2-resolvable t-designs for t = 3 , 4 . The main idea is based on the assumption that there ...