Thread Rating:
  • 1 Vote(s) - 5 Average
  • 1
  • 2
  • 3
  • 4
  • 5
One very important formula
Anybody shell know this very important formula:

where are the Bell's numbers of x-th order and . For integer x one can find them here:

This formula can be easily derived from regular teration, but has a long history dating from 1945 ( J. Ginsburg, Iterated exponentials, Scripta Math. 11 (1945), 340-353.)

It is notable that tetration and Bell's polynomials of n-th order have applications in quantum physics:
So does this give real-valued answers for real and ? How do you compute the Bell polynomial at a real or complex number ? And what is ?
Corrected the usage of r.
(11/03/2010, 12:21 AM)Ansus Wrote: where are the Bell's polynomials of x-th order.

You mean "Bell number"?
The Bell polynomials are multivariate polynomials ...

Otherwise I second the questions of Mike and add the question about convergence.
(11/03/2010, 01:03 AM)bo198214 Wrote: You mean "Bell number"?

You might be interested in my paper Bell Polynomials of Iterated Functions.
(11/03/2010, 02:27 AM)Ansus Wrote:
(11/03/2010, 01:03 AM)bo198214 Wrote: You mean "Bell number"?


So how do you extend it to real values of x, and is this solution real valued for bases ?
(11/03/2010, 03:16 AM)mike3 Wrote: So how do you extend it to real values of x, and is this solution real valued for bases ?

It is derived from regular iteration, so it diverges for higher bases, but my aim was to find an expression for tetration that does not refer to taetration itself, thus allowing to derive its properties.

David Knuth referred to the following operation calling it 'binomial convolution':

If we use such operator, we can write:

And is always 1.

Thus the result of the convolution is a polynomial of x and k of degree n-1 and we can take indefinite sum of it symbolically.

Note also that binomial convolution corresponds to the product of exponential generating functions. This means product of tetrations corresponds to binomial convolution of Bell's numbers of higher orders.


Possibly Related Threads...
Thread Author Replies Views Last Post
  There is a non recursive formula for T(x,k)? marraco 5 3,162 12/26/2020, 11:05 AM
Last Post: Gottfried
  Recursive formula generating bounded hyper-operators JmsNxn 0 3,341 01/17/2017, 05:10 AM
Last Post: JmsNxn
  Extrapolated Faá Di Bruno's Formula Xorter 1 4,557 11/19/2016, 02:37 PM
Last Post: Xorter
  Explicit formula for the tetration to base [tex]e^{1/e}[/tex]? mike3 1 5,573 02/13/2015, 02:26 PM
Last Post: Gottfried
  Number theoretic formula for hyper operators (-oo, 2] at prime numbers JmsNxn 2 6,907 07/17/2012, 02:12 AM
Last Post: JmsNxn
  fractional iteration by schröder and by binomial-formula Gottfried 0 4,059 11/23/2011, 04:45 PM
Last Post: Gottfried
  simple base conversion formula for tetration JmsNxn 0 4,779 09/22/2011, 07:41 PM
Last Post: JmsNxn
  Change of base formula using logarithmic semi operators JmsNxn 4 12,421 07/08/2011, 08:28 PM
Last Post: JmsNxn
  Breaking New Ground In The Quest For The "Analytical" Formula For Tetration. mike3 5 13,399 05/09/2011, 05:08 AM
Last Post: mike3
  Constructing the "analytical" formula for tetration. mike3 13 28,810 02/10/2011, 07:35 AM
Last Post: mike3

Users browsing this thread: 1 Guest(s)