The Bruck-Ryser-Chowla theorem is a result in combinatorial design theory giving necessary conditions for the existence of a symmetric block design. Bruck and Ryser proved it for projective planes in 1949 and Chowla and Ryser extended it to general symmetric designs in 1950; it requires that when the design parameter v is even, the quantity k minus lambda must be a perfect square, and when v is odd, a related Diophantine equation must have a nontrivial solution, a condition strong enough to rule out projective planes of orders 6 and 14 even though satisfying it does not by itself guarantee a design exists. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement Form Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
In Branch
Source Bruck-Ryser-Chowla theorem (Wikipedia)
Sources
1. Bruck-Ryser-Chowla theorem (Wikipedia)
2. Bruck-Ryser-Chowla theorem (Wikipedia)
Wikipedia Bruck-Ryser-Chowla theorem lead paragraph (w-bbfill-psymath4-0926)Quote, Wikipedia Bruck-Ryser-Chowla theorem lead paragraph (w-bbfill-psymath4-0926)
proved in the case of projective planes by Bruck & Ryser (1949
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.