Constructing a class of designs with proportional balance

Text serves as a sequel to 'Computational and Constructive Design Theory,' c1996; containing research papers and surveys of recent research work on design construction and computer-aided study of designs. For researchers in theory of computational designs.

Time series evaluation of traumatic lesions and airsacculitis at one poultry abattoir in the state of Sao Paulo, Brazil (1996-2005)

Ten year official condemnation records of one officially inspected poultry abattoir in state of Sao Paulo. Brazil, were analyzed. Seasonal and cyclical trends were analyzed in relation to traumatic lesions and airsacculitis. which were the most relevant official condemnation causes Time series analysis of the records, seasonal indexes and moving averages was used to describe the adherence to the mathematical model and to offer preventive management strategies for the slaughter house industry Although cause-effect relationships were not defined, some insight was given into the causal mechanisms that generated the series (C) 2010 Elsevier B V All rights reserved

The mu-way intersection problem for m-cycle systems

An m-cycle system of order upsilon is a partition of the edge-set of a complete graph of order upsilon into m-cycles. The mu -way intersection problem for m-cycle systems involves taking mu systems, based on the same vertex set, and determining the possible number of cycles which can be common to all mu systems. General results for arbitrary m are obtained, and detailed intersection values for (mu, m) = (3, 4), (4, 5),(4, 6), (4, 7), (8, 8), (8, 9). (For the case (mu, m)= (2, m), see Billington (J. Combin. Des. 1 (1993) 435); for the case (Cc,m)=(3,3), see Milici and Quattrochi (Ars Combin. A 24 (1987) 175. (C) 2001 Elsevier Science B.V. All rights reserved.

The metamorphosis of lambda-fold 4-wheel systems into lambda-fold 4-cycle systems

A 4-wheel is a simple graph on 5 vertices with 8 edges, formed by taking a 4-cycle and joining a fifth vertex (the centre of the 4-wheel) to each of the other four vertices. A lambda -fold 4-wheel system of order n is an edge-disjoint decomposition of the complete multigraph lambdaK(n) into 4-wheels. Here, with five isolated possible exceptions when lambda = 2, we give necessary and sufficient conditions for a lambda -fold 4-wheel system of order n to be transformed into a lambda -fold Ccyde system of order n by removing the centre vertex from each 4-wheel, and its four adjacent edges (retaining the 4-cycle wheel rim), and reassembling these edges adjacent to wheel centres into 4-cycles.

Star decompositions of cubes

Let Sk denote the complete bipartite graph K-1k and let e,, denote the ii-cube. We prove that the obvious necessary conditions for the existence of an S-k-decomposition of Q(n) are sufficient.

A new integrable model of strongly correlated electrons with Hubbard-like interaction

A new completely integrable model of strongly correlated electrons is proposed which describes two competitive interactions: one is the correlated one-particle hopping, the other is the Hubbard-like interaction. The integrability follows from the fact that the Hamiltonian is derivable from a one-parameter family of commuting transfer matrices. The Bethe ansatz equations are derived by algebraic Bethe ansatz method.

On single laws for varieties of quasigroups associated with extended cycle systems

It has been previously shown by Lindner and Rodger that quasigroups associated with 2-perfect extended m-cycle systems can be equationally defined if and only if m is an element of {3, 5, 7}. In this paper we present a single identity for each such m which is equivalent to the identities given for these varieties.

On the direct product of two weak uniquely completable partial latin squares

In this note we show by counter-example that the direct product of two weak uniquely completable partial latin squares is not necessarily a uniquely completable partial latin square. This counter-example rejects a conjecture by Gower (see [3]) on the direct product of two uniquely completable partial latin squares.

Star factorizations of graph products

A k-star is the graph K-1,K-k. We prove a general theorem about k-star factorizations of Cayley graphs. This is used to give necessary and sufficient conditions for the existence of k-star factorizations of any power (K-q)(S) of a complete graph with prime power order q, products C-r1 x C-r2 x ... x C-rk of k cycles of arbitrary lengths, and any power (C-r)(S) of a cycle of arbitrary length. (C) 2001 John Wiley & Sons, Inc.

On the Oberwolfach problem with two similar length cycles

For all in greater than or equal to 3, the Oberwolfach problem is solved for the case where the 2-factors consist of two cycles of lengths in and m + 1, and for the case where the 2-factors consist of two cycles of lengths m and m + 2.