Search results for "Fibonacci"
showing 8 items of 38 documents
Binary Patterns in Infinite Binary Words
2002
In this paper we study the set P(w) of binary patterns that can occur in one infinite binary word w, comparing it with the set F(w) of factors of the word. Since the set P(w) can be considered as an extension of the set F(w), we first investigate how large is such extension, by introducing the parameter ?(w) that corresponds to the cardinality of the difference set P(w) \ F(w). Some non trivial results about such parameter are obtained in the case of the Thue-Morse and the Fibonacci words. Since, in most cases, the parameter ?(w) is infinite, we introduce the pattern complexity of w, which corresponds to the complexity of the language P(w). As a main result, we prove that there exist infini…
Recensione a: Leonardo Pisano detto il Fibonacci, Liber abaci. Il libro del calcolo, ediz. critica sotto la direzione scientifica di G. Germano. Epis…
2020
Recensione a Liber abaci di Leonardo Pisano, detto il Fibonacci (1170 ca.-1240 ca.) – com’è noto, il più importante matematico italiano del Basso Medioevo. Il Liber abaci, certamente la più significativa opera del Fibonacci e una delle più rilevanti di tutta la matematica medievale ...
Topological Minimally Entangled States via Geometric Measure
2014
Here we show how the Minimally Entangled States (MES) of a 2d system with topological order can be identified using the geometric measure of entanglement. We show this by minimizing this measure for the doubled semion, doubled Fibonacci and toric code models on a torus with non-trivial topological partitions. Our calculations are done either quasi-exactly for small system sizes, or using the tensor network approach in [R. Orus, T.-C. Wei, O. Buerschaper, A. Garcia-Saez, arXiv:1406.0585] for large sizes. As a byproduct of our methods, we see that the minimisation of the geometric entanglement can also determine the number of Abelian quasiparticle excitations in a given model. The results in …
Surfaces of minimal degree of tame representation type and mutations of Cohen–Macaulay modules
2017
We provide two examples of smooth projective surfaces of tame CM type, by showing that any parameter space of isomorphism classes of indecomposable ACM bundles with fixed rank and determinant on a rational quartic scroll in projective 5-space is either a single point or a projective line. For surfaces of minimal degree and wild CM type, we classify rigid Ulrich bundles as Fibonacci extensions. For the rational normal scrolls S(2,3) and S(3,3), a complete classification of rigid ACM bundles is given in terms of the action of the braid group in three strands.
Equivalence classes of permutations modulo excedances
2014
International audience
Gray code for compositions of n with parts 1 and p
2009
International audience
On the suffix automaton with mismatches
2007
International audience; In this paper we focus on the construction of the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of S_k in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words, and we make a conjecture on the size of the suffix automaton with mismatches.
Computational Experiments with the Roots of Fibonacci-like Polynomials as a Window to Mathematics Research
2022
Fibonacci-like polynomials, the roots of which are responsible for a cyclic behavior of orbits of a second-order two-parametric difference equation, are considered. Using Maple and Wolfram Alpha, the location of the largest and the smallest roots responsible for the cycles of period p among the roots responsible for the cycles of periods 2kp (period-doubling) and kp (period-multiplying) has been determined. These purely computational results of experimental mathematics, made possible by the use of modern digital tools, can be used as a motivation for confirmation through not-yet-developed methods of formal mathematics. peerReviewed