A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set.

DOI10.7146/math.scand.a-10758zbMath0156.19501OpenAlexW89122021MaRDI QIDQ5536049

Sten Hansen

Publication date: 1965

Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/165919

zbMATH Keywords

foundations of geometry

Mathematics Subject Classification ID

Geometry (51-XX)

Related Items

A survey of Sylvester's problem and its generalizations, A Sylvester theorem for conic sections, On low-dimensional faces that high-dimensional polytopes must have, Lines, circles, planes and spheres, Supersolvable simplicial arrangements, Visibility and parallelotopes in projective space, Separating cocircuits in binary matroids, Sylvester-Gallai type theorems for quadratic polynomials, A bichromatic incidence bound and an application, Matroid enumeration for incidence geometry, On Zonotopes, On a generalization of the Gallai-Sylvester theorem, Fractional Sylvester–Gallai theorems, A lower bound on the number of cells in arrangements of hyperplanes, Sylvester-Gallai for arrangements of subspaces, A Gallai-type problem, On sets defining few ordinary hyperplanes, On finite sets of points in \(P^ 3\), On the number of ordinary planes, IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM