Bruck-Ryser-Chowla theorem

from Wikipedia, the free encyclopedia

The Bruck – Ryser – Chowla theorem is a combinatorial statement about possible block plans , which specifies the necessary conditions for their existence.

The sentence says: If there is a symmetric block plan, then holds

  • if v is even then is a square number ;
  • if v is odd, then the Diophantine equation has a non-zero solution

The theorem was proved in 1949 for the special case of projective planes by Richard Bruck and Herbert John Ryser and in 1950 with Sarvadaman Chowla it was generalized to more general symmetrical block plans.

Finite projective planes

In the special case of a minimal symmetrical 2-block plan with - i.e. for finite projective planes - the sentence can be formulated as follows:

If a projective level of order exists and or holds, then is the sum of two square numbers (one of which can also vanish).

If one understands a finite projective level of the order as a special symmetrical block plan, then are the parameters that describe the block plan

.

In this more specific formulation for projective planes, the theorem is also cited as the theorem of Bruck and Ryser .

Conclusions and Examples

From the sentence it follows, for example, that there is no level for orders 6 and 14, but it does not exclude the existence of levels of orders and . It could be shown that no projective plane of order 10 exists. It follows that the conditions in Bruck-Ryser-Chowla's theorem are not a sufficient condition for the existence of block plans.

  • The orders fulfill the necessary condition of the proposition for projective planes. In fact, there are levels with these orders because they are also prime powers.
  • The sentence makes no statement about levels of order , there is. Since 27 is a prime power, there is a level with this order.

Excluded orders

The sequence of numbers that, due to the Bruck and Ryser theorem, cannot be orders of a projective plane, i.e. the numbers with that are not the sum of two square numbers , form the sequence A046712 in OEIS .

The smallest orders excluded are: 6, 14, 21, 22, 30, 33, 38, 42, 46, 54, 57, 62, 66, 69, 70, 77, 78, 86, 93, 94, 102, 105 , 110, 114, 118, 126, 129, 133, 134, 138, 141, 142, 150, 154, 158, 161, 165, 166, 174, 177, 182, 186, 189, 190, 198, 201, 206 , 209, 210, 213, 214, 217, 222, 230, 237, 238, ...

literature

Technical article

Textbooks that introduce the topic

  • Jeffrey H. Dinitz, Douglas Robert Stinson: A Brief Introduction to Design Theory . In: JH Dinitz and DR Stinson (Eds.): Contemporary Design Theory: A Collection of Surveys . Wiley, New York 1992, ISBN 0-471-53141-3 , chap. 1 , p. 1-12 .
  • Jacobus Hendricus van Lint , RM Wilson: A Course in Combinatorics . 2nd Edition. Cambridge University Press, Cambridge 2001, ISBN 0-521-80340-3 .
  • Jiří Matoušek, Jaroslav Nešetřil: Discrete Mathematics . A journey of discovery. Springer, Berlin / Heidelberg / New York /… 2002, ISBN 3-540-42386-9 , 8: Finite projective planes and 11.1: Designs ( DNB 963555103/04 [accessed on February 8, 2012] English: Invitation to Discrete Mathematics . Translated by Hans Mielke, textbook that requires little previous knowledge - advanced school mathematics up to the 2nd semester of mathematics studies).
  • Albrecht Beutelspacher : Introduction to finite geometry I . 2nd Edition. BI Wissenschaftsverlag, Mannheim 1983, ISBN 3-411-01632-9 , p. 176-185 .

Web links

References and comments

  1. Bruck and Ryser (1949)
  2. Chowla and Ryser (1950)
  3. This means that different "blocks", which are called straight lines in geometry , always have exactly one ( ) common "point".
  4. van Lint (1992)
  5. Reinhard Zumkeller: Table n, a (n) for n = 1..10000 gives the first 10000 numbers excluded in this way, including their number in the sequence A046712: ASCII text file , accessed on February 9, 2012.