A Krasnosel'skij-type theorem in the plane involving polygonal \(n\)-paths (Q1331266)
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: A Krasnosel'skij-type theorem in the plane involving polygonal \(n\)-paths |
scientific article; zbMATH DE number 621986
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Krasnosel'skij-type theorem in the plane involving polygonal \(n\)-paths |
scientific article; zbMATH DE number 621986 |
Statements
A Krasnosel'skij-type theorem in the plane involving polygonal \(n\)-paths (English)
0 references
16 March 1995
0 references
This short note shows one theorem: If \(S\) is a compact simply connected subset of \(R^ 2\), then \(\text{ker}_ n(S)\) is nonempty if and only if every three boundary points of \(S\) are visible via polygonal \(n\)-paths in \(S\) from a common point. Here we say that a point \(x\) is visible from a point \(y\) via a polygonal \(n\)-path in \(S\) (a non-empty subset of the Euclidean plane) if and only if there is in \(S\) a polygonal path of at most \(n\) closed line segments joining \(x\) to \(j\). The set of points of \(S\) which see all points of \(S\) via polygonal \(n\)-paths in \(S\) is called the \(n\)-th order kernel of \(S\), denoted by \(\text{ker}_ n(S)\).
0 references
polygonal \(n\)-paths
0 references
Krasnosel'skij-type theorem
0 references
kernel
0 references