Discussion:
Julias of first and second derivatives of Fibonacci Bonet functions
(too old to reply)
Roger Bagula
2008-11-06 17:20:13 UTC
Permalink
Picture links:
Loading Image...
Loading Image...

Functions iterated:
g[x_] = D[((1/2)(1 - Sqrt[5]))^ x + ((1/2)*(1 + Sqrt[5]))^x)/Sqrt[5],
{x, 1}]
h[x_] = D[((1/2)(1 - Sqrt[5]))^ x + ((1/2)*(1 + Sqrt[5]))^x)/Sqrt[5],
{x, 2}]

What is interesting about these functions is that:
f[x_]=((1/2)(1 - Sqrt[5]))^ x + ((1/2)*(1 + Sqrt[5]))^x)/Sqrt[5]
Gives Integers for x->Integer=Fibonacci[n]
and for two complex constants: ( second order differential form)
f[x]=a0*g[x]+b0*h[x]

The second derivative seems to have some structures
that might be zoomed in to get pretty pictures.

I hadn't thought about iterating this type of function until yesterday.
I don't remember seeing any one else doing this kind of function.
I just got these pictures this morning.
Roger Bagula
2008-11-07 16:01:40 UTC
Permalink
A Julia associate with A000213 the tribonacci numbers:

picture:
Loading Image...

