Does the 5-hyperrectangle break any complexity thresholds analogous to quintics?

34 Views Asked by At

A function similar to Minkowski's question-mark function pairs periodic 2-adic numbers with quadratic irrationals, and pairs these with rectangle-shapes.

It is likely that periodic 5-adic numbers can be paired with quintics and with 5-hyperrectangles.

Are the 5-hyperrectangles known to break some complexity threshold akin to the Abel-Ruffini theorem?