Claims

../

2026_06_17_pendyala: An arXiv preprint claims c sqrt(log n) <= S(n) <= pi n for the worst-case escape length, so that S(n) is unbounded; unrefereed and unreviewed.

2026_06_17_pendyala_radial: An SSRN preprint claims that every admissible polynomial of degree at most three has a radius in the origin's component, so S(n)=1 for n<=3, and that a degree-six polynomial blocks every radius, so S(6)>1.

---