Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 38 for “"triple systems"”.
-
Bicyclic Mixed Triple Systems.
In the study of triple systems, one question faced is that of finding for what order a decomposition exists. We state and prove a necessary and sufficient condition for the existence of a bicyclic mixed triple system based on the three possible partial orientations of the 3-cycle with twice as many …
-
Steiner triple systems and cycle structure
… his first paper [24], research in Steiner triple systems has grown steadily. With increased and ready access to more powerfiul computers in recent times, this growth has accelerated significantly. Problems are now being solved which were previously considered too 'big' to contemplate using …
-
Anti-pasch and pasch steiner triple systems
… on the study of anti-Pasch and Pasch Steiner triple systems and existence results / concerning these. After the introductory Chapter, Chapters 2, 3, 4, 5 treat anti-Pasch systems and the last the reverse problem of Pasch systems. Chapter 1 introduces the basic concepts and definitions …
-
The Last of the Mixed Triple Systems.
In this thesis, we consider the decomposition of the complete mixed graph on v vertices denoted Mv, into every possible mixed graph on three vertices which has (like Mv) twice as many arcs as edges. Direct constructions are given in most cases. Decompositions of theλ-fold complete mixed graph λMv, …
-
Tricyclic Steiner Triple Systems with 1-Rotational Subsystems.
A Steiner triple system of order v, denoted STS(v), is said to be tricyclic if it admits an automorphism whose disjoint cyclic decomposition consists of three cycles. In this thesis we give necessary and sufficient conditions for the existence of a tricyclic STS(v) when one of the cycles is of …
-
Outline and nearly outline triple systems of even index
… when lambda is even. Such designs are known as triple systems. Given a finite collection of n elements, a triple system of order n and index lambda is a collection of subsets of size three chosen from the given set with the property that each distinct pair of elements from the set occurs in …
-
UNIFORM THREE-CLASS REGULAR PARTIAL STEINER TRIPLE SYSTEMS WITH UNIFORM DEGREES
A Partial Steiner Triple system (X, T) is a finite set of points C and a collection T of 3-element subsets of C that every pair of points intersect in at most 1 triple. A 3-class regular PSTS (3-PSTS) is a PSTS where the points can be partitioned into 3 classes (each class having size m, n and p …
-
Secular Evolution of Compact Triple Systems: The Interplay of Kozai Resonances, Tidal Friction, Gravitational Wave Radiation and Mass Transfer
… via numerical simulations, the dynamics of such triple systems we develop a model that considers three body dynamics in the presence of additional effects such as tidal friction, mass transfer and gravitational wave radiation. First we consider the dynamical state of 4U 1820-30, which is an UCXB …
-
Combinatorial Designs With Prescribed Automorphism Types
… the following: 1) 3- and 4-rotational Steiner triple systems,</p> <p>2) 3-regular Steiner triple systems,</p> <p>3) Steiner triple systems with an involution fixing precisely three elements,</p> <p>4) 1-rotational triple systems,</p> <p>5) cyclic extended triple systems,</p> <p>6) 1-, 2- and …
-
Combinatorial Embeddings and Representations
… designs include Steiner, twofold and Mendelsohn triple systems, as well as Latin squares. We look at construction methods, structural properties and other problems concerning these cases. In addition, we look at graph representations by Steiner triple systems and by combinatorial embeddings. This …
-
Combinatorial designs and their automorphism groups
… concerns the automorphism groups of Steiner triple systems and of cycle systems. Although most Steiner triple systems have trivial automorphism groups [2], it is widely known that for every abstract group, there exists a Steiner triple system whose automorphism is isomorphic to that group …
-
Configurations and colouring problems in block designs
A Steiner triple system of order v (STS(<i>v</i>)) is called <i>x-chromatic</i> if <i>x</i> is the smallest number of colours needed to avoid monochromatic blocks. Amongst our results on colour class structures we show that every STS (19) is 3- or 4-chromatic, that every 3-chromatic STS(19) has an …
-
Automorphisms of simple anti-Jordan pairs
… classify finite dimensional simple anti-Jordan triple systems over an algebraically closed field of characteristic zero.
-
List colouring hypergraphs and extremal results for acyclic graphs
… solving the list-colouring problem for Steiner triple systems (STS). It is not hard using either method to determine that Steiner triple systems of orders 7, 9 and 13 are 3-list-chromatic. For systems of order 15, we show that they are 4-list-colourable, but they are also ``almost'' …
-
Gravitational waves in Einstein-aether theory.
We study gravitational waves produced by N-body systems in Einstein-aether theory. In particular, we calculate the gravitational waveforms, polarizations, response functions of the detectors and the radiation power by using the post-Newtonian approximations to the lowest order. Applying the general …
-
Decomposing the blocks of a Steiner triple system of order 4v-3 into partial parallel classes of size v-1
… parallel classes of uniform size of Steiner triple systems, STS(v). We show several results for STS(4v - 3), where v = 3 mod 12 and v = 9 mod 12. In Chapter 1 we provide background knowledge and introduce the problem. In Chapter 2 we discuss some important known results to the problem, …
-
Group Embeddings of (n,k) Configurations
… of as extensions of configurations to Mendelsohn Triple Systems (see [8], [10]). In fact, configurations naturally give rise to partial quasigroups and adding the “missing triples” including the so-called "tangential relations" are the essential ideas behind the Mendelsohn triple Systems [8].
-
Algorithms for classification of combinatorial objects
… this thesis is a classification of the Steiner triple systems of order 19. The other results obtained include the nonexistence of a resolvable 2-(15, 5, 4) design, a classification of the one-factorizations of k-regular graphs of order 12 for k ≤ 6 and k = 10, 11, a classification of the …
Page 1 of 2