Báo cáo toán học: "Mutually Disjoint Steiner Systems S(5, 8, 24) and 5-(24, 12, 48) Designs" docx

... [1] found 15 mutually disjoint Steiner systems S(5, 8, 24). Recently Jimbo and Shiromoto [4] have found 22 mutually disjoint Steiner systems S(5, 8, 24 ) and two disjoint 5-(24, 12, 48) designs. Our ... mutually disjoint Steiner systems S(5, 8, 2 4) and 5-(24, 12, 4 8) designs. Proposition 1. There are at least 50 mutually disjoint Steiner...

Ngày tải lên: 08/08/2014, 01:20

... 50 mutually disjoint Steiner systems S(5, 8, 24) and there are at least 35 mutually disjoint 5-(24, 12, 48) designs. The lat- ter result provides the existence of a simple 5-(24, 12, 6m) design ... (1938), 265–275. the electronic journal of combinatorics 17 (2010), #N1 6 Mutually Disjoint Steiner Systems S(5, 8, 24) and 5-(24, 12, 48) Designs Mako...

Ngày tải lên: 08/08/2014, 11:20

Ngày tải lên: 05/08/2014, 15:21

... the labeling and write (P, ). Definition 2.1. Let (P, ω) be a labeled poset and let  be the corresponding labeling of E(P ). We say that (P, ω)issign-graded,andthatP is -graded (and ω-graded) ... ω(y)inanypermutationinL(Q 1 ,ω), and ω(y) precedes ω(x)inanypermutationinL(Q 2 ,ω). Hence, the union is disjoint and unique. We need two operations on labeled posets: Let (P, )and( Q, µ...

Ngày tải lên: 07/08/2014, 08:22

... independent from the order that the Steiner triple systems are taken. Below is a lemma that states the relation between super -disjoint Steiner triple systems and meager systems of derived deleted symmetric ... Section 3 describes meager systems of order mn + 2 for many values of m and n. • Section 4 introduces super -disjoint Steiner triple systems and provides an exa...

Ngày tải lên: 07/08/2014, 13:21

... action (GMA) (Horn and Jackson 1972), S -systems (Savageau and Voit 1987), lin-log (Visser and Heijnen 2003), and convenience kinetics (Liebermeister and Klipp 2006), have compact standard formulations ... grants SFRH/BD/35215/2007 and SFRH/BD/25506/2005 from the Funda¸c˜ao para a Ciˆencia e a Tecnologia (FCT) and the MIT–Portugal Program through the project “Bridging Systems...

Ngày tải lên: 20/06/2014, 21:20

Ngày tải lên: 05/08/2014, 15:21

... 3]}, L 1 (7, 11, 12) = {[7, 8, 11], [7, 1, 12], [11, 7, 12]}, L 1 (8, 12, 2) = { [8, 9, 12], [8, 0, 2], [12, 8, 2]}, L 1 (12, 3, 6) = { [12, 0, 3], [12, 4, 6], [3, 12, 6]}, L 1 (10, 1, 2) = {[10, ... analogous problem for 3-cycle systems (or Steiner triple systems) is also very hard. This problem has been considered and partially solved by Colbourn, Dinitz and Rosa [...

Ngày tải lên: 07/08/2014, 06:22

... partial permutation if and only if D C (θ) = D C (κ). Proof. If θ and κ are related by a partial permutation, then the application of D C removes any and all ones from θ and κ and puts an initial ... new material. Griggs and Ho [9] show that λ |= n is cyclic under D C if and only if the parts are in decreasing order and λ is cyclic under D P . Hence, the cycle structure and...

Ngày tải lên: 07/08/2014, 13:21

... Orthogonality and partial order in Γ 7 . More generally, one can compare α ∈ ∆ + s and β ∈ ∆ + t by considering ˜α and ˜ β. Theorem 3.4.4. Suppose α ∈ ∆ + s and β ∈ ∆ + t , and s ≤ t. Then α < β if and ... coordinates of x are non-zero, say x i and x i  , and exactly two coordinates of y are non-zero, say y j and y j  . If {i, i  } ∩ {j, j  } = ∅ then (x|y) = 0 and...

Ngày tải lên: 07/08/2014, 21:20