A Fundamental Matrix Equation for Finite Sets

DOI10.2307/2038366zbMath0258.05021OpenAlexW4229586465MaRDI QIDQ5672647

H. J. Ryser

Publication date: 1972

Full work available at URL: https://doi.org/10.2307/2038366

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05) Matrix equations and identities (15A24) Other designs, configurations (05B30)

Related Items (11)

General forbidden configuration theorems ⋮ Hypergraphs with no special cycles ⋮ A forbidden configuration theorem of Alon ⋮ A theorem in combinatorial matrix theory ⋮ Matrices and set intersections ⋮ Set intersection matrices ⋮ Analogs of a theorem of Schur on matrix transformations ⋮ Matrices and set differences ⋮ Properties of (0,1)-matrices with no triangles ⋮ Properties of (0,1)-matrices without certain configurations ⋮ Matrices with forbidden subconfigurations

Cites Work

• Block designs with repeated blocks
• Products of Zero-One Matrices
• Combinatorial Configurations
• A problem in partitions
• Unnamed Item

This page was built for publication: A Fundamental Matrix Equation for Finite Sets