The function iterated as a Julia comes originally from this Mathematica:
f[n_Integer] = Module[{a}, a[n] /. RSolve[{a[
n] == a[n - 1] + a[n - 2] + a[n - 3], a[
0] == 1, a[1] == 1.a[2] == 1}, a[n], n][[1]] // FullSimplify]
--
Respectfully, Roger L. Bagula
11759Waterhill Road, Lakeside,Ca 92040-2905,tel: 619-5610814
:http://www.geocities.com/rlbagulatftn/Index.html
alternative email: ***@sbcglobal.net
Roger Bagula
2008-11-07 18:48:53 UTC
Permalink
The function associated with the sequence A000931 Padovan or Minimal Pisot:
Picture:
Loading Image...

Mathematica:
f[n_Integer] = Module[{a}, a[n] /. RSolve[{a[
n] == a[n - 2] + a[n - 3],
a[0] == 1, a[1] == 1.a[2] == 1}, a[n], n][[1]] // FullSimplify]
Roger Bagula
2008-11-08 16:42:09 UTC
Permalink
A Google search came up with: ( which I hadn't seen before)
http://portal.acm.org/citation.cfm?id=1236013
Generalized Binet dynamics
Source Computers and Graphics archive
Volume 31 , Issue 2 (April 2007) table of contents
Pages 301-307
Year of Publication: 2007
ISSN:0097-8493
Authors
Chen Ning Faculty of Information and Control Engineering, Shenyang
Jianzhu University, Shenyang 110168, China
Clifford A. Reiter Department of Mathematics, Lafayette College,
Easton, PA 18042, USA
Publisher
Pergamon Press, Inc. Elmsford, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 0
Additional Information:

abstract references index terms collaborative colleagues
Tools and Actions: Review this Article
Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref
DOI Bookmark: 10.1016/j.cag.2006.10.001

ABSTRACT

The Binet formula provides a mechanism for the Fibonacci numbers to be
viewed as a function of a complex variable. The Binet formula may be
generalized by using other bases and multiplicative parameters that also
give functions of a complex variable. Thus, filled-in Julia sets that
exhibit escape time may be constructed. Moreover, these functions have
computable critical points and hence we can create escape time images of
the critical point based upon the underlying multiplicative parameter.
Like the classic Mandelbrot set, these parameter space images provide an
atlas of Julia sets.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the
full text article. ACM has opted to expose the complete List rather than
only correct and linked references.

[1]

Hoggatt Jr., V.E., Fibonacci and Lucas numbers. 1979. The Fibonacci
Association, Santa Clara.

[2]

Rosen, K.H., Elementary number theory and its applications. 1999. 4th
ed. Addison-Wesley, Reading, MA.

[3]

Strayer, J.K., Elementary number theory. 1993. PWS Publishing, Boston.

[4]

Reiter, C.A., Views of Fibonacci dynamics. Computers and Graphics. v28.
297-300.

[5]

Chen, N., Zhu, X.L. and Chung, K.W., M and J sets from Newton's
transformation of the transcendental mapping F(z)=ezw+c with vcps.
Computers and Graphics. v26. 371-383.

[6]

Chung, K.W., Chan, H.S.Y. and Chen, N., General Mandelbrot sets and
Julia sets with color symmetry from equivariant mappings of the modular
group. Computers and Graphics. v4. 911-918.

[7]

Robert L. Devaney, Chaos, fractals, and dynamics: computer experiments
in mathematics, Addison-Wesley Longman Publishing Co., Inc., Boston, MA,
1990

[8]

Mandlebrot, B.B., The Fractal geometry of nature. 1982. W. H. Freeman
and Company, New York.

[9]

Peitgen, H.-O., Jürgens, H. and Saupe, D., Chaos and fractals, new
frontiers of science. 1992. Springer, New York.

[10]

Peitgen, H.-O. and Richter, P.H., The beauty of fractals. 1986.
Springer, Berlin.

[11]

Devaney, R., Julia sets and bifurcation diagrams for exponential maps.
Bulletin of the American Mathematic Society. v11. 167-171.

[12]

Romera, M., Pastor, G., Alvarez, G. and Montoya, M., Growth in complex
exponential dynamics. Computers and Graphics. v24. 115-131.

[13]

Jsoftware, {http://www.jsoftware.com}.

[14]

Chen N, Reiter CA, Auxiliary materials for generalized binet dynamics,
{http://www.lafayette.edu/~reiterc/mvq/gbd/index.html}; 2005.
Post by Roger Bagula
else doing this kind of function.
I just got these pictures this morning.
Roger Bagula
2008-11-08 16:48:50 UTC
Permalink
http://www.aleph.se/andart/archives/2007/12/fibonacci_fractals_and_golden_cosmology.html
December 22, 2007
Fibonacci Fractals and Golden Cosmology

Fibonacci FractalInverted Fibonacci Fractal

Here are some Newtonmas fractals, based on the de Moivre-Binet formula
for Fibonacci numbers:

z(n+1)=(phi^n - (-phi)^n)/sqrt(5)

It has two attractors, 1 and infinity. Like sin(z), exp(z) and cosh(z)
we get a "palm frond" structure of points escaping towards infinity
along the positive or negative direction, but also small clouds not
looking too dissimilar from Julia sets from the main Mandelbrot cardioid.

I got the idea of looking at the function from seeing the paper The
Golden Section, Fibonacci series and new hyperbolic models of Nature by
Alexey Stakhov and Boris Rozin. They define hyperbolic Fibonacci sines
and cosines by analogy with the hyperbolic sine and cosine, showing a
number of nice identities.

They also unfortunately succumb to the temptation - endemic among
everybody working with the golden ratio - of assuming that these results
have some kind of cosmological significance. Yes, the golden ratio and
Fibonacci numbers are ubiquitous. But that just means that if they show
up in cosmology we should be unsurprised. But I have no doubt that some
people would reject a cosmological or fundamental physics theory because
it involved a rare or "boring" constant like 4/5 or 17. Or maybe one
could make a maximum entropy argument, and claim that the most a priori
likely theory has the most a priori likely component constants?
Posted by Anders3 at December 22, 2007 01:38 PM
Roger Bagula
2008-11-08 16:52:36 UTC
Permalink
http://siliconinvestor.advfn.com/readmsg.aspx?msgid=24152803

The simplest common denominator of Reality is motion.

...................When nothing moves
.............................There is something,
...................Which evolves to
.............................Everything.

Genius lies in the
originality
and simplicity of
salient ideas.
The pluperfect beauty of powerful simplicity,
in the formulae of Unimetry's complexity,
reinforces the fundamental concepts of
Conceptualism.

Unimetry is the geometry of the Universe

Conceptualism is a total,
belief system that requires
only a minuscule of faith that
there is hyper-relativistic,
complex, oscillating motion
between the dualities of Infinity,
that manifests as all phenomena

I have deep faith that
the principle of the
universe will be
beautiful and simple.
.....-Albert Einstein

Any intelligent fool can
make things bigger and
more complex...
It takes a touch of genius
--- and a lot of courage
to move in the
opposite direction.
.....-Albert Einstein


Views of Fibonacci Dynamics
http://library.thinkquest.org/27890/applications5.html

Clifford A. Reiter
Department of Mathematics, Lafayette College, Easton, PA 18042 USA
Preprint: to appear in Computers & Graphics

Abstract
The Binet formula gives a natural way for Fibonacci numbers to be viewed
as a function
of a complex variable. We experimentally study the complex dynamics of
the Fibonacci
numbers viewed in that manner. Attracting and repelling fixed points are
related to the
filled Julia set and to regions of escape time images with fascinating
behavior.

Introduction
The Fibonacci numbers are traditionally described as a sequence Fn
defined by F0 = 0 ,
1 1 F = , and -1 -2 = + n n n F F F . The sequence begins
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,....
The Fibonacci sequence has many remarkable properties, ranging from
routine to
startling [1-4]. Moreover, the numbers arise in nature, for example, as
the number of
spirals of pinecone petals. They may also be used to construct
mathematical quasicrystals
[5].

One of the beautiful formulas of Fibonacci numbers is the Binet formula.
Binet
described a version of the formula in 1843 [6-7]. Its beauty arises from
the fact that the
formula gives a closed form solution to a recursive definition, and from
the symmetry of
the formula itself. The Binet formula my be derived from the theory of
difference
equations, it can be derived by diagonalizing a suitable matrix, or it
can be proven by
induction [1-3]. The Fibonacci recursion has characteristic equation x2
- x -1 = 0 which
has roots 1.618

2
t = 1+ 5 ˜ and -0.618
2
t = 1- 5 ˜ where t is the golden ratio and t
is the conjugate of t . Choosing constants to satisfy the initial
conditions 0 0 F = and
1 1 F = gives the Binet formula:
5
n n
n F = t - t . To obtain the Fibonacci numbers as a
function of a complex variable, instead of viewing the index n in the
Binet formula as an
integer, we view it as a complex variable z. Thus we define the
following complex
Fibonacci function.
5
( )
z z
F z = t - t

The number t is negative and t appears as the base of an exponential in
the Binet
formula. Thus, complex numbers will result for fractional real
arguments. Nonetheless,
the Binet form gives a natural generalization of the Fibonacci sequence.
It satisfies the
initial conditions F(0) = 0 and F(1) = 1. It also satisfies the recursion
F(z) = F(z -1) + F(z - 2) and it is defined for all complex values z.
Thus, we can ask questions about the complex dynamics of this function.
What are its
fixed points? Are they attracting or repelling? What happens upon
iteration of the

2

function? In this note we take a visual look at those questions and see
that the Fibonacci
numbers have interesting and beautiful complex dynamics.

Fixed Points
The fixed points of a function F(z) are the values of z such that F(z) =
z . Table I shows
the values of the Fibonacci numbers at several integer values of z.
z -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7 8
F(z) -8 5 -3 2 -1 1 0 1 1 2 3 5 8 13 21
Table I. Values of F(z) at some integer points.
Notice that z = 0,1,5 are all fixed points. It might seem as though
there ought to be
another fixed point between -2 and -1 since F(z) changes from negative
to positive, but
remember that since the definition of F(z) involves an exponential with
a negative base,
we get complex values for F(z) at intermediate values. For example,
F(-1.5) ˜ 0.217287 - 0.920442i . There appear to be many complex fixed
points. For
example, there is a fixed point near - 2.00376 - 0.197445i .
The fixed points of F(z) correspond to the zeros of F(z) - z . If we
look at the
magnitude of F(z) - z along the real axis, we get the function shown in
Figure 1. Note
that the figure shows z = 0,1,5 are zeros and hence fixed points of F(z)
and that it
appears that there are no other real fixed points.
Figure 1. The magnitude of F(z) - z along the real axis.
The situation off the real axis can be examined by looking at a false
colored contour
plot of the magnitude of F(z) - z . Figure 2 shows such a plot where -
36 = Re(z) = 36
and - 36 = Im(z) = 36 . The lowest points are shown in black and higher
points via hues
running from red to magenta (highest). Notice there is a large black
region near the
center. There are some black regions appearing in a sequence above the
center and others
in a sequence mostly running to the upper left. This suggests that there
are infinitely
many fixed points in the complex plane in the upper left quadrant. Table
II gives the
values of F(z), its derivative, and the magnitude of that, at the fixed
points z = 0,1,5.

3

Figure 2. The magnitude of F(z) - z in the complex plane for - 36 =
Re(z), Im(z) = 36 .
z F'(z) | F'(z) |
0 0.430409-1.40496i 1.46941
1 0.215204+0.868315i 0.894586
5 2.36725+0.126685i 2.37064
Table II. Derivatives at Some Fixed Points.
The magnitude of the derivative at z = 0 and z = 5 is greater than 1.
That implies
those are repelling fixed points. However, the magnitude of the
derivative at z = 1 is less
than 1, so this is an attracting fixed point. Thus, we expect some
region around z = 1 to
not diverge to infinity, but instead, remain finite. The points in the
complex plane that are
eventually attracted to z = 1 are called the basin of attraction of z =
1. The set of points
that do not diverge to infinity are the filled Julia set. When the Julia
set is nontrivial, it
has become common view such sets with an escape time image showing how
quickly
points outside the filled Julia set get large.
Escape Time
In particular, an escape time image corresponds to some region in the
complex plane and
typically color is used to indicate the number of iterations required
before iterates get
large. Perhaps the most famous illustrations of those occur for the
famous quadratic Julia
and Mandlebrot sets, but escape time images and basins of attraction
have been utilized
to visualize the dynamics of many processes [8-13].
In order to create an escape time image of a function f (z) , one uses
an algorithm of
the following type.
• Select a maximum iteration bound, N, and a sense of unbounded, M.
• For all pixels ( j, k) corresponding to points z in a rectangular
portion of the
complex plane, do the following:
• let i = 0

4

• While z < M and i < N do
• z = f (z)
• i = i +1
end while
• If i = N , mark the pixel ( j, k) black, otherwise, mark the pixel a
hue that
corresponds to i.
end for all.
We apply this algorithm to F(z) with N = 512 and M = 1010 . Figure 3
shows the
escape time where - 6 = Re(z) = 6 and - 6 = Im(z) = 6. Red corresponds
to rapid escape
and other hues, running to magenta, correspond to slow escape. Notice
the large black
region on the right of center and many smaller regions. There are also
fans of black
regions, for example, a sequence of six of them appear to be marching
across the red
region in the lower half of that figure. A J [14] script that duplicates
the image shown in
Figure 3 is available at [15].
Figure 3. Escape time of F(z) for - 6 = Re(z), Im(z) = 6 .
Figure 4 shows the escape time where - 36 = Re(z) = 36 and - 36 = Im(z)
= 36.
Notice the huge fans in a vertical sequence and the complex array of
black regions in the
upper left portion of the image. Figure 5 gives an image centered on the
origin with width
1. Notice that there appears to be a spiral of fans, five fans per
spiral, approaching the
origin. An animation zooming toward the origin may be viewed at [15]. It
reinforces that
perception of the spiral. An animation zooming toward z = 5 may also be
viewed at [15];
it shows that the repelling fixed point appears to be on the lower right
edge of the large
fractal black region that contains z = 1.

5

Figure 4. Escape time of F(z) for - 36 = Re(z), Im(z) = 36 .
Figure 5. Escape time of F(z) for - 0.5 = Re(z), Im(z) = 0.5.
Figure 6 shows more detail of the large fan above and to the right of
the origin.
Notice the fan is a fractal array of fans and black regions. The Julia
set for this function
seems quite complicated.

6

Figure 6. Escape time of F(z) near 12 + 5i .
Conclusions
By using the Binet formula we have been able to investigate the complex
dynamics of the
Fibonacci numbers. There are integer fixed points that are associated
with a large basin of
attraction, an edge of that basin, and a spiral of fans. There are
additional complex fixed
points, and the escape time images show the Fibonacci numbers have rich
complex
dynamics.
References
[1] Hoggatt, VE. Jr. Fibonacci and Lucas Numbers. Santa Clara: The
Fibonacci Association, 1979.
[2] Rosen KH. Elementary Number Theory and its Applications, 4th
edition. Reading: Addison-Wesley,
1999.
[3] Strayer JK. Elementary Number Theory. Boston: PWS Publishing, 1993.
[4] Fibonacci Association, http://www.mscs.dal.ca/Fibonacci/
[5] Senechal M. Quasicrystals and Geometry. New York: Cambridge
University Press, 1995.
[6] Binet MJ. Mémoire sur l'intégraton des équations linéaires aux
différences finies, d'un order
quelconque, á coefficients variables. Comptes Rendus des Séances de
L'académie des Sciences, 17 (1843)
559-565.
[7] Dickson LE. History of the Theory of Numbers, vol. I, New York:
Chessea Publishing Company,
reprint 1971.
[8] Devaney R. Chaos, Fractals and Dynamics, Computer Experiments in
Mathematics. Menlo Park:
Addison-Wesley, 1990.
[9] Peitgen H-O, Jürgens H, Saupe D. Chaos and Fractals, New Frontiers
of Science. New York: Springer-
Verlag, 1992.
[10] Peitgen H-O, Richter PH. The Beauty of Fractals. Berlin:
Springer-Verlag, 1986.
[11] Pickover CA. Computers, Pattern, Chaos and Beauty. Phoenix Mill:
Alan Sutton Publishing, 1990.
[12] Reiter CA. Fractals, Visualization and J, 2nd ed. Toronto:
Jsoftware Inc, 2000.
[13] Sprott JC, Pickover CA. Automatic generation of general quadratic
map basins. Computers &
Graphics 19 (1995) 309-313.
[14] Jsoftware, http://www.jsoftware.com
[15] Reiter CA. Escape Time Zooms of the Fibonacci Numbers.
http://www.lafayette.edu/~reiterc/mvp/fib_v/index.html
ing.
Roger Bagula
2008-11-10 13:52:47 UTC
Permalink
Picture:
Loading Image...

The previous Cantor like chaotic I got had Floor[2*n/3] in it.
By using Modulo three switch I was able remove that.
They aren't entirely equivalent, but the result is of the same type.
The new sequence actually appears more chaotic.
It has the additional advantage that it doesn't continually increase,
but has a relative maximum (about 31) and minimum (about 6) and average
near 12.2348.

Mathematica:
f[0] = 0; f[1] = 1; f[2] = 1;
f[n_] := f[n] = f[f[n - 1]] + If[Mod[n, 3] == 0, f[f[n/3]], If[Mod[n, 3]
== 1, f[f[(n - 1)/3]], f[n - f[(n - 2)/3]]]];
a = Table[f[n], {n, 0, 200}]


%I A147665
%S A147665 0,1,1,2,2,3,3,3,5,4,3,6,4,3,6,5,5,9,6,5,12,6,5,15,8,8,11,8,7,11,8,7,14,
%T A147665 9,7,14,8,7,10,5,5,13,6,6,13,6,6,9,7,6,9,8,9,17,12,7,12,7,6,15,9,8,14,9,
%U A147665 7,18,9,7,12,9,9,16,10,8,14,11,11,15,11,12,13,8,10,14,9,7,15,11,12,15
%N A147665 Modulo three chaotic recursion sequence: f(n) = f(f(n - 1])) + If[Mod[n, 3] == 0, f(f(n/3)), If[Mod[n, 3] == 1, f(f((n - 1)/3)), f(n - f((n - 2)/3)]]].
%C A147665 A Cantor like modulo three that removes the Floor[] used in: A143089 f(n) = f(n - f(n - 1)) + f(Floor[2*n/3]). In terms of chaotic structure is seems to be better when graphed. The starting vector seems to be very important here.
%F A147665 f(n) = f(f(n - 1])) + If[Mod[n, 3] == 0, f(f(n/3)), If[Mod[n, 3] == 1, f(f((n - 1)/3)), f(n - f((n - 2)/3)]]].
%t A147665 f[0] = 0; f[1] = 1; f[2] = 1; f[n_] := f[n] = f[f[n - 1]] + If[Mod[n, 3] == 0,f[f[n/3]], If[Mod[n, 3] == 1, f[f[(n - 1)/3]], f[n - f[(n - 2)/3]]]]; a = Table[f[n], {n, 0, 200}]
%Y A147665 A004001,A140473,A143089,A143091
%K A147665 nonn
%O A147665 0,4
%A A147665 Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Nov 09 2008
--
Respectfully, Roger L. Bagula
11759Waterhill Road, Lakeside,Ca 92040-2905,tel: 619-5610814 :http://www.geocities.com/rlbagulatftn/Index.html
alternative email: ***@sbcglobal.net
Loading...