\(n\)-point sets and graphs of functions (Q946605)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(n\)-point sets and graphs of functions |
scientific article; zbMATH DE number 5346283
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(n\)-point sets and graphs of functions |
scientific article; zbMATH DE number 5346283 |
Statements
\(n\)-point sets and graphs of functions (English)
0 references
23 September 2008
0 references
An \(n\)-point set (a plane set which hits each line in exactly \(n\) points) and the graph of a function from \(\mathbb{R}\) to \(\mathbb{R}\) (a plane set which hits each vertical line in exactly one point) have simple and somewhat similar definitions, but clearly no set can be both. The question considered here is whether an \(n\)-point set can be homeomorphic to such a graph. It is known that each 2-point set with two points removed is homeomorphic to such a graph, while there exists a 2-point set which is not. The main result in this paper is that for each \(n\geq 2\), there exists an \(n\)-point set which is homeomorphic to the graph of a function from \(\mathbb{R}\) to \(\mathbb{R}\). For each \(n\geq 4\), there exist both zero-dimensional and one-dimensional examples.
0 references
\(n\)-point set
0 references
planar set
0 references
graph of a function
0 references