Unbounded a2 AllSelection
Abstract
Unbounded a2 AllSelection
For every u>=2, s>=1 and every natural k, construct Good (2^u) (2^s) (2^k). The cases k<=1 use the original dyadic selector, p=4,8,16,32 use the existing unbounded small selector, and p>=64 uses the large selector. No upper exponent bound or selector hypothesis occurs.