New algebraic and geometric constructs arising from Fibonacci numbers

Fibonacci numbers are the basis of a new geometric construction that leads to the definition of a family {Cn:n∈N}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{C_n:n\in \mathbb {N}\}$$\end{document} of octagons that come very close to the regular octagon. Such octagons, in some previous articles, have been given the name of Carboncettus octagons for historical reasons. Going further, in this paper we want to introduce and investigate some algebraic constructs that arise from the family {Cn:n∈N}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{C_n:n\in \mathbb {N}\}$$\end{document} and therefore from Fibonacci numbers: From each Carboncettus octagon Cn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_n$$\end{document}, it is possible to obtain an infinite (right) word Wn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W_n$$\end{document} on the binary alphabet {0,1}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{0,1\}$$\end{document}, which we will call the nth Carboncettus word. The main theorem shows that all the Carboncettus words thus defined are Sturmian words except in the case n=5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=5$$\end{document}. The fifth Carboncettus word W5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W_5$$\end{document} is in fact the only word of the family to be purely periodic: It has period 17 and periodic factor 000 100 100 010 010 01. Finally, we also define a further word W∞\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W_{\infty }$$\end{document} named the Carboncettus limit word and, as second main result, we prove that the limit of the sequence of Carboncettus words is W∞\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$W_{\infty }$$\end{document} itself.


