Compatible Factorizations and Three-fold Triple Systems
نویسندگان
چکیده
A three-fold triple system is a design wherein each pair of treatments occurs exactly once. One way to construct this design is by using an idempotent commutative quasigroup. This paper attempts to provide another method of constructing a 3-fold triple system. Firstly, we would like to discuss compatible factorization without multiple edges using a patterned starter construction. Then, we will use this construction to enumerate a distinct 3-fold triple system for every odd order v > 3. 2000 Mathematics Subject Classification: 05B05, 68R05, 68R10
منابع مشابه
One-Factorizations of Regular Graphs of Order 12
Algorithms for classifying one-factorizations of regular graphs are studied. The smallest open case is currently graphs of order 12; one-factorizations of r-regular graphs of order 12 are here classified for r ≤ 6 and r = 10, 11. Two different approaches are used for regular graphs of small degree; these proceed one-factor by one-factor and vertex by vertex, respectively. For degree r = 11, we ...
متن کاملTriple factorization of non-abelian groups by two maximal subgroups
The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...
متن کاملCyclic, Simple and Indecomposable Three-Fold Triple Systems
In 2000, Rees and Shalaby constructed simple indecomposable two-fold cyclic triplesystems for all v ≡ 0, 1, 3, 4, 7, and 9 (mod 12) where v = 4 or v ≥ 12, using Skolem-type sequences.We construct, using Skolem-type sequences, three-fold triple systems having theproperties of being cyclic, simple, and indecomposable for all admissible orders v, withsome possible exception...
متن کاملVarious One-Factorizations of Complete Graphs
Methods to compute 1–factorizations of a complete graphs of even order are presented. For complete graphs where the number of vertices is a power of 2, we propose several new methods to construct 1–factorizations. Our methods are different from methods that make use of algebraic concepts such as Steiner triple systems, starters and all other existing methods. We also show that certain complete ...
متن کاملILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کامل