Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    New user? Click here to register. Have you forgotten your password?
Repository logo
  • Colleges, Institutes & Collections
  • Browse AAU-ETD
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Zebene Girma"

Now showing 1 - 2 of 2
Results Per Page
Sort Options
  • No Thumbnail Available
    Item
    New Existence Results on Group Divisible Designs and 3-GDDs
    (Addis Ababa University, 2024-06) Zebene Girma; Dinesh G. Sarvate; Samuel Assefa
    Combinatorial design theory offers a framework for efficiently and systematically arranging objects with given criterion and studying these arrangement (combinatorial designs) and their applications is various fields. For example, combinatorial designs are used in statistical design theory, computer science, cryptography and coding theory. Two specific combinatorial designs are group divisible designs (GDDs) and t-GDDs. The aim of our study is to find new existence results on GDDs and t-GDDs when t = 3. In particular, we gave some new constructions and necessary conditions for GDDs with two groups and block size four. An extension of the concepts of group divisible designs is called t-GDD. It is obtained by combining the concepts of group divisible designs and t-design. So for example, a 3-GDD(n, 2, k, λ1, λ2) is defined by combining the concepts of GDDs and a 3-design. 3-GDDs with 2 groups and block size 4 have been studied in the literature. We obtain new results on 3-GDDs with three groups and block size five, as well as with four groups and block size five. In this work, certain required necessary conditions for these GDDs to exist are designed, several new constructions are given, and specific instances of non-existence are proved.
  • No Thumbnail Available
    Item
    New Existence Results on Group Divisible Designs and 3-GDDs
    (Addis Ababa University, 2024-06) Zebene Girma; Dinesh G. Sarvate; Samuel Asefa (Professor)
    Combinatorial design theory offers a framework for efficiently and systematically arranging objects with given criterion and studying these arrangement (combinatorial designs) and their applications is various fields. For example, combinatorial designs are used in statistical design theory, computer science, cryptography and coding theory. Two specific combinatorial designs are group divisible designs (GDDs) and t-GDDs. The aim of our study is to find new existence results on GDDs and t-GDDs when t = 3. In particular, we gave some new constructions and necessary conditions for GDDs with two groups and block size four. An extension of the concepts of group divisible designs is called t-GDD. It is obtained by combining the concepts of group divisible designs and t-design. So for example, a 3-GDD(n, 2, k, λ1, λ2) is defined by combining the concepts of GDDs and a 3-design. 3-GDDs with 2 groups and block size 4 have been studied in the literature. We obtain new results on 3-GDDs with three groups and block size five, as well as with four groups and block size five. In this work, certain required necessary conditions for these GDDs to exist are designed, several new constructions are given, and specific instances of non-existence are proved.

Home |Privacy policy |End User Agreement |Send Feedback |Library Website

Addis Ababa University © 2023