Staircase connected sets
A compact set \(S\subset\mathbb{R}^2\) is staircase connected if every two points \(a,b\in S\) can be connected by a polygonal path with sides parallel to the coordinate axes, which is both \(x\)-monotone and \(y\)-monotone. Denote by \(\xi(a, b)\) the smallest number of edges of such a path; \(\xi(\cdot,\cdot)\) is an integer-valued metric on \(S\). The authors investigate this metric and introduce stars and kernels. Their main result is that the \(r\)-kernel, i.e. the set of all points in \(S\) from which any other point of \(S\) can be reached by a staircase path of at most \(r\) edges, is nonempty, compact, and staircase connected provided \(r\geq{1\over 2}\) (staircase diameter of \(S\)) \(+1\).
- Intersections of maximal staircase sets
- A characterization of generalized staircases
- scientific article; zbMATH DE number 1760038
- Sets expressible as unions as staircase n-convex polygons
- Unions of sets starshaped via staircase paths or via paths of bounded length
- Chain connected sets in a topological space
- Staircase Matrices and Systems
- scientific article; zbMATH DE number 2245630
- Quasiconnectedness between sets
- Staircases in \(\mathbb Z^2\)
This page was built for publication: Staircase connected sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369926)
