There is a non recursive formula for T(x,k)?
#5
(12/22/2020, 12:42 AM)Gottfried Wrote: Hi Marraco -

I'm currently unable to step in, and I do not yet understood your formulae.
Where is the problem?

I can make it clearer. I edited the latex.
(12/22/2020, 12:42 AM)Gottfried Wrote: 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.
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 \( \\[15pt]

{h \in \mathbb{Q}} \).


That's the most important problem about tetration, and we only need to figure it for \( \\[15pt]

{0<h<1} \) , or \( \\[15pt]

{1<h<2} \)

Since the forest count of trees of height h is T(h,k)
\( \frac{\mathrm{d^{ k}}(^he^x) }{\mathrm{d} x^{ k}} |_{\textbf 0}=T({h},{} k) \)

Because k correspond to the \( \\[15pt]

{k^{th}} \) derivative of \( \\[15pt]

{^he^x} \) 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 \( \\[15pt]

{^1(e^{x})} \) gives us the formula for counting forests of half nodes \( \\[15pt]

{k=0.5} \)

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 \( e^x \) can also be calculated using the Laplace transform.
I have the result, but I do not yet know how to get it.
Reply


Messages In This Thread
RE: There is a non recursive formula for T(x,k)? - by marraco - 12/23/2020, 03:53 PM

Possibly Related Threads…
Thread Author Replies Views Last Post
  f(x+y) g(f(x)f(y)) = f(x) + f(y) addition formula ? tommy1729 1 3,113 01/13/2023, 08:45 PM
Last Post: tommy1729
Question Formula for the Taylor Series for Tetration Catullus 8 13,687 06/12/2022, 07:32 AM
Last Post: JmsNxn
  Extrapolated Faá Di Bruno's Formula Xorter 1 7,858 11/19/2016, 02:37 PM
Last Post: Xorter
  Explicit formula for the tetration to base [tex]e^{1/e}[/tex]? mike3 1 9,411 02/13/2015, 02:26 PM
Last Post: Gottfried
  fractional iteration by schröder and by binomial-formula Gottfried 0 6,595 11/23/2011, 04:45 PM
Last Post: Gottfried
  simple base conversion formula for tetration JmsNxn 0 7,249 09/22/2011, 07:41 PM
Last Post: JmsNxn
  Change of base formula using logarithmic semi operators JmsNxn 4 19,556 07/08/2011, 08:28 PM
Last Post: JmsNxn
  Non-recursive coefficient formulas. Can the Riemann mapping be constructed? mike3 0 6,430 06/04/2011, 12:17 AM
Last Post: mike3
  Breaking New Ground In The Quest For The "Analytical" Formula For Tetration. mike3 5 21,375 05/09/2011, 05:08 AM
Last Post: mike3
  Constructing the "analytical" formula for tetration. mike3 13 46,772 02/10/2011, 07:35 AM
Last Post: mike3



Users browsing this thread: 1 Guest(s)