𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Incidence matrices and inequalities for combinatorial designs

✍ Scribed by D. Raghavarao; S.S. Shrikhande; M.S. Shrikhande

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
128 KB
Volume
10
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

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 combinatorial problems and is expected to be useful in planning experiments by statisticians. Β© 2002 John Wiley & Sons, Inc. J Combin Designs 10: 17–26, 2002

πŸ“œ SIMILAR VOLUMES

ChemInform Abstract: Combinatorial and C
ChemInform Abstract: Combinatorial and Computational Challenges for Biocatalyst Design
✍ Frances H. Arnold πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons βš– 24 KB πŸ‘ 2 views

## Abstract ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a β€œFull Text” option. The original article is trackable v

New constructions for perfect hash famil
New constructions for perfect hash families and related structures using combinatorial designs and codes
✍ D. R. Stinson; R. Wei; L. Zhu πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 141 KB πŸ‘ 1 views

In this paper, we consider explicit constructions of perfect hash families using combinatorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and