User blog:Primussupremus/Euclidean notation polygons and beyond.

I have defined rectangles to be recursive squares where squares have a growth rate of f_omega (n) and rectangles have a growth rate of f_omega+1 (n). This regiment is known as the polygon regiment as it is two dimensional in nature it has a growth rate of  f_omega2 (n). The next regiment is the 3 dimensional regiment or the block regiment it has a growth rate of f_omega3(n), this regiment is defined as fw2+n (n) where n is the number of sides in an n sided polygon. For example a cube which is the first member of this regiment has 6 faces so its fw2+6 (n) for a cube. You can probably see that this will be bounded at f_omega3(n). The next regiment follows the same sort of rules the only difference beings its f_omega3+n (n) instead of f_omega2+n (n) giving it a growth rate of f_omega4 (n). If you follow this pattern you can probably guess  that the next regiment will have a growth rate of f_omega5 (n) and the next will have a growth rate of f_omega6 (n). This bounds the notation at f_omega^2 (n).