A theorem in combinatorial matrix theory

DOI10.1016/0024-3795(80)90255-4MaRDI QIDQ1138062zbMATH OpenOpenAlexFDO

Authors Herbert John Ryser

Publication date 1980

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(80)90255-4

zbMATH Keywords

diagonal matricessymmetric block designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Matrix equations and identities (15A24)

Cites work

• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3521986 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• A Fundamental Matrix Equation for Finite Sets
• A characterization of symmetric block designs
• A theorem on block designs
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• Block designs with repeated blocks
• Modular Hadamard matrices and related designs
• On \(\lambda\)-designs
• Some results on λ-designs
• Square λ-Linked Designs

Cited in

(3)

• An application of Ryser's (x,y)-theorem to a problem in statistics
• Combinatorial analysis (nonnegative matrices, algorithmic problems)
• Matrices and set intersections

This page was built for publication: A theorem in combinatorial matrix theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1138062)