Slog(Exponential Factorial(x))

[JmsNxn]

Numbers worked out with the Kneser method.

Just a general remark: since we don't have an "accepted" Kneser-Method it would be good to always mention *which* implementation one uses. For instance, Sheldonison's method is not yet *proven* to implement Kneser (which is what Sheldonison always stated, although he is confident that it is). My q&d polynomial method (based on Carlemanmatrices, but truncated ones) *seems to give* an approximation to sheldonison's values, but as well it is not proven to claim such an asymptotic at all.   For instance in my msgs in MSE and MO I always state it explicitely, that neither the Sheldon's nor my is proven to approximate the true Kneser-solution.       

I think this is not "nitpicking" but helpful for the readers, not falsely to assume they would "stand on the shoulders of giants" when they derive conclusions and lemmas and theorems based on  the found values...              

Gottfried

A little bit of a sidebar, it would appear the only computation method that is solidly proven would be Paulsen and Cowgill's algorithm, designed largely off the Kouznetsov method. It uses Kounetsov's race track method, but includes a more thorough construction of Kneser using similar ideas as Kneser and Kouznetsov. Gem of a paper. Algorithm isn't very good though, as I'd say. It's slow for something like 100 digits, is slow at discovering taylor series. And in many ways is just a contour integral, which is never efficient in programming without large amounts of speed ups.

I would argue though that Sheldon's method is proven. Him and I were working on a paper, and I devoured a lot of the insight he had on his matrix contour integration method. It's absolutely provable, it's just unwritten. Unfortunately Sheldon felt he wasn't in the mood to start writing the paper. I wouldn't write my findings without him as a co-author, but I'm very confident it wouldn't take much to turn fatou.gp into a working proof. I see how it would be proven, is what I'm trying to say. And it really only relies on a good amount of fourier analysis. It's not my cup of tea, because I hate matrices, so I'd stumble a bit with some of the proofs using matrices--but much of it is translatable to transformations of fourier series, and that's my cup of tea, lol.

The carlemann matrix approach always seemed doomed from my perspective. It's a great approximation tool (set 1000x1000 matrix rather than infinity). It reminds me too much of Heisenberg mechanics vs Schrodinger mechanics. And I'm a Schrodinger guy, lol. I just don't find it very elegant, so I don't like it. And my brain doesn't like it, because it doesn't feel intuitive to it. I can't even imagine how a construction through Carlemann would ever be provable. I imagine it would certainly work though.

The only other method which I wished was easier to show, is the beta method of reconstructing Kneser. Which appeared to be creating analytic series, and decaying to \(L,L^*\) in upper and lower half planes--real valued as well. This would be enough to confirm Kneser, per Paulsen and Cowgill. The trouble is the beta method starts getting very slow about here. And no longer has the speed it has for the Shell-thron region, so as an algorithm it's useless really, lol.

Are there any other Kneser algorithms in existence that are proven to work besides Cowgill and PAulsen's? (besides Kneser himself, that is).