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 19 of 19 for “"Steiner systems"”.

  1. Various Steiner Systems

    … project deals with the automorphism group G of a Steiner system S (3, 4, 10). S₁₀, the symmetrical group of degree 10, acts transitively on T, the set of all Steiner systems with parameters 3, 4, 10. The purpose of this project is to study the action of S₁₀ on cosets of G. This will be achieved by …

    csusb Repository record for Various Steiner Systems (opens in a new tab)

  2. Various Steiner Systems

    … project deals with the automorphism group G of a Steiner system S (3, 4, 10). S₁₀, the symmetrical group of degree 10, acts transitively on T, the set of all Steiner systems with parameters 3, 4, 10. The purpose of this project is to study the action of S₁₀ on cosets of G. This will be achieved by …

    csusb-retro Repository record for Various Steiner Systems (opens in a new tab)

  3. Steiner systems of the Mathieu Group M₁₂

    A Steiner system T with parameters (5,6,12) is a collection of 6-element sets, called hexads, of a 12-element set [omega], such that any 5 of the 12 elements belong to exactly one hexad. In this project we construct a graph whose vertices are the orbits of S₁₂ on T x T, where T is the set of all …

    csusb Repository record for Steiner systems of the Mathieu Group M₁₂ (opens in a new tab)

  4. Steiner systems of the Mathieu Group M₁₂

    A Steiner system T with parameters (5,6,12) is a collection of 6-element sets, called hexads, of a 12-element set [omega], such that any 5 of the 12 elements belong to exactly one hexad. In this project we construct a graph whose vertices are the orbits of S₁₂ on T x T, where T is the set of all …

    csusb-retro Repository record for Steiner systems of the Mathieu Group M₁₂ (opens in a new tab)

  5. Computing techniques for the enumeration of cyclic Steiner systems

    … algorithm is developed for finding cyclic Steiner systems. A cyclic Steiner system with parameters S(t,k,v) is a pair ( V,B), where B is a collection of subsets all of size k (called blocks) and V is a t; element set of points, such that each t-subset of V is contained in precisely one …

    rit Repository record for Computing techniques for the enumeration of cyclic Steiner systems (opens in a new tab)

  6. An Introduction to S(5,8,24)

    S(5,8,24) is one of the largest known Steiner systems and connects combinatorial designs, error-correcting codes, finite simple groups, and sphere packings in a truly remarkable way. This thesis discusses the underlying structure of S(5,8,24), its construction via the (24,12) Golay code, as well …

    vt Repository record for An Introduction to S(5,8,24) (opens in a new tab)

  7. Covering Graphs and Equiangular Tight Frames

    … tight frames from projective geometries and Steiner systems also has been presented.

    waterloo Repository record for Covering Graphs and Equiangular Tight Frames (opens in a new tab)

  8. Infinite Jordan Permutation Groups

    … structures, or tree-like structures, or Steiner systems or a ‘limit’ of Steiner systems, or a ‘limit’ of betweenness relations or D-relations. In this thesis we build a structure M whose automorphism group is an infinite oligomorphic primitive Jordan permutation group preserving a limit …

    whiterose Download PDF for Infinite Jordan Permutation Groups (opens in a new tab)

  9. 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 …

    cent-lancashire Download PDF for Anti-pasch and pasch steiner triple systems (opens in a new tab)

  10. The Steiner problem in graphs and its application to phylogeny : a dissertation presented in partial fulfilment of the requirements for the degree of Master of Arts in Computer Science at Massey University

    … in Evolutionary Biology. The first problem, the Steiner Problem in Graphs, belongs to the class of problems known as NP-complete. That it belongs to this class is a measure of its difficulty; if a polynomial solution can be found for the Steiner Problem in Graphs, then by definition a polynomial …

    massey Repository record for The Steiner problem in graphs and its application to phylogeny : a dissertation presented in partial fulfilment of the requirements for the degree of Master of Arts in Computer Science at Massey University (opens in a new tab)

  11. Computer construction of (4,4,v)-threshold schemes from Steiner Quadruple Systems

    … for Sv/4 pairwise disjoint quadruple systems on u points has been given by Lindner. This thesis looks at an implementation of nearly optimal (4,4, v)threshold schemes based on his construction. These threshold schemes will have 3 v/4 keys, whereas the best implementation known to date …

    rit Repository record for Computer construction of (4,4,v)-threshold schemes from Steiner Quadruple Systems (opens in a new tab)

  12. 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, …

    tamu Repository record for A new polyhedral approach to combinatorial designs (opens in a new tab)