3,5-cycle decompositions

For all odd integers n and all non-negative integers r and s satisfying 3r + 5s = n(n -1)/2 it is shown that the edge set of the complete graph on n vertices can be partitioned into r 3-cycles and s 5-cycles. For all even integers n and all non-negative integers r and s satisfying 3r + 5s = n(n-2)/2 it is shown that the edge set of the complete graph on n vertices with a 1-factor removed can be partitioned into r 3-cycles and s 5-cycles. (C) 1998 John Wiley & Sons, Inc.

Decompositions of complete multipartite graphs into cycles of even length

Necessary and sufficient conditions for the existence of an edge-disjoint decomposition of any complete multipartite graph into even length cycles are investigated. Necessary conditions are listed and sufficiency is shown for the cases when the cycle length is 4, 6 or 8. Further results concerning sufficiency, provided certain small decompositions exist, are also given for arbitrary even cycle lengths.

d-cube decompositions of K-n/K-m

Necessary conditions on n, m and d are given for the existence of an edge-disjoint decomposition of K-n\K-m into copies of the graph of a d-dimensional cube. Sufficiency is shown when d = 3 and, in some cases, when d = 2(t). We settle the problem of embedding 3-cube decompositions of K-m into 3-cube decompositions of K-n; where n greater than or equal to m.

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.

Further decompositions of complete tripartite graphs into 5-cycles

Let K(r,s,t) denote the complete tripartite graph with partite sets of sizes r, s and t, where r less than or equal to s less than or equal to t. Necessary and sufficient conditions are given for decomposability of K(r, s, t) into 5-cycles whenever r, s and t are all even. This extends work done by Mahmoodian and Mirza-khani (Decomposition of complete tripartite graphs into 5-cycles, in: Combinatorics Advances, Kluwer Academic Publishers, Netherlands, 1995, pp. 235-241) and Cavenagh and Billington. (C) 2002 Elsevier Science B.V. All rights reserved.

Decompositions of complete graphs into theta graphs with fewer than ten edges

A theta graph is a graph consisting of three pairwise internally disjoint paths with common end points. Methods for decomposing the complete graph K-nu into theta graphs with fewer than ten edges are given.

Bilateral semidirect product decompositions of transformation monoids

In this paper we consider the monoid OR(n) of all full transformations on a chain with n elements that preserve or reverse the orientation, as well as its submonoids OD(n) of all order-preserving or order-reversing elements, OP(n) of all orientation-preserving elements and O(n) of all order-preserving elements. By making use of some well known presentations, we show that each of these four monoids is a quotient of a bilateral semidirectproduct of two of its remarkable submonoids.

Max-convex decompositions for cooperative TU games

We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with non-negative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of modular games is a set of generators of the distributive lattice of all cooperative TU games. Finally, we characterize zero-monotonic games using a strong max-convex decomposition

Max-convex decompositions for cooperative TU games

We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with non-negative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of modular games is a set of generators of the distributive lattice of all cooperative TU games. Finally, we characterize zero-monotonic games using a strong max-convex decomposition

A study of thermal decompositions of an allylic hydroperoxide /|nby Thomas A. McCarrick. -- 260 St. Catharines [Ont.] : Dept. of Chemistry, Brock University,

The thermal decomposition of 2,3-di~ethy l - J-hydr operox y- 1 - butene , p r epared f rol") singl e t oxygen, has been studied i n three solvents over the tempe r a ture r ange from 1500e to l o00e and t!1e i 111 t ial ~oncentrfttl nn r Ange from O. 01 M to 0.2 M. Analys i s of the kine tic data ind ica te s i nduced homolysis as the n ost probRble mode of d e composition, g iving rise to a 3/2 f S order dependence upon hy d.roperoxide concent :r8.tl on . Experimental activation e nergies for the decomposition were f ound to be between 29.5 kcsl./raole and 30.0 k cal./mole .• \,iith log A factors between 11 . 3 and 12.3. Product studies were conducted in R variety of solvents a s well as in the pr esence of a variety of free r adical initiators . Investigation of the kinetic ch a in length indicated a chain length of about fifty. A degenerat i ve chain branching mechanism 1s proposed which predicts the multi t ude of products which Rre observed e xperimentally as well as giving activation energies and log A factors si~il a r to those found experimentally .

Dynamic Morse decompositions for semigroups of homeomorphisms and control systems

In this paper, we introduce the concept of dynamic Morse decomposition for an action of a semigroup of homeomorphisms. Conley has shown in [5, Sec. 7] that the concepts of Morse decomposition and dynamic Morse decompositions are equivalent for flows in metric spaces. Here, we show that a Morse decomposition for an action of a semigroup of homeomorphisms of a compact topological space is a dynamic Morse decomposition. We also define Morse decompositions and dynamic Morse decompositions for control systems on manifolds. Under certain condition, we show that the concept of dynamic Morse decomposition for control system is equivalent to the concept of Morse decomposition.

Critical evaluation of FBD, pq and CPT current decompositions for four-wire circuits

This paper investigates the major similarities and discrepancies of three important current decompositions proposed for the interpretation of unbalanced and/or non linear three-phase four-wire circuits. The considered approaches were the so-called FBD Theory, the pq-Theory and the CPT. Although the methods are based on different concepts, the results obtained under ideal conditions (sinusoidal and balanced signals) are very similar. The main differences appear in the presence of unbalanced and non linear load conditions. It will be demonstrated and discussed how the choice of the voltage referential and the return conductor impedance can influence in the resulting current components, as well as, the way of interpreting a power circuit with return conductor. Under linear unbalanced conditions, both FBD and pq-Theory suggest that the some current components contain a third-order harmonic. Besides, neither pq-Theory nor FBD method are able to provide accurate information for reactive current under unbalanced and distorted conditions, what seems to be done by means of the CPT. © 2009 IEEE.