Introduction
In this paper, we associate with each Fibonacci number F n , n ≥ 1, a geometric construct C n and then an algebraic object W n , obtaining simultaneously three sequences {F n } n , {C n } n and {W n } n , where the first one is the well-known sequence of integers, but the last two are new sequences not of numbers but of geometrical and algebraic objects, respectively. In particular, {C n } n is a sequence of octagons very close to a regular one and {W n } n is a sequence of infinite right words on the binary alphabet {0, 1}. The reasons that led us to give them the name of Carboncettus octagons and words come, as we will see, from far away.
Prato is a Tuscan city located 17 km northwest of Florence. With its 200,000 inhabitants, Prato is the third largest city in central Italy, after Rome and Florence. The Cathedral of Prato, dedicated to the first Christian martyr Saint Stephen, is a jewel of Romanesque architecture of international appeal: It has ancient roots dating back to at least the sixth century AD and has undergone numerous renovations and modifications over the years, including, very important, those around the eleventh century. The current lateral portal of the Cathedral (Fig. 1) seems to have been the main portal at that time, and, in recent years, it has attracted the attention of various scholars, including several mathematicians, in an attempt to explain some figures inlaid in marble on the sides of the portal. It seems that on the right jamb of the portal, the regularity, symmetry and the subject of the figures recall the divine perfection and completeness, while on the left jamb, some almost regular figures seem to symbolize the limits of human nature, which is made, yes, in the likeness of God, but which is not divine, nor perfect as the divine one (for a deeper study into the rich symbolisms behind the representations on the sides of the portal, the reader can see Pirillo (2017a) and the references therein).
G. Pirillo was fascinated by this portal and its typically medieval symbolism from the first time he saw it in the 70s. Above all, the two inlays with octagonal (or apparently octagonal) symmetry placed at the top of each jamb attracted him very much. The one on the right seems to be based on a perfect regular octagon, while the one on the left seems to allude to a different geometric construction of an octagon that uses two concentric circumferences. Pirillo recently noted that if the radii of the circumferences are equal to two Fibonacci numbers with indices of the same parity and consecutive, then, by means of a simple construction that uses two pairs of parallel tangents to the internal circumference, and perpendicular to each other, one obtains an octagon that is indistinguishable from a regular one, but which is not itself perfectly regular. 1 In few words, this can be viewed as the discovery of a beautiful approximate method to construct a (not perfectly precise) regular octagon.
It is also very important to note the following fact: The Liber Abaci by Leonardo Pisano called Fibonacci, where the {F n } n series bearing his name appears for the first time, dates back to 1202 AD, while the portal of the Cathedral of Prato, for as seen today, dates back to the previous century and seems to be the work of Carboncettus Marmoriarius, very active in the twelfth century in those places. If the use of Fibonacci numbers in the architecture of the portal in Prato were to be confirmed by other studies, this would be a fact of enormous importance for two main reasons: 1 That is, a couple of Fibonacci numbers of the kind (F n , F n+2 ) gives rise to the Carboncettus octagon C n , as better explained in Sect. 2 with more geometric details. All the Carboncettus octagons are very close to a regular one, with the exception of the first three or at most four elements of the family {C n : n ∈ N} (see, for instance, Fig. 4 which displays the already not great difference between a regular octagon and C 2 ; see, moreover, Eqs. (2), (3), (4) and Table 1 which collect some metric data of these initial, "special" elements, and see Pirillo's papers (Pirillo 2017a(Pirillo , 2018 for the first observations of such a (suspected) construction by Carboncettus himself).
-This would mean that the Fibonacci numbers were known at least a few decades before 1202; 2 -The use of mathematical languages or tools in architecture to express concepts and ideas related to medieval (not only religious) symbolism seems not to have precedents before the twelfth century.
In the last two years, Pirillo has discussed many times the content of Pirillo (2017c) with the other authors of this work, and this has led to the article Caldarola et al. (2020c) on "The sequence of Carboncettus octagons." In this paper instead, the main novelty is represented by the definition of an algebraic object for each octagon C n and, hence, for each Fibonacci number F n , it is the right infinite word W n on the binary alphabet {0, 1} that will be precisely defined in Sect. 3 as a lower cutting sequence related to the extension of the height of a triangle which constitutes the octagon C n and will be named the nth Carboncettus word. Such an idea to introduce these algebraic objects follows an intuition of the first author about a peculiarity of the word W 5 as expressed in Theorem 1: All the words W n result to be Sturmian words except just in the single case W 5 where we obtain a periodic word with period 17 and periodic factor 000 100 100 010 010 01.
After the present introduction, this paper is organized into three central sections: the first two of which take up their titles from and deal with the mentioned geometric and algebraic aspects, respectively. In Sect. 2, we will introduce the geometric constructions, arising from Fibonacci numbers, that lead us to the family of Carboncettus octagons. In Sect. 3 instead, we will define, give some examples of and investigate the algebraic constructs obtained through the {C n } n family from the Fibonacci series as well: They are the Carboncettus words W n , and Theorem 1, mentioned above, states our first main result on them. Finally, in Sect. 4 we will introduce the Carboncettus limit word W ∞ and, as second main result of the paper, we will prove in Theorem 2 that the limit of the sequence of Carboncettus words is the Carboncettus limit word.
We inform the reader that we have tried to make this text self-contained and therefore suitable for reading even by Fig. 1 The side portal of the Cathedral of Prato, dating back to the twelfth century AD. The comparison between the two tarsias located at the top of the jambs inspired the (hypothesis on the) construction of the Carboncettus octagon those who are not specialists in the field. Only in the proof of Theorem 1, in fact, we do use three results that are not proven here.
As for notations, we use N for the set of positive integers and N 0 for N ∪ {0}. A sequence is denoted by {a n } n∈N , {a n } n , or sometimes simply {a n }. If A, B, C are three points on the plane, we let AB denote the line segment with endpoints A, B, by |AB| its length and by ABC the measure (in radians or degrees) of the angle with vertex in B. 3 3 We follow the usual convention of plane geometry that 0 ≤ ABC = C B A ≤ π is always meant.

New geometric constructions from Fibonacci numbers: the Carboncettus family of octagons
We recall that Fibonacci numbers are defined by F 0 := 0, F 1 := 1, and for all n ∈ N, n ≥ 2; in this way, we obtain the well-known sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, etc. For every real number r > 0, we let Γ r denote the circumference in the plane R 2 , centered at the origin and with radius r . For every n ∈ N, we consider the couple of Fibonacci numbers (F n , F n+2 ) and the circumferences Γ F n , Γ F n+2 , with radii F n and F n+2 , respectively. In the following, we will often refer to Γ F n as the internal circumference and to Γ F n+2 as the external one. When n = 1, Γ F 1 = Γ 1 and Γ F 3 = Γ 2 appear in green in Fig. 2, instead Fig. 3 depicts the case for general n ≥ 1. We then draw a pair of horizontal tangents to the internal circumference Γ F n through the two intersection points with the y-axis and a pair of vertical tangents through the two intersection points with the x-axis. These four straight lines, pairwise parallel or orthogonal, intersect the external circumference Γ F n+2 at eight points that we denote, starting from the first quadrant and proceeding counterclockwise, by B n , D n , E n , I n , J n , P n , Q n , A n (Fig. 3). The nth Carboncettus octagon, denoted by C n (n ≥ 1), is the one obtained by drawing the polygonal through the points and it is represented in red in Fig. 3.

Remark 1
Every Carboncettus octagon C n is obviously a cyclic polygon, that is, a polygon whose vertices all lie on the same circumference. But not only, C n is, more precisely, an isogonal octagon for all n ≥ 1. An isogonal or vertextransitive polygon is a polygon whose symmetry group acts transitively on the set of all its vertices. Therefore, an isogonal polygon is equiangular, cyclic and has at most two different alternating side lengths.
A very interesting property of the Carboncettus sequence {C n } n∈N is that all its elements, with the exception of the first three or at most the first four, are completely indistinguishable from a regular octagon. See, for instance, Fig. 4 which compares the octagon C 2 with a regular one inscribed in the same circumference Γ F 4 = Γ 3 : They are yet not too far one from the other.
Example 1 (The octagon C 1 ) The first Carboncettus octagon is obtained starting from the circumferences Γ F 1 = Γ 1 and Γ F 3 = Γ 2 (Fig. 2), and the resulting isogonal octagon C 1 has very particular characteristics. For instance, all the angles appearing in Fig. 2 are commensurable, because their measures are integer multiples of Moreover, C 1 results composed of four equilateral triangles congruent to A 1 O B 1 and four isosceles triangles congruent Fig. 3 The construction of the nth Carboncettus octagon C n for a general n ≥ 1. In the picture, to avoid small and hard to read nested subscripts, we write Γ and Γ instead of Γ Fn and Γ Fn+2 , respectively to B 1 O D 1 . The lengths of their sides and heights are and the widths of the involved angles trivially are Note, for example, that, unlike the widths of the angles, all the lengths expressed in (2) are incommensurable in pairs. Lastly, perimeter and area of C 1 are as follows: Example 2 (The octagons C 2 , C 3 and C 4 ) The construction of the second Carboncettus octagon is based on the circumferences Γ 1 and Γ 3 , whose radii are F 2 = 1 and F 4 = 3, respectively. The obtained octagon C 2 is drawn in black in Fig. 4, where it is compared with a red regular octagon inscribed in the same circumference Γ 3 . Some metric data concerning the octagon C 2 are listed in the second column of Table 1. Then, the third and the fourth column of the table do the same for the Carboncettus octagons C 3 and C 4 , respectively.
Much can be said, and there is much to study and investigate on the Carboncettus family of octagons {C n : n ∈ N}, but we will do it elsewhere because, as anticipated in the Introduction, we must now move on to the next section to introduce new algebraic constructs.

New algebraic constructs from Fibonacci numbers: the Carboncettus words W n
The main reference for the general setting of this section is Lothaire (2002), but the reader can also see Lothaire (1983) and Berstel and Perrin (2007) for an essay on the recent origin of the field called combinatorics on words.
First of all, we need to recall a generalization of (1): A sequence {G n } n∈N 0 of integers (but also real or complex num- Fig. 4 The octagon C 2 , the second element of the Carboncettus sequence, is drawn in black starting from the circumferences Γ F2 = Γ 1 and Γ F4 = Γ 3 . A regular octagon inscribed in the same circumference Γ 3 is instead represented in red bers) such that is said a generalized Fibonacci sequence, and the couple (G 0 , G 1 ) is called the seed of the sequence. For example, the generalized Fibonacci sequence with seed (2, 1) is called Lucas sequence and denoted by {L n } n∈N 0 . Hence, we have L 0 = 2, L 1 = 1, L 2 = 3, L 4 = 4, L 5 = 7, L 6 = 11, L 7 = 18, etc. Now, we begin to talk about words, i.e., finite or infinite sequences of symbols from a finite alphabet A, starting with some definitions that we need for our purposes.
Definition 1 (i) From the sequence {T n } n∈N 0 , we define an infinite word K β,ρ by writing 0 for T 0 and continuing in succession for all T n , n ≥ 1, by writing • 0 if x n ∈ Z and y n / ∈ Z; • 1 if y n ∈ Z and x n / ∈ Z; • 10 if x n ∈ Z and y n ∈ Z too. K β,ρ is called the lower cutting sequence attached to the line L.
(ii) Similarly, we define an infinite word K β,ρ called the upper cutting sequence attached to the line L, by writing 1 if y 0 ∈ Z or 0 if y 0 / ∈ Z, and continuing for all T n , n ≥ 1, by writing • 0 if x n ∈ Z and y n / ∈ Z; • 1 if y n ∈ Z and x n / ∈ Z; • 01 if x n , y n ∈ Z.
For the previous definitions, the reader can also see (Lothaire 2002, Remark 2.1.12). We now give a very easy example.
Hence, the lower cutting sequence relative to the line y = 2x/5 is an infinite periodic word with period 4 7 and periodic factor 0001001.
We are now ready to give the central definition of the section. Recalling the construction of the Carboncettus octagon C n in the previous section, let be the line through the origin and the point B n , n ≥ 1 (Fig. 3).
Definition 2 (The Carboncettus word W n ) For every n ∈ N, we set W n := K β n ,0 and we call W n the nth Carboncettus infinite word or, simply, the nth Carboncettus word.
Remark 2 Looking at Fig. 3, we can easily note that hence, 4 If the reader want to read more on the notion of period for finite and infinite word, we refer him/her to Lothaire (2002). Recall that the letters with the subscript n are displayed in the general construction of C n shown in Fig. 3 n = 2 n = 3 n = 4 Then, we can easily compute the first digits of W 1 as follows: (ii) Using (8) as before, we find 436 435 780 and, by simple computations, we get the first digits of the Carboncettus word W 3 as follows: The definition of mechanical word or mechanical sequence is similar to Definition 1. As usual, we let x and x denote, respectively, the floor and the ceiling of a real number x. Definition 3 For any α, ρ ∈ R with 0 ≤ α ≤ 1, we define two infinite words by setting s α,ρ (n) := α(n + 1) + ρ − αn + ρ and s α,ρ (n) := α(n + 1) + ρ − αn + ρ for all n ∈ N 0 . The word s α,ρ [s α,ρ , respectively] is called the lower [upper, resp.] mechanical word with slope α and intercept ρ. Moreover, a mechanical word s α,ρ or s α,ρ is said rational if α ∈ Q and irrational if α / ∈ Q.
There are several equivalent definitions of Sturmian word related to different properties, for which we refer to (Lothaire 2002, Section 2). The simplest way to define it is the following.
Definition 4 A Sturmian word is an infinite word w over an alphabet A which contains exactly n + 1 factors of length n for all n ∈ N 0 .
For instance, considering factors of length 1, the definition above implies that every Sturmian word must necessarily be over two letters of A, i.e., a binary word. The following theorem establishes which Carboncettus words are Sturmian.
Theorem 1 All Carboncettus words W n are Sturmian words except when n = 5; in this case, we have an infinite purely periodic word with period 17 and periodic factor 000 100 100 010 010 01.
Proof rom Theorem 2.1.13 of Lothaire (2002), a lower mechanical word s α,ρ is a Sturmian word if and only if it is irrational or, equivalently, if and only if the slope α is irrational. The Carboncettus word W n is equal to K β n ,0 by definition, and it is well known and easy to prove that a lower cutting sequence K β,ρ is equal to the lower mechanical word obtained by "dividing the couple (β, ρ) by β + 1," that is, in symbols K β,ρ = s β/(β+1), ρ/(β+1) (see, for instance, Lothaire 2002, Section 2.1.2). Since β/(β + 1) = 1 − 1/(β + 1), then β/(β + 1) is irrational if and only if β itself is irrational. In conclusion, we have Now, from Remark 2 we have for all n ∈ N. By an induction argument on n, it is immediate to prove that for all n ≥ 0, m ≥ 1: For this purpose, consider m ≥ 1 fixed and assume that (15) is true for n = k and n = k + 1. Adding side to side, (15) is hence true for n = k + 2, and since it trivially holds for n = 0 and n = 1, (15) is proved in general.
Therefore, (13), (16) and (17) together prove the first part of the thesis. If n = 5, we get from (8) and considering the line y = 5x/12, by some trivial computations, we conclude that W 5 = K 5/12, 0 is a purely periodic word with period 5 + 12 = 17 and periodic factor 000 100 100 010 010 01, i.e., 5 To obtain (16), the more expert reader could quickly observe that In the next example, we compute the first digits of three more words after the special case W 5 . We will also need these explicit determinations in Example 8 of the next section.
Example 6 (The words W 6 , W 7 and W 8 ) (i) Using (8), we obtain ≈ 0.412 020 962; hence, as in Example 5, we find the first 147 digits of the Carboncettus word W 6 as follows: Note that for W 8 we have written 30 more digits (177) than for the previous words: The reason for this will be clear later.

The Carboncettus limit word
If A is a finite alphabet, the set of right infinite words over A is usually denoted by A N 0 or A ω . It is equipped with a distance d defined as follows: For any belonging to A ω , we set In this way, (A ω , d) is a compact metric space (hence complete and totally bounded by a fundamental result in general topology) called the Cantor space (see Lothaire 2002, Chap. 1). From the distance defined in (23), it follows that a sequence of words {X n } n ⊂ A ω converges to Y ∈ A ω , and we write in this case, if, for every i ∈ N 0 , we have (X n ) i = Y i for all sufficiently large n, i.e., greater than some ν(i). In agreement with (22), the previous notations (X n ) i and Y i obviously indicate the letter of the words X n and Y , respectively, associated with i. Now that we have the notations and definitions necessary for this section, let us reconsider Fibonacci numbers. Recalling that the sequence of ratios of two consecutive Fibonacci numbers {F n+1 /F n } n∈N 0 converges to the golden section φ = 1 + √ 5 2, 6 then 6 Since in the Introduction we are committed to making the paper selfcontained (with the exception of Theorem 1), we sketch here what we think is the most elementary proof of lim n→∞ F n+1 /F n = φ. Using only definition (1) and identity (26), it is in fact immediate to prove, through a trivial induction argument, that |F n+1 /F n − φ| < 1/φ n−1 for all n ≥ 1. For the inductive step note that, if n − 1 ≥ 1, then where in the last step we used the equality Recalling (8), we then define and, using (25) and (26), we obtain This leads to consider the line and to state the following: Definition 5 Similar to Definition 2, we set and we call W ∞ the Carboncettus limit word.
Footnote 6 continued where to obtain the previous inequality we used F n φ/F n−1 ≥ φ and the inductive hypothesis.
The first digits of W ∞ can be easily computed as in Examples 4, 5 and 6, getting Consider now a family, or better, a sequence of lines {L n : n ∈ N} with positive slopes in the plane R 2 , and assume that it "converges" to some line L of the form (5). Then, it is not true in general that the cutting sequence (lower or upper) attached to L n approaches the cutting sequence attached to L in the sense of the definition given in (24). And the same can be said for the slopes of a sequence of mechanical or balanced words. The following is a very simple example of what can happen.
Example 7 For any n ∈ N, consider the line through the origin of the plane. It is clear that the sequence {L n } n∈N converges (punctually) to the line L : y = 2x/5 considered in Example 3, but the sequence of words K 2/5−1/n, 0 n∈N does not converge to K 2/5, 0 shown in (6). In fact, it is simple to check that, for every n ≥ 15, the first nine digits of K 2/5−1/n, 0 are 000 100 010, hence different from the ones of K 2/5, 0 .
We are now ready to prove the main result of the section.

Theorem 2 The limit of the sequence of Carboncettus words is the Carboncettus limit word, in symbols
Proof We want to show that for each fixed i ∈ N 0 it holds for all n ∈ N large enough. Therefore, assume by reductio ad absurdum that this is not true for all i, and let j be the smallest i such that (32) is not satisfied for infinitely many n ∈ N. Then, for each positive integer m ≤ j consider the following unitary open interval β ∞ · m , β ∞ · m , and since β n → β ∞ by definition and β ∞ / ∈ Q (recall (27) and (28), resp.), then there exists ν ∈ N such that β n · m ∈ β ∞ · m , β ∞ · m for all n ≥ ν and m ≤ j. Now, recalling the definition of lower cutting sequence (see Definition 1(i)), this means that for every integer i from 0 to at least j we have (W n ) i = (W ∞ ) i for all n ≥ ν, and this contradicts our assumption.
The previous theorem claims that the sequence of words whose first elements are (9)-(12), (18) and (19)-(21) converges to (31). Using the definition of distance given in (23), it is possible to define a further sequence Example 8 Numerically, the first elements of {δ n } n are the following: as the reader can immediately verify comparing (9)-(12) and (18)-(21) with (31).

Conclusion and future work
After the introductive section, to move faster to present Carboncettus words, we have reduced to a minimum an important geometric section like the second one. In a later work (on "the Prato octagon and regularity measures for polygons," see Caldarola 2020), we will devote more space to the sequence {C n } n , studying in more depth the characteristics of its elements. For example, already in Caldarola et al. (2020c) there was mention of the existence of the "limit normalized octagon" C N ∞ , in analogy with W ∞ . Since the circumferences Γ F n and Γ F n+2 become larger and larger, C N ∞ is obtained by normalizing the radius of the internal one. Another approach to study the limit of {C n } n without carrying out normalizations, say C ∞ , is to use non-standard mathematics or a numerical system that allows calculations with infinite numbers. 7 We find it fascinating to be able to construct regular or almost regular geometric figures, by means of simple or approximate methods, such as the one shown here which uses Fibonacci numbers to obtain a family of octagons that are indistinguishable from a regular one. And this must be understood not only limited to the figures of the Euclidean plane. The interest, moreover, is undoubtedly greater if it is possible to trace ancient uses or historical foundations of approximate methods, very rare until modern times, as far as we know today.
Much work remains to be done also on the purely combinatorial-algebraic aspects highlighted here, such as the sequence of Carboncettus words and its properties, similar or derived sequences from {C n } n , the characteristics of the elements in {C n } n , etc. For example, the sequence {δ n } n defined in (33) does not decrease monotonously as it is immediately evident from (34), but it is easy to prove that the two subsequences of odd-and even-indexed terms, i.e., {δ 2n+1 } n and {δ 2n } n , respectively, are monotone (this is because they depend on the approach of the line (7) to (29) from the above and below, resp.). Thus, it seems interesting to study and compare their speeds of convergence to zero and other aspects also in perspective of the so-called unimaginable numbers.
The unimaginable numbers are numbers so large that they cannot be written through the ordinary scientific or exponential notation, but they need notational systems specifically designed for the purpose, such as Knuth up-arrow notation, Conway chained arrow notation, Steinhaus-Moser notation, Bowers's operators and others (see Caldarola et al. 2020b, d and the references therein for more details). The usual convention is that an unimaginable number is a number greater than 1 googol = 10 100 . 8 In a sequence of converging words, it often happens that the distances decrease very quickly and become very soon "unimaginably small." For instance, for the fourth element of the sequence {δ 2n } n , corresponding to the fourth line of the form (7) from the above, we already have δ 8 = d(W 8 , W ∞ ) = 2 −170 ≈ 6.682 10 52 < 1 √ 1 googol , and, more importantly, note the rapid growth of the exponents in the right column in (34). Unfortunately, however, despite various evidences, many links between combinatorics of words and unimaginable numbers remain almost unexplored nowadays, and we hope that many researchers, from different parts of the world, will soon be interested in systematically studying these fascinating topics.