A Krasnosel'skii theorem for orthogonal polygons starshaped via staircase \((n + 1)\)-paths (Q623378): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 09:15, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Krasnosel'skii theorem for orthogonal polygons starshaped via staircase \((n + 1)\)-paths |
scientific article |
Statements
A Krasnosel'skii theorem for orthogonal polygons starshaped via staircase \((n + 1)\)-paths (English)
0 references
14 February 2011
0 references
Krasnosel'skii showed that a non-empty compact set \(S\) in the plane is starshaped if and only if every three points of \(S\) are visible (along straight line segments in \(S\)) from a common point. The author considers Krasnosel'skii-type results for the case where \(S\) is assumed to be a simply connected orthogonal polygon (orthogonality refers to axis parallel sides), and straight line segments are replaced by staircase paths. In an earlier paper she had shown that a simply connected orthogonal polygon \(S\) is starshaped via staircase paths if and only if every two points of \(S\) are visible via staircase paths in \(S\) from a common point. The present work refines this statement: If \(n\geq1\) is such that every two points of \(S\) are visible via staircase paths of length \(n\) in \(S\) from a common point, then \(S\) is starshaped via staircase paths of length \(n+1\). It is shown that the number two is best possible and that \(n+1\) is best possible for \(n\geq 2\). Moreover, the associated staircase \((n+1)\)-kernel is shown to be staircase path convex with paths of lengths at most \(n+1\).
0 references
orthogonal polygon
0 references
sets starshaped via staircase path
0 references
staircase convex
0 references