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 46 for “"combinatorial designs"”.
-
Some Constructions of Combinatorial Designs
In this thesis, we are concerned with some combinatorial designs ---1- rotational (v, 4, 1) designs, referee squares, triple whist tournaments and Room squares. Many of our constructions are Z-cyclic. Chapter 2 is devoted to 1-rotational (v, 4, 1). In Chapter 3, a method of constructing Z-cyclic …
-
Some constructions of combinatorial designs
The objects of study of this thesis are combinatorial designs. Chapters 2 and 3 deal with various refinements of whist tournament, while Chapters 3 and 4 focus on terraces. Chapter 2 is devoted to the investigation of Z-cyclic ordered triplewhist tournaments on p elements, where p = 5 (mod 8); …
-
Combinatorial designs and their automorphism groups
This thesis 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 …
-
Combinatorial Designs With Prescribed Automorphism Types
<p>In this thesis we deal with the following question: given a permutation α on a set V, does there exist a certain block design on V admitting α as an automorphism?</p> <p>We are able to give a (complete or partial) answer to this question for the following: 1) 3- and 4-rotational Steiner triple …
-
A new polyhedral approach to combinatorial designs
We consider combinatorial t-design problems as discrete optimization problems. Our motivation is that only a few studies have been done on the use of exact optimization techniques in designs, and that classical methods in design theory have still left many open existence questions. Roughly defined, …
-
A recursive construction for some combinatorial designs
… quasi-residual balanced incomplete block designs (BIBDs). The construction leads to incidence matrices related to the designs with classical parameters. Further, by a similar method and application of Paley matrices the class of balanced weighing matrices with classical parameters are …
-
Applications of Graph Theory and Topology to Combinatorial Designs
… with the existence and the isomorphism of designs. The first part studies the existence of designs. Chapter I shows how to obtain a design from a difference family. Chapters II to IV study the existence of an affine 3-(p^m,4,λ) design where the v-set is the Galois field GF(p^m). Associated …
-
Branch-and-cut for symmetrical ILPs and combinatorial designs
Many combinatorial problems can be formulated as a 0-1 integer linear program (0-1 ILP), which consists of an objective function subject to linear constraints over 0-1 variables. A method called branch-and-cut has been successfully used to attack ILPs, but ILPs are still difficult to solve in …
-
Combinatorial Designs For Key Distribution And Secure Re-Keying In Group Communication Systems
Combinatorial t-designs are a class of highly regular set systems subject to interesting incidence conditions. These objects have been found to be very useful in applications ranging from tournament scheduling to traffic routing in communication networks. In the work presented here, we use a …
-
ALGEBRAIC METHODS IN THE THEORY OF COMBINATORIAL DESIGNS (INEQUALITIES, GROUP THEORY, T-WISE BALANCED)
… are allowed to have more than one size. Such designs have a connection with error-correcting codes. The central theme of this chapter is the classification of all transitive homogeneous S(1;3,{4,6},20) designs and answers a question posed by Ed Assmus.
-
The relationship between (16,6,3)-balanced incomplete block designs and (25,12) self-orthogonal codes
Balanced Incomplete Block Designs and Binary Linear Codes are two combinatorial designs. Due to the vast application of codes in communication the field of coding theory progressed more rapidly than many other fields of combinatorial designs. On the other hand, Block Designs are applicable in …
-
Συνδυαστική θεωρία σχεδιασμών, κωδίκων και κρυπτογραφίας
My Ph.D. Thesis involves the study of combinatorial constructions for several classes of combinatorial designs and the development of relevant algorithms that are applicable to the fields of Coding Theory and Cryptography. In the first part of the Thesis, entitled ``Combinatorial Design Theory'', …
-
Coloring Problems on Graphs and Hypergraphs
… r-edge-coloring of K n is not (r, m)-splittable. Combinatorial designs yield fr(m) ≤ O(r2m2). Extending ideas of Erdo&huml;s and Gyarfas yields f r(m) ≥ min{O(rm 2), O(r2m)}. Similar bounds hold for a generalization to hypergraphs.
-
Eigenvalues of K-Uniform Hypergraphs
… hypergraphs and those hypergraphs obtained from combinatorial designs such as Steiner triple systems.
-
On graphical designs
A fundamental question in the theory of combinatorial designs is to ask what designs can be obtained with a particular automorphism group. This work completely determines all proper Steiner graphical t-wise balanced designs that have the group $S\sb{n}\ wr\ S\sb{r}$ (wreath product) acting on the …
-
Unconditionally Secure Cryptography: Signature Schemes, User-Private Information Retrieval, and the Generalized Russian Cards Problem
… two problems have close ties to the field of combinatorial designs, and properly fit within the field of combinatorial cryptography. All of these problems have a common thread, in that they are grounded in the information-theoretically secure or unconditionally secure setting.
-
Combinatorial Embeddings and Representations
… and complete multipartite graphs give rise to combinatorial designs when the faces of the embeddings are triangles. In this case, the blocks of the design correspond to the triangular faces of the embedding. These designs include Steiner, twofold and Mendelsohn triple systems, as well as Latin …
Page 1 of 3