Defining sets of combinatorial designs: recent developments
Küçük Resim Yok
Tarih
2009
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Maltepe Üniversitesi
Erişim Hakkı
CC0 1.0 Universal
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Özet
In this talk, the defining set problem will be defined for combinatorial designs. Loosely speaking a defining set of a combinatorial design D is a partial design S contained in the design such that D is the unique completion of S to a design with the given parameters. The emphasis of this talk will be on defining sets of full designs and their connections with the defining sets other t-designs. The new found families of minimal defining sets of full designs will be given. And final results on spectrum of minimal defining sets of these designs will be presented.
Açıklama
Anahtar Kelimeler
Kaynak
International Conference of Mathematical Sciences
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Yazıcı, E. Ş. (2009). Defining sets of combinatorial designs: recent developments. Maltepe Üniversitesi. s. 143.
