Sufficient conditions for STS(3k) of 3-rank ≤ 3k-r to be resolvable

Abstract

Based on the structure of non-full-3-rank STS(3k) and the orthogonal Latin squares, we mainly give sufficient conditions for STS(3k) of 3-rank ≤ 3k-r to be resolvable in the present paper. Under the conditions, the block set of STS(3k) can be partitioned into 3k-12 parallel classes, i.e., 3k-12 1-(v,3,1) designs. Finally, we prove that STS(3k) of 3-rank ≤ 3k-r is resolvable under the sufficient conditions.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…