An Alternative Proof That the Fibonacci Group F(2, 9) is Infinite
نویسنده
چکیده
This note contains a report of a proof by computer that the Fibonacci group F (2; 9) is automatic. The automatic structure can be used to solve the word problem in the group. Furthermore , it can be seen directly from the word-acceptor that the group generators have infinite order, which of course implies that the group itself is infinite.
منابع مشابه
. G R ] 1 4 Ju l 1 99 5 An alternative proof that the Fibonacci group F ( 2 , 9 ) is infinite . Derek
This note contains a report of a proof by computer that the Fibonacci group F (2, 9) is automatic. The automatic structure can be used to solve the word problem in the group. Furthermore, it can be seen directly from the word-acceptor that the group generators have infinite order, which of course implies that the group itself is infinite. The Fibonnacci groups F (2, n), for integers n ≥ 2, are ...
متن کاملAn Alternative Proof That the Fibonacci Group F (2; 9) Is Innnite. the Fibonnacci Groups F(2; N), for Integers N 2, Are Deened by the Presentations
This note contains a report of a proof by computer that the Fi-bonacci group F (2; 9) is automatic. The automatic structure can be used to solve the word problem in the group. Furthermore, it can be seen directly from the word-acceptor that the group generators have innnite order, which of course implies that the group itself is innnite. They have been favourite test examples in combinatorial g...
متن کاملAn application of Fibonacci numbers into infinite Toeplitz matrices
The main purpose of this paper is to define a new regular matrix by using Fibonacci numbers and to investigate its matrix domain in the classical sequence spaces $ell _{p},ell _{infty },c$ and $c_{0}$, where $1leq p
متن کاملLINEAR EQUALITIES IN FIBONACCI NUMBERS Presented on the Occasion of Harold Stark’s 65th Birthday
We study the equation Fb = Fx(1)+F−x(3)+F−x(4)+ · · ·+F−x(m) with m ≥ 3, 0 < x(1) < b, and 0 < x(3) < x(4) < · · · < x(m). This equation naturally arises in the generalization of several problems that have appeared in The Fibonacci Quarterly in the problem sections. This equation also has intrinsic interest in its own right. The main theorem the Accident theorem–states, that under very mild con...
متن کاملSome Properties of the Fibonacci Sequence on an Infinite Alphabet
The infinite Fibonacci sequence F, which is an extension of the classic Fibonacci sequence to the infinite alphabet N, is the fixed point of the morphism φ: (2i) 7→ (2i)(2i+ 1) and (2i+ 1) 7→ (2i+ 2) for all i ∈ N. In this paper, we study the growth order and digit sum of F, and give several decompositions of F using singular words.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Experimental Mathematics
دوره 4 شماره
صفحات -
تاریخ انتشار 1995