✦ LIBER ✦

On the large sets of t-designs of size nine

✍ Scribed by Emami, M.; Naserian, O.

Book ID: 122822126
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 150 KB
Volume: 45
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.11.024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New large sets of t-designs

✍ Reinhard Laue; Spyros S. Magliveras; Alfred Wassermann 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB

Some results on the existence of large s

Some results on the existence of large sets of t-designs

✍ G. B. Khosrovshahi; R. Tayfeh-Rezaie 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 96 KB 👁 1 views

## Abstract A set of trivial necessary conditions for the existence of a large set of __t__‐designs, __LS__[N](__t,k,__ν), is $N\big | {{\nu \hskip -3.1 \nu}-i \choose k-i}$ for __i__ = 0,…,__t__. There are two conjectures due to Hartman and Khosrovshahi which state that the trivial necessary condi

Root cases of large sets of t-designs

✍ G.B. Khosrovshahi; B. Tayfeh-Rezaie 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 159 KB

A few more large sets of t-designs

✍ Yeow Meng Chee; Spyros S. Magliveras 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB 👁 1 views

We construct several new large sets of t-designs that are invariant under Frobenius groups, and discuss their consequences. These large sets give rise to further new large sets by means of known recursive constructions including an infinite family of large sets of 3 -(v, 4, λ) designs.

Large sets of t-designs over finite fiel

Large sets of t-designs over finite fields

✍ Braun, Michael; Kohnert, Axel; Östergård, Patric R.J.; Wassermann, Alfred 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 246 KB

Some Infinite Families of Large Sets of

Some Infinite Families of Large Sets of t-Designs

✍ B. Tayfeh-Rezaie 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 98 KB

A set of necessary conditions for the existence of a large set of t-designs, LS[N] (t, k, v), is N |( v&i k&i ) for i=0, 1, ..., t. We show that these conditions are sufficient for N=3, t=2, 3, or 4, and k 8.