On Sylvester's problem and Haar spaces (Q791058)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On Sylvester's problem and Haar spaces
scientific article

    Statements

    On Sylvester's problem and Haar spaces (English)
    0 references
    0 references
    1983
    0 references
    Given a finite set of points in the plane (with distinct x coordinates) must there exist a polynomial of degree n that passes through exactly \(n+1\) of the points? Provided that the points do not all lie on the graph of a polynomial of degree n then the answer to this question is yes. This generalization of Sylvester's problem (the \(n=1\) case) is established as a corollary to a version of Sylvester's Problem that holds for certain finite dimensional Haar spaces of continuous functions.
    0 references
    0 references
    Sylvester's problem
    0 references
    Haar spaces
    0 references
    0 references