Families of paths in the plane that connect all point pairs (Q1199232): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 03:29, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Families of paths in the plane that connect all point pairs |
scientific article |
Statements
Families of paths in the plane that connect all point pairs (English)
0 references
16 January 1993
0 references
A path in the plane is a subspace \(S\) which is homeomorphic to the closed unit interval. A family of paths in the plane is called a mesh, if every pair of distinct points in the plane coincides with the endpoints of some suitable member of this family. A point \(p\in R^ 2\) is called crossing point of a mesh \(M\), if there are two distinct paths \(S_ 1,S_ 2 \in M\) for which \(p\) is an interior point. If \(S_ 1,S_ 2\) are uniqely defined by this property, then the crossing point \(p\) is called simple. A simple mesh is a mesh all of whose crossing points are simple. Roughly speaking, the author shows that a subset of the plane is the crossing set of a mesh if and only if it is dense in the plane. He also constructs a mesh with only simple crossing points whose crossing set is meager and has measure zero. Furthermore he constructs a mesh with countable crossing set whose paths have pairwise finite intersection. It is shown that in such a mesh there can be no bound on the size of these intersections. The author's emphasis is on constructive methods.
0 references
path
0 references
mesh
0 references
crossing point of a mesh
0 references
simple mesh
0 references
crossing set of a mesh
0 references
simple crossing points
0 references