A survey of Sylvester's problem and its generalizations

From MaRDI portal
Publication:2638534

DOI10.1007/BF02112289zbMath0717.52013WikidataQ55891255 ScholiaQ55891255MaRDI QIDQ2638534

W. O. J. Moser, Peter B. Borwein

Publication date: 1990

Published in: Aequationes Mathematicae (Search for Journal in Brave)

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



Related Items

Unexpected hypersurfaces with multiple fat points, On the number of directions determined by a three-dimensional points set, On a conjecture of Kelly on (1, 3)-representation of Sylvester-Gallai designs, On unit circles which avoid all but two points of a given point-set, A generalized Sylvester–Gallai-type theorem for quadratic polynomials, On sets defining few ordinary lines, A generalisation of Sylvester's problem to higher dimensions, On the number of ordinary lines determined by sets in complex space, On the existence of ordinary triangles, A constructive version of the Sylvester-Gallai theorem, On matrix rigidity and locally self-correctable codes, Sylvester-Gallai type theorems for quadratic polynomials, Projective Configuration Theorems: Old Wine into New Wineskins, Beck's theorem for plane curves, Problems, problems, problems, Problems related to a de Bruijn-Erdös theorem, On the affine Sylvester problem, The axiomatics of ordered geometry: I. Ordered incidence spaces, A quantitative variant of the multi-colored Motzkin-Rabin theorem, There exist \(6n/13\) ordinary points, On the number of monochromatic lines in \(\mathbb{R}^d\), On the minimum number of ordinary conics, On sets defining few ordinary planes, Incidence geometry and universality in the tropical plane, Skewers, Sylvester-Gallai for arrangements of subspaces, The Sylvester-Gallai theorem, colourings and algebra, A generalized sylvester-gallai type theorem for quadratic polynomials, Some results on point visibility graphs, On number of circles intersected by a line, Computational Geometry Column 34, SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY, IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM



Cites Work