Sylvester-gallai theorems for complex numbers and quaternions

22Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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. © 2005 Springer Science+Business Media, Inc.

Cite

CITATION STYLE

APA

Elkies, N., Pretorius, L. M., & Swanepoel, K. J. (2006). Sylvester-gallai theorems for complex numbers and quaternions. Discrete and Computational Geometry, 35(3), 361–373. https://doi.org/10.1007/s00454-005-1226-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free