A discrete Reimann z function for maps

We want to take logs and exponents of directed graphs. Like the Reimann surface, except discrete.

e^(d*a)  , d imaginary map, a is angle, gets   z+d*b, the zth dimension, bth variable. So, the Reimann is like a screw counting up the multi-base digit system. All integer, all discrete and finite. As you crank the lower digits, they count through quantum angles fairly fast, but as you count up to higher digits, it takes more cranks to pass a dimension.

P(d+d*b), computes third power differential, bth root, Tanh can handle the rest, generating nth dimension, kth angle.
The discrete worm gear, it will count through any M dimensional, geared map; as long as you do the log function first.

We still have to work the issue of superposition of synchronous counters, make sure we obey the laws of recursion. That one might be tough.