Tribonacci ratio

Tribonacci ratio
A tribonacci rectangle contains two scaled copies of itself, τ = ((τ − 1)2 + 2(τ − 1) + 1) / τ
Rationalityirrational algebraic
Symbolτ
Representations
Decimal1.83928675521416113255...
Algebraic formreal root of x3 = x2 + x + 1
Continued fraction (linear)[1;1,5,4,2,305,1,8,2,1,4,6,14,...] 
not periodic
infinite

In mathematics, the tribonacci ratio is a geometrical proportion, given by the unique real solution of the equation x3 = x2 + x + 1. Its decimal expansion begins with 1.839286755214161... (sequence A058265 in the OEIS).

The moniker tribonacci was introduced by high-school student Mark Feinberg in an article published in the Fibonacci Quarterly of October 1963.

Definition

τ = ⁠a+b+c/a⁠ = ⁠a/b⁠ = ⁠b/c⁠. With b = 1 the boxes have volumes τ3 = τ2 (red) + τ (green) + 1 (blue).

Three quantities a > b > c > 0 are in the tribonacci ratio if a+b+ca=ab=bc=τ This ratio is commonly denoted ⁠τ.⁠

Substituting ⁠b=τc⁠ and ⁠a=τb=τ2c⁠ in the first fraction gives τ=c(τ2+τ+1)τ2c. It follows that the tribonacci ratio is the unique real solution of the cubic equation τ3=τ2+τ+1.

Closed-form expressions for ⁠τ⁠ are found by solving the depressed cubic ⁠y3−43y−3827⁠, which has real zero ⁠τ−13⁠. w1,2=19±333τ=(1+w13+w23)/3=13+43cosh⁡(13arcosh⁡(198)).

Dividing the defining polynomial ⁠z3−z2−z−1⁠ by ⁠z−τ⁠ one obtains ⁠z2+(τ−1)z+1/τ⁠, and the conjugate elements of ⁠τ⁠ are z1,2=(1−τ±i(τ+1)(3τ−5))/2, with ⁠z1+z2=1−τ⁠ and ⁠z1z2=1/τ⁠.

Unit circle and hyperbola (x + 1) y = 1.

The point of intersection ⁠P=(x,y)⁠ with ⁠x≠0⁠ of unit circle x2+y2=1 and rectangular hyperbola y=1x+1 is ⁠(τ−1,τ−1).⁠ Substituting for ⁠y⁠, the equation of the abscissa is x3+2x2−2=0 or x2(x+2)=2.

Dividing both sides by ⁠x+2⁠ results in the fixed point iteration xn+1→22+xn, and the continued reciprocal square root τ−1=22+22+22+⋱ An image of the Julia set of the backward iteration zn−1→2zn2−2 in the complex plane is found below.

Alternative expressions for the tribonacci ratio are derived from the reciprocal equation, that is, the depressed cubic ⁠2x3−2x−1⁠ with real zero ⁠1τ−1⁠ and discriminant ⁠−44⁠. w1,2=(1±13113)/4τ=1+(w13+w23)−1=1+32sech⁡(13arcosh⁡(334)).

Additionally, 2x3=2x+1 leads to the infinite radical 1τ−1=12+12+12+⋯333

⁠1τ−1⁠ is the superstable fixed point of the Newton iteration ⁠x→(2x3+12)/(3x2−1)⁠.

Properties

Rectangles with aspect ratios ⁠1/τ−1⁠, τ, ⁠τ/τ−1⁠ tile the square.

The tribonacci ratio can be written in terms of itself as fractions τ=τ2+1τ2−1τ2=τ+1τ−1τ3=τ4+12τ4=(τ+1)32.

Similarly as the infinite geometric series τ2+12=∑n=0∞τ−nτ+12=∑n=0∞τ−2n1τ−1=∑n=0∞τ−3nτ2(τ−1)=∑n=0∞τ−4n.

For every integer ⁠n⁠ one has τn=τn−1+τn−2+τn−3=2τn−2+2τn−3+τn−4=3τn−2+τn−4+τn−6 from this an infinite number of further relations can be found. A notable example is ⁠τ+τ−3=2⁠.

