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

DOI10.7146/MATH.SCAND.A-10758MaRDI QIDQ5536049zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(20)

• Matroid enumeration for incidence geometry
• On sets defining few ordinary hyperplanes
• A Gallai-type problem
• Supersolvable simplicial arrangements
• A Sylvester theorem for conic sections
• Visibility and parallelotopes in projective space
• A lower bound on the number of cells in arrangements of hyperplanes
• Separating cocircuits in binary matroids
• Fractional Sylvester–Gallai theorems
• On Zonotopes
• A survey of Sylvester's problem and its generalizations
• Sylvester-Gallai for arrangements of subspaces
• Lines, circles, planes and spheres
• On the number of ordinary planes
• A Sylvester-Gallai-type theorem for complex-representable matroids
• A bichromatic incidence bound and an application
• On finite sets of points in \(P^ 3\)
• Improved rank bounds for design matrices and a new proof of Kelly's theorem
• On low-dimensional faces that high-dimensional polytopes must have
• On a generalization of the Gallai-Sylvester theorem

This page was built for publication: A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set.

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