The Sylvester-Gallai theorem, colourings and algebra

DOI10.1016/J.DISC.2007.12.027zbMATH Open1177.05023arXivmath/0606131OpenAlexW2157778301MaRDI QIDQ998535FDOQ998535

L. M. Pretorius, Konrad J. Swanepoel

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/math/0606131

Recommendations

• Sylvester-Gallai theorems for complex numbers and quaternions
• Elementary versions of the Sylvester-Gallai theorem
• A survey of Sylvester's problem and its generalizations
• The Sylvester-Chvátal theorem
• On a generalization of the Gallai-Sylvester theorem

zbMATH Keywords

combinatorial geometryfinite geometrySylvester-Gallai theoremMotzkin-Rabin theoremproper finite linear spacetwo-colouring of a finite linear space

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Desarguesian and Pappian geometries (51A30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Baer subplanes and blocking sets
• Locally projective-planar lattices which satisfy the bundle theorem
• Title not available (Why is that?)
• A generalization of Kaplansky's game
• Combinatorial theory.
• Eine Bemerkung zu einem Satz von Sylvester
• A survey of Sylvester's problem and its generalizations
• The Lines and Planes Connecting the Points of a Finite Set
• Title not available (Why is that?)
• Sylvester's Problem on Collinear Points and a Relative
• Personal reminiscences and remarks on the mathematical work of Tibor Gallai
• Transversal designs in classical planes and spaces
• Title not available (Why is that?)
• Affine Subplanes of Finite Projective Planes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Affine embeddings of Sylvester-Gallai designs
• Embedding a Latin square with transversal into a projective space
• A resolution of the Sylvester-Gallai problem of J.-P. Serre
• Finite linear spaces. II
• Sylvester-Gallai theorems for complex numbers and quaternions
• Historical notes on Steiner systems
• Title not available (Why is that?)
• The proper linear spaces on 17 points
• Title not available (Why is that?)
• Blocking sets in small finite linear spaces
• Enumerating Motzkin–Rabin geometries
• Title not available (Why is that?)
• An Algorithmic Proof of the Motzkin-Rabin Theorem on Monochrome Lines
• Linear spaces on 16 points
• Applications of Strict Π₁¹ predicates to infinitary logic

Cited In (5)

• Embedding a Latin square with transversal into a projective space
• On the number of monochromatic lines in \(\mathbb{R}^d\)
• A survey of Sylvester's problem and its generalizations
• Club-guessing, stationary reflection, and coloring theorems
• Enumerating Motzkin–Rabin geometries

This page was built for publication: The Sylvester-Gallai theorem, colourings and algebra

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