Continued fraction pattern of a few low powers  τ−1=[0;1,1,5,4,2,305,1,8,2,...]≈0.5437(3157)τ0=[1]τ1=[1;1,5,4,2,305,1,8,2,1,...]≈1.8393(10356)τ2=[3;2,1,1,1,1,2,1,152,2,...]≈3.3830(15947)τ3=[6;4,2,305,1,8,2,1,4,6,...]≈6.2223(569)τ4=[11;2,4,152,1,17,1,2,2,...]≈11.4445(1039)

The tribonacci ratio is the fourth smallest cubic Pisot number. By definition of these numbers, the absolute value 1/τ of the algebraic conjugates is smaller than 1, thus powers of ⁠τ⁠ generate almost integers. For example: τ18=58034.99919... ⁠≈58035−1/1234⁠. After 18 rotation steps the phases of the inward spiraling conjugate pair – initially close to ⁠±9π/13⁠ – nearly align with the imaginary axis.

The first implied mention of the tribonacci constant was in the eleventh century, when the Persian poet and polymath Omar Khayyam found the solution ⁠10τ+1τ⁠ of the cubic x3+200x=20x2+2000 by considering the intersection of a circle and a rectangular hyperbola.

W11(x)=x3−2x2+2x−2, with real zero ω=τ+1τ=τ(τ−1), is the Weber class polynomial associated with discriminant ⁠Δ=−11⁠. Properties of the related Klein j-invariant result in near-identity ω≈(eπ−Δ+24)1/24.

Benne de Weger's example for the algebraic abc conjecture derives from the Binet-type expression for the zero element at index 52 of the Berstel sequence. The companion polynomial to the recurrence relation is x3−2x2+4x−4, with real zero α=2ττ+1.

Construction of the tribonacci ratio with compass and marked ruler. BC = τ − 1 and BD = ⁠1/τ⁠.

Argument θ=arccos⁡(12τ) satisfies 4sin⁡(3θ)−tan⁡(θ)=11, a result which is related through distance parameter z=τ(1−τ)⋅2cos⁡(2π11) to the 'miraculous' neusis construction of the hendecagon, found by Benjamin and Snyder.

The reciprocal ⁠1τ⁠ of the tribonacci ratio solves the equation 2arctan⁡(x)=arccos⁡(x). The angle is close to 1 radian. Its complement arccos⁡(τ−1)=arcsin⁡(1τ) figures in the geometric construction of the tribonacci constant found by biologist Xerardo Neira.

The tribonacci ratio is particularly important in the study of the snub cube: all its metrics can be expressed in terms of ⁠τ⁠.

Tribonacci sequence

The first muddled mention of the tribonacci sequence is in Charles Darwin's On the Origin of Species (1859), illustrating the population growth of elephants on the supposition that during their lifetime each pair of parents produces three pair of young.

The number of compositions of n − 2 into parts 1, 2 and 3 is counted by the nth tribonacci number (n > 1).

The tribonacci sequence is defined by the third-order recurrence relation Tn=Tn−1+Tn−2+Tn−3 for n>2, with initial values T0=T1=0,T2=1.

The first few terms are 0, 0, 1, 1, 2, 4, 7, 13, 24, 44, 81, 149, 274, 504, 927,... (sequence A000073 in the OEIS).
The limit ratio between consecutive terms is the tribonacci constant:limn→∞Tn+1/Tn=τ.
An alternative relation for ⁠n>3⁠ is Tn=2Tn−1−Tn−4.

The generating function of the tribonacci sequence is x21−x−x2−x3=∑n=0∞Tnxn for x<1τ

Taking the sum of the first ⁠n⁠ terms gives  12(Tn−1+Tn+1−1)=∑k=0n−1Tk

Expressing the terms as sums of binomial coefficients Tn+2=∑i=0⌊n/2⌋∑j=0i(ij)(n−i−ji)

Julia set (in black) of the map z → ⁠2/z2 ⁠ − 2 with a single attracting, real five-point limit cycle. Viewport width [−3,3], pole zp = 0. The tiny white circle is centred at repelling fixed point zf = τ − 1.

The sequence is extended to negative indices using Tn=Tn+3−Tn+2−Tn+1, obtaining (0), 1,−1, 0, 2,−3, 1, 4,−8, 5, 7,−20, 18, 9,−47,... (sequence A057597 in the OEIS).

The relationship between the negative and positive indexed segments of the sequence is given by T1−n=Tn2−Tn+1Tn−1. This reflection formula holds for all integers ⁠n⁠ and can be derived from Agronomof's identity  Tn+k=Tk+1Tn+1+(Tk+Tk−1)Tn+TkTn−1.

Powers of the tribonacci ratio can be written with tribonacci numbers as quadratic coefficients τn=τ2Tn+τ(Tn−1+Tn−2)+Tn−1, which is proved by mathematical induction on ⁠n.⁠ This relation also holds for ⁠n<0.⁠ The order of the coefficients corresponds to the bottom row of matrix ⁠Q⁠ below.

Let ⁠τ⁠ and complex conjugate pair ⁠β⁠ and ⁠γ⁠ be the zeros of polynomial ⁠f:x3−x2−x−1⁠ with discriminant ⁠−44⁠, the tribonacci numbers are then given by the Binet formula Tn+1=aτn+bβn+cγn, with real ⁠a⁠ and conjugates ⁠b⁠ and ⁠c⁠ the roots of 44y3−2y−1=0.

Since |bβn+cγn|<25, the number ⁠Tn⁠ is the nearest integer to ⁠aτn−1⁠, with ⁠n>0⁠ and coefficient a=τ2/(τ3+τ+2)= 0.3362281169949410942253629... 

The tribonacci numbers are obtained as integral powers ⁠n≥2⁠ of companion matrix ⁠Q⁠ to characteristic polynomial ⁠f⁠ with dominant eigenvalue ⁠τ⁠  Q=(111100010) By the Cayley–Hamilton theorem, Qn=(Tn+2Tn+1+TnTn+1Tn+1Tn+Tn−1TnTnTn−1+Tn−2Tn−1)

The trace of ⁠Qn⁠ gives the tribonacci-Lucas numbers 3, 1, 3, 7, 11, 21, 39, 71, 131, 241, 443, 815, 1499, 2757,... satisfying the same recurrence relation. Variously, Ln=⌊τn⌉ for n>3. (sequence A001644 in the OEIS)

These Lucas numbers have the Fermat property: if p is prime, Lp≡L1modp. The converse does not hold, but the small number of tribonacci pseudoprimes n∣(Ln−1) makes the sequence special. The only composite numbers below 107 to pass the test are n = 182, 25201, 2332, 63618, 194390, 750890, 804055, 1889041, 2487941, 3542533, 3761251, 6829689. (sequence A371805 in the OEIS)

The tribonacci word sequence on the alphabet ⁠{a,b,c}⁠ is defined by the substitution rule {a↦abb↦acc↦a With initiator ⁠w0=c⁠, the first seven words are c,a,ab,ab.ac,abac.aba,abacaba.abacab,abacabaabacab.abacabaabac For ⁠n≥3⁠, the series of words ⁠wn⁠ produced by iterating the substitution are similarly obtained by concatenating the previous three: wn=wn−1+wn−2+wn−3. The number of c, b and a's in each word is equal to successive tribonacci numbers and the word length ⁠l(wn)=Tn+2⁠. The tribonacci word sequence is the basis of the construction of the classic Rauzy fractal.

The four-number game played with sets ⁠S0⁠ of successive tribonacci numbers ⁠{Tn−3,Tn−2,Tn−1,Tn}⁠, and circular shifts or reflections thereof, results in subsequent maximum run lengths l(S0)=3⌊n−12⌋, ⁠n≥3⁠. A game of infinite length is obtained by taking real elements S0={1,τ,τ2,τ3}, given to unlimited precision.

Tribonacci spiral

Tribonacci spirals with different initial radii on a τ− rectangle.

A tribonacci spiral is a logarithmic spiral that gets wider by a factor of ⁠τ⁠ for every quarter turn. It is described by the polar equation r(θ)=aexp⁡(kθ), with initial radius ⁠a⁠ and parameter k=2πln⁡(τ).

If drawn on a tribonacci rectangle, the spiral has its pole at the foot of altitude of a triangle on the diagonal and passes through vertices of rectangles with aspect ratio ⁠τ(τ−1)⁠ which are perpendicularly aligned and successively scaled by a factor ⁠τ−1⁠. The pole of the spiral divides the main diagonal in ratio ⁠τ2⁠ and bisects the diagonal of the lower right rectangle.

See also

Solutions of equations similar to x3=x2+x+1: