On existence and number of orthogonal arrays

DOI10.1016/0097-3165(88)90041-6zbMath0649.05017OpenAlexW1995650155MaRDI QIDQ1105609

D. K. Ray-Chaudhuri, Navin M. Singhi

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(88)90041-6

zbMATH Keywords

reciprocity relationsigned orthogonal array

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (8)

A large index theorem for orthogonal arrays, with bounds ⋮ Orthogonal arrays and ordered designs ⋮ \((s,r;\mu )\)-nets and alternating forms graphs ⋮ A construction for infinite families of Steiner 3-designs ⋮ The asymptotic existence of group divisible designs of large order with index one ⋮ q-analogues of t-designs and their existence ⋮ Algorithmic methods for covering arrays of higher index ⋮ Totient numbers of an arithmetic progression in a hypercube: The coprime case

Cites Work

• A reciprocity relation for t-designs
• Hilbert functions of graded algebras
• The module structure of integral designs
• Linear homogeneous Diophantine equations and magic labelings of graphs
• Rings of Invariants of Tori, Cohen-Macaulay Rings Generated by Monomials, and Polytopes
• Combinatorics and commutative algebra
• Combinatorial reciprocity theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On existence and number of orthogonal arrays