A family of examples showing that no Krasnosel'skii number exists for orthogonal polygons starshaped via staircase \(n\)-paths (Q1037213)

A plane set \(S\) is called orthogonal polygon iff \(S\) is connected union of finitely many convex polygons whose edges are parallel to the coordinate axes. Path \(\lambda \) is a staircase path iff the asociated vectors alternate in direction. For \(n\geq 1\) the staircase path is a union of at most \(n\) edges then \(\lambda \) is called staircase \(n\)-path. For any pair of points \(x\) and \(y\) in \(S\), \(x\) sees \(y\) via staircase \(n\)-path iff there is a staircase \(n\)-path in \(S\) which contains bot \(x\) and \(y\). The author constructs examples for a set \(S\) in the plane which is a simply connected orthogonal polygon, there exists no Krasnosel'skii number \(h(n)\) for \(n\geq 2\), satisfying the property if every \(h(n)\) points of \(S\) are visible via staircase \(n\)-paths from a common point, then \(S\) is a starshaped via staircase \(n\)-paths.