There is a non recursive formula for T(x,k)? - Printable Version +- Tetration Forum ( https://math.eretrandre.org/tetrationforum)+-- Forum: Tetration and Related Topics ( https://math.eretrandre.org/tetrationforum/forumdisplay.php?fid=1)+--- Forum: Mathematical and General Discussion ( https://math.eretrandre.org/tetrationforum/forumdisplay.php?fid=3)+--- Thread: There is a non recursive formula for T(x,k)? ( /showthread.php?tid=1278) |

There is a non recursive formula for T(x,k)? - marraco - 12/17/2020
Consider the tetration of the function For a natural number n, the taylor series of that function is where is the OEIS A210725; When k<n, then, for : On the limit for , the T(n,k)=T(k,k) are the coefficients of the Lambert w function. Now, I switch the variables names, because we are interested on constant base, and variable exponent. x=b, and n=x The function T(x,k),according to OEIS is (Note that T(x,k)=1 if x=0 or k=0) So, the question is, there is an explicit, non recursive, formula for T(x,k)? We can easily replace the binomial with the Gamma function, and the recursive formula probably has a fractal structure. A fractal structure means that it can be extended to non integer values of x by using the self similarity. RE: There is a non recursive formula for T(x,k)? - marraco - 12/17/2020
An explicit formula, probably has as factor, because it looks like the Taylor series of , which is higly probable to have as factor on the k derivative Since the Taylor series is T(x,k) has to be RE: There is a non recursive formula for T(x,k)? - marraco - 12/17/2020
Because T(x,k) counts "number of forests of labeled rooted trees with x nodes and height at most k", to extend tetration to rational exponents, we need a working definition of "(rooted labeled) tree with non integer height x". Here is an example of a rooted labeled tree: The height x=4, because from the root the most distant node is 4 nodes away. (the root is also labeled 4, but that's an accident and irrelevant) So, one way we can define what is a tree with non integer height, is to allow the duplication of labels. This tree has 9 nodes wit labels {1,2,3,4,5,6,7,8,9}. If we allow duplication of labels, we will have 18 nodes labeled {1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9} We can agree that n copies of a label g cause the label to hold a weight of 1/n For example, if we allow 2 copies of each label, the former tree would have a height 2, composed of half of the nodes labeled {3,8,5,2} (I'm not sure if the root 4 should be counted) Because now we have 18 nodes, the number of forests is much larger, but we need an isomorphism (a bijection) between trees with duplicated labels, and trees with integer labels, so the count T(x,k) returns the same number of forests, for 9 integer nodes, and isomorphic trees with 18 half nodes. What we need are additional restrictions on the way trees are allowed to be made with fractional nodes, or additional rules on how to count fractional trees and forests. RE: There is a non recursive formula for T(x,k)? - Gottfried - 12/22/2020
Hi Marraco - I'm currently unable to step in, and I do not yet understood your formulae. But there is some resemblance to some investigation I did years ago, and especially the topic "labelled rooted trees" reminded me of my treatize on the tetrated pascalmatrix, and of the links to the resp. entries in OEIS. Perhaps there is something in it for you; see this Pascalmatrix tetrated Perhaps the used procedure contains a method to compute the coefficients of T(x,k)... but might come out that the explicite computation of the matrix routines are eventually recursive; I don't know at the moment. RE: There is a non recursive formula for T(x,k)? - marraco - 12/23/2020
(12/22/2020, 12:42 AM)Gottfried Wrote: Hi Marraco -Where is the problem? I can make it clearer. I edited the latex. (12/22/2020, 12:42 AM)Gottfried Wrote: Hi Marraco -I don't know what to do with it. T(x,k) appears again and again. It obviously is a central aspect of tetration. Probably the trees represent different ways to write the same tetration. The key thing we need to do is to figure what is a tree of rational height . That's the most important problem about tetration, and we only need to figure it for , or Since the forest count of trees of height h is T(h,k) Because k correspond to the derivative of on the Taylor series of that function, and also is the number of nodes k of a tree of height h, maybe the half derivative of gives us the formula for counting forests of half nodes That should give us a tip about what is a half node. What we really need to figure is what is a half height h, but figuring what is a half node should help. Now, the problem is that there are many different definitions of half derivative, and they include a constant of integration that I have no clue what to make of. The half derivative of can also be calculated using the Laplace transform. RE: There is a non recursive formula for T(x,k)? - Gottfried - 12/26/2020
(12/23/2020, 03:53 PM)marraco Wrote:(12/22/2020, 12:42 AM)Gottfried Wrote: Hi Marraco -Where is the problem? Above my shoulders... ;-) Don't have momentarily(?) the capacity to really step in and think through the material, might be depend on my age. Just thought you might be curious to see my proposals of earlier (and more active) years. Merry Xmas to all :-) Gottfried |