Large sets of large sets of Steiner triple systems of order 9

We describe a direct method of partitioning the 840 Steiner triple systems of order 9 into 120 large sets. The method produces partitions in which all of the large sets are isomorphic and we apply the method to each of the two non-isomorphic large sets of STS(9).

Induction in the timed interval calculus

The Timed Interval Calculus, a timed-trace formalism based on set theory, is introduced. It is extended with an induction law and a unit for concatenation, which facilitates the proof of properties over trace histories. The effectiveness of the extended Timed Interval Calculus is demonstrated via a benchmark case study, the mine pump. Specifically, a safety property relating to the operation of a mine shaft is proved, based on an implementation of the mine pump and assumptions about the environment of the mine. (C) 2002 Elsevier Science B.V. All rights reserved.

Decompositions of complete tripartite graphs into triangles with an edge attached

Let K(r, s, t) denote the complete tripartite graph with partite sets of size r, s and t, where r less than or equal to s less than or equal to t. Let D be the graph consisting of a triangle with an edge attached. We show that K(r, s, t) may be decomposed into copies of D if and only if 4 divides rs + st + rt and t less than or equal to 3rs/(r + s).

Balanced critical sets in Latin squares

In this note we first introduce balanced critical sets and near balanced critical sets in Latin squares. Then we prove that there exist balanced critical sets in the back circulant Latin squares of order 3n for n even. Using this result we decompose the back circulant Latin squares of order 3n, n even, into three isotopic and disjoint balanced critical sets each of size 3n. We also find near balanced critical sets in the back circulant Latin squares of order 3n for n odd. Finally, we examine representatives of each main class of Latin squares of order up to six in order to determine which main classes contain balanced or near balanced critical sets.

A census of critical sets in the Latin squares of order at most six

A critical set in a Latin square of order n is a set of entries from the square which can be embedded in precisely one Latin square of order n, Such that if any element of the critical set. is deleted, the remaining set can be embedded, in more than one Latin square of order n.. In this paper we find all the critical sets of different sizes in the Latin squares of order at most six. We count the number of main and isotopy classes of these critical sets and classify critical sets from the main classes into various strengths. Some observations are made about the relationship between the numbers of classes, particularly in the 6 x 6 case. Finally some examples are given of each type of critical set.

Data-driven fuzzy analysis in quantitative mineral resource assessment

The integration of geo-information from multiple sources and of diverse nature in developing mineral favourability indexes (MFIs) is a well-known problem in mineral exploration and mineral resource assessment. Fuzzy set theory provides a convenient framework to combine and analyse qualitative and quantitative data independently of their source or characteristics. A novel, data-driven formulation for calculating MFIs based on fuzzy analysis is developed in this paper. Different geo-variables are considered fuzzy sets and their appropriate membership functions are defined and modelled. A new weighted average-type aggregation operator is then introduced to generate a new fuzzy set representing mineral favourability. The membership grades of the new fuzzy set are considered as the MFI. The weights for the aggregation operation combine the individual membership functions of the geo-variables, and are derived using information from training areas and L, regression. The technique is demonstrated in a case study of skarn tin deposits and is used to integrate geological, geochemical and magnetic data. The study area covers a total of 22.5 km(2) and is divided into 349 cells, which include nine control cells. Nine geo-variables are considered in this study. Depending on the nature of the various geo-variables, four different types of membership functions are used to model the fuzzy membership of the geo-variables involved. (C) 2002 Elsevier Science Ltd. All rights reserved.

Common multiples of complete graphs and a 4-cycle

A graph G is a common multiple of two graphs H-1 and H-2 if there exists a decomposition of G into edge-disjoint copies of H-1 and also a decomposition of G into edge-disjoint copies of H-2. In this paper, we consider the case where H-1 is the 4-cycle C-4 and H-2 is the complete graph with n vertices K-n. We determine, for all positive integers n, the set of integers q for which there exists a common multiple of C-4 and K-n having precisely q edges. (C) 2003 Elsevier B.V. All rights reserved.

Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K-n, is a 3-factorization of & in which the components of each factor are cubes. We show that there exists a cube factorization of & if and only if n equivalent to 16 (mod 24), thus providing a new family of uniform 3 -factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. (C) 2004 Wiley Periodicals, Inc.

On the forced matching numbers of bipartite graphs

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M, such that S is contained in no other perfect matching of G. This notion has arisen in the study of finding resonance structures of a given molecule in chemistry. Similar concepts have been studied for block designs and graph colorings under the name defining set, and for Latin squares under the name critical set. There is some study of forcing sets of hexagonal systems in the context of chemistry, but only a few other classes of graphs have been considered. For the hypercubes Q(n), it turns out to be a very interesting notion which includes many challenging problems. In this paper we study the computational complexity of finding the forcing number of graphs, and we give some results on the possible values of forcing number for different matchings of the hypercube Q(n). Also we show an application to critical sets in back circulant Latin rectangles. (C) 2003 Elsevier B.V. All rights reserved.