11/09/2015, 01:17 PM (This post was last modified: 11/09/2015, 01:37 PM by Gottfried.)

I experienced a bit with the problem of finding x in equations like and and where y is given.
This was mainly motivated by frequent questions in MSE and/or MO for solutions where or

What I mainly found was the requirement for a generalization of the Lambert-W (but a nicely straightforward one!) and some insight into the occuring power series.
Although having now an accessible entry-point into the general problem, I did not yet find explicite, simple closed form expressions for the occuring coefficients except when (but those are already well known...), so it's an open field for pattern-detection and research on radii of convergence.

11/10/2015, 12:04 PM (This post was last modified: 11/10/2015, 12:06 PM by Gottfried.)

(11/10/2015, 09:38 AM)tommy1729 Wrote: Conjecture 3.1 fails because the left hand side has radius going to 0.

Hmm, I've not yet settled everything about this in my mind. I've of course seen, that with increasing n the convergence-radius of the function decreases. However, as usually, if a function can be analytically continued (beyond its radius of convergence) for instance by Euler-summation, I assume, that the result is still meaningful. And we have here the possibility for Euler-summation, so I think there is a true analytic continuation. However, I don't know yet whether this can be correctly inserted in my conjecture-formula for the limit-case.

Quote:It is a mystery how you intend to solve the cases x^^(3/2) = v though.

As I understand this, this is using fractional iteration heights. As I described my exercises, I'm concerned with the unknown bases, and am using integer heights so far, not fractional heights ( superroot, not superlog)

Can you solve x^^(1/2) = 3? but... using "new" formula

Not with this elaboration. I'm on superroots of powertowers of integer heights so far. I've given no thought so far for analysis with fractional heights, except for some lazy tries to find an interpolation-formula for the rows in table 3.1 , but without easy success ....
Mind you to step in for this?

this "mission" (programming puzzle) has a very large number of "solutions" (Python implementations) of super-roots. After you login and solve the mission, it will show you other people's solutions along with your own. I solved it using the infinite tetrate (x^x^x^...) which is probably not the fastest method, but I think it's more beautiful than using Newton's method with an unknown number of iterations until you find the right number.

Most of the solutions are based on Newton's method or a similar bisection method, but I was considering going thru them to see if there's any new methods we didn't know about...

11/13/2015, 07:05 PM (This post was last modified: 11/13/2015, 07:06 PM by Gottfried.)

(11/13/2015, 05:58 PM)andydude Wrote: I'm not sure if this should be in a different thread, but I just found a website with programming puzzles, and one of the puzzles is super-roots:

Hi Andy, nice to read from you... Yes the page looks interesting, I'll try to get logged in another day (I'm in bed because of some bacteria or whatever and am just lurking around here a bit).

I had already other posts with superroots, for instance that one about the power series of (1+x)^(1+x)^...^(1+x). At the moment I was involved in that question of the supperroots -1 = x^x^x and had much fun already (see http://math.stackexchange.com/questions/...38#1415538 ) but again - cannot yet complete the discussion.

An actual discussion/application is on MSE, see the question of
Vladimir Reshetnikov where I tried to find an explanation /ansatz for a proof in my answer http://math.stackexchange.com/a/1530136/1714

I agree that it is a long-researched problem; trying to find a closed form for super-roots, or anything for that matter.

Using a combination of known facts from the Tetration Ref I collected, I was able to find a simpler expression for the logarithmic power series expansion of than I remember from before. I think the ideal solution would be to find a recurrence equation similar to the one we know for n-th tetrates. I've attached a short discussion of the things we know that might help in finding a closed form.