✦ LIBER ✦

Inequalities for t designs

✍ Scribed by Richard M Wilson

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 489 KB
Volume: 34
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(83)90065-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fisher type inequalities for Euclidean t

Fisher type inequalities for Euclidean t-designs

✍ P. Delsarte; J.J. Seidel 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 933 KB

Inequalities for quasi-symmetric designs

✍ A.R Calderbank 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Incidence matrices and inequalities for

Incidence matrices and inequalities for combinatorial designs

✍ D. Raghavarao; S.S. Shrikhande; M.S. Shrikhande 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract In this paper we use incidence matrices of block designs and row–column designs to obtain combinatorial inequalities. We introduce the concept of nearly orthogonal Latin squares by modifying the usual definition of orthogonal Latin squares. This concept opens up interesting combinatoria

Inequalities and bounds for quasi-symmet

Inequalities and bounds for quasi-symmetric 3-designs

✍ Rajendra M Pawale 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 420 KB

A note on the inequality b≥t for block d

A note on the inequality b≥t for block designs

✍ Bronisław Ceranka; Stanisław Mejza 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 227 KB

Backtracking algorithm for finding t-des

Backtracking algorithm for finding t-designs

✍ M. M-Noori; B. Tayfeh-Rezaie 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB

## Abstract A detailed description of an improved version of backtracking algorithms for finding __t__‐designs proposed by G. B. Khosrovshahi and the authors of this paper [J Combin Designs 10 (2002), 180–194] is presented. The algorithm is then used to determine all 5‐(14,6,3) designs admitting an