Three-point sets (Q5937497): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on intersections of prescribed cardinality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Theorem of Larman / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Four-Point Set That Cannot Be Split / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Two-Point Set Must be Zero-Dimensional / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem of Incidence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets which Meet each Line in Exactly Two Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite combinatorics and definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une généralisation des théorèmes de S. Mazurkiewicz et F. Bagemihl / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3253173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hahn-Mazurkiewicz theorem for rim-finite continua / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:20, 3 June 2024

scientific article; zbMATH DE number 1619349
Language Label Description Also known as
English
Three-point sets
scientific article; zbMATH DE number 1619349

    Statements

    Three-point sets (English)
    0 references
    0 references
    0 references
    0 references
    4 November 2001
    0 references
    A planar set is called an \(n\)-point set (partial \(n\)-point set) if each line intersects the set in exactly \(n\) points (in at most \(n\)-points). It is known that \(n\)-point sets exist whenever \(n\geq 2\) is a natural number. It is an open problem whether there are some Borel \(n\)-point sets. The authors prove that no three-point set contains an arc. As a consequence they obtain that there is no \(F_\sigma\) three-point set. The proofs are done using nice elementary geometrical arguments. It is further proved that any partial \(n\)-point set can be extended to a \(k\)-point set whenever \(n\geq 2\) and \(k\geq n+2\). In particular, there is a four-point set containing a circle. The authors ask whether any three-point set is zero-dimensional. This question was answered in the positive by \textit{D. L. Fearnley, L. Fearnley} and \textit{J. W. Lamoreaux} [Proc. Am. Math. Soc. 131, 2241-2245 (2003; Zbl 1023.54014)]. As remarked in the note added in the proof, \textit{K. Bouhjar, J. J. Djikstra} and \textit{R. D. Mauldin} [Proc. Am. Math. Soc. 129, 621-622 (2001; Zbl 0959.54024)] showed that no \(n\)-point set for any \(n\geq 2\) is \(F_\sigma\).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    planar set
    0 references
    three-point set
    0 references
    \(n\)-point set
    0 references
    arc
    0 references
    continuum
    0 references
    \(F_\sigma\)-set
    0 references