Lou M. Pretorius
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lou M. Pretorius has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Konrad J. Swanepoel
Department of Mathematical Sciences University of South Africa PO Box 392 0003 Pretoria South Africa
5 shared publications - Noam D. Elkies
Department of Mathematics, Harvard University, Cambridge, USA
2 shared publications
Latest Publications
- Open Access
The Sylvester-Gallai Theorem, colourings and algebra
Our point of departure is the following simple common generalisation of the Sylvester-Gallai theorem and the Motzkin-Rabin theorem: Let S be a finite set of points in the plane, with each point coloured red or blue or with both colours. Suppose that for any two distinct points A,B in S sharing a colour there is a third point C in S, of the other colour, collinear with A and B. Then all the points in S are collinear. We define a chromatic geometry to be a simple matroid for which each point is coloured red or blue or with both colours, such that for any two distinct points A,B in S sharing a colour there is a third point C in S, of the other colour, collinear with A and B. This is a common generalisation of proper finite linear spaces and properly two-coloured finite linear spaces, with many known properties of both generalising as well. One such property is Kelly's complex Sylvester-Gallai theorem. We also consider embeddings of chromatic geometries in Desarguesian projective spaces. We prove a lower bound of 51 for the number of points in a 3-dimensional chromatic geometry in projective space over the quaternions. Finally, we suggest an elementary approach to the corollary of an inequality of Hirzebruch used by Kelly in his proof of the complex Sylvester-Gallai theorem.
Open AccessThe Sylvester-Gallai Theorem, colourings and algebra
Our point of departure is the following simple common generalisation of the Sylvester-Gallai theorem and the Motzkin-Rabin theorem: Let S be a finite set of points in the plane, with each point coloured red or blue or with both colours. Suppose that for any two distinct points A,B in S sharing a colour there is a third point C in S, of the other colour, collinear with A and B. Then all the points in S are collinear. We define a chromatic geometry to be a simple matroid for which each point is coloured red or blue or with both colours, such that for any two distinct points A,B in S sharing a colour there is a third point C in S, of the other colour, collinear with A and B. This is a common generalisation of proper finite linear spaces and properly two-coloured finite linear spaces, with many known properties of both generalising as well. One such property is Kelly's complex Sylvester-Gallai theorem. We also consider embeddings of chromatic geometries in Desarguesian projective spaces. We prove a lower bound of 51 for the number of points in a 3-dimensional chromatic geometry in projective space over the quaternions. Finally, we suggest an elementary approach to the corollary of an inequality of Hirzebruch used by Kelly in his proof of the complex Sylvester-Gallai theorem.
- Open Access
Sylvester-Gallai Theorems for Complex Numbers and Quaternions
A Sylvester-Gallai (SG) configuration is a finite set S of points such that the line through any two points in S contains a third point of S. According to the Sylvester-Gallai Theorem, an SG configuration in real projective space must be collinear. A problem of Serre (1966) asks whether an SG configuration in a complex projective space must be coplanar. This was proved by Kelly (1986) using a deep inequality of Hirzebruch. We give an elementary proof of this result, and then extend it to show that an SG configuration in projective space over the quaternions must be contained in a three-dimensional flat.
Open AccessSylvester-Gallai Theorems for Complex Numbers and Quaternions
A Sylvester-Gallai (SG) configuration is a finite set S of points such that the line through any two points in S contains a third point of S. According to the Sylvester-Gallai Theorem, an SG configuration in real projective space must be collinear. A problem of Serre (1966) asks whether an SG configuration in a complex projective space must be coplanar. This was proved by Kelly (1986) using a deep inequality of Hirzebruch. We give an elementary proof of this result, and then extend it to show that an SG configuration in projective space over the quaternions must be contained in a three-dimensional flat.
- Open Access
- 3 February 2006
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 35 (3) , 361-373
Sylvester–Gallai Theorems for Complex Numbers and Quaternions
- 3 February 2006
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 35 (3) , 361-373
Open AccessSylvester–Gallai Theorems for Complex Numbers and Quaternions
- 1 March 2004
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 111 (3) , 245-251
An Algorithmic Proof of the Motzkin-Rabin Theorem on Monochrome Lines
- 1 March 2004
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 111 (3) , 245-251
An Algorithmic Proof of the Motzkin-Rabin Theorem on Monochrome Lines
- Open Access
Blocking sets in small finite linear spaces
We classify all finite linear spaces on at most 15 points admitting a blocking set. There are no such spaces on 11 or fewer points, one on 12 points, one on 13 points, two on 14 points, and five on 15 points. The proof makes extensive use of the notion of the weight of a point in a 2-coloured finite linear space, as well as the distinction between minimal and non-minimal 2-coloured finite linear spaces. We then use this classification to draw some conclusions on two open problems on the 2-colouring of configurations of points.
Open AccessBlocking sets in small finite linear spaces
We classify all finite linear spaces on at most 15 points admitting a blocking set. There are no such spaces on 11 or fewer points, one on 12 points, one on 13 points, two on 14 points, and five on 15 points. The proof makes extensive use of the notion of the weight of a point in a 2-coloured finite linear space, as well as the distinction between minimal and non-minimal 2-coloured finite linear spaces. We then use this classification to draw some conclusions on two open problems on the 2-colouring of configurations of points.