Related papers: Some Tribonacci Conjectures
In 2017, Clark Kimberling defined an interesting sequence ${\bf B} = 0100101100 \cdots$ of $0$'s and $1$'s by certain inflation rules, and he made a number of conjectures about this sequence and some related ones. In this note we prove his…
We prove a recent conjecture of Sean A. Irvine about a nonlinear recurrence, using mechanized guessing and verification. The theorem-prover Walnut plays a large role in the proof.
Recently Dekking conjectured the form of the subword complexity function for the Fibonacci-Thue-Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.
Walnut is a software that using automata can prove theorems in combinatorics on words about automatic sequences. We are able to apply this software to both prove new results as well as reprove some old results on avoiding squares and cubes…
We discuss an interesting sequence defined recursively; namely, sequence A105774 from the On-Line Encyclopedia of Integer Sequences, and study some of its properties. Our main tools are Fibonacci representation, finite automata, and the…
We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) "Tribonacci-automatic". This class includes, for example, the famous Tribonacci word T =…
The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from…
In this paper we state some conjectures about q-Fibonacci polynomials which for q=1 reduce to well-known results about Fibonacci numbers and Fibonacci polynomials.
In this note I prove a~claim on determinants of some special tridiagonal matrices. Together with my result about Fibonacci partitions (arXiv:math/0307150), this claim allows one to prove one (slightly strengthened) Shallit's result about…
Let ftm = 0111010010001... be the analogue of the Thue-Morse sequence in Fibonacci representation. In this note we show how, using the Walnut theorem-prover, to obtain a measure of its complexity, previously studied by Jamet, Popoli, and…
In this paper, we prove a few lemmas concerning Fibonacci numbers modulo primes and provide a few statements that are equivalent to Wall-Sun-Sun Prime Conjecture. Further, we investigate the conjecture through heuristic arguments and…
We prove the volume conjecture for any twist knots by using an equivalence relation, complex analysis, analytic continuation, and function of several complex variables on the basis of colored Jones polynomials.
We revisit a classic theorem of Frougny and Sakarovitch concerning automata for $\varphi$-representations, and show how to obtain it in a different and more computationally direct way. Using it, we can find simple, induction-free proofs of…
Reinhardt's conjecture, a formalization of the statement that a truthful knowing machine can know its own truthfulness and mechanicalness, was proved by Carlson using sophisticated structural results about the ordinals and transfinite…
In this paper, we give a form of refined Roth's theorem. As an application, we prove a special case of the $abc$-conjecture.
Let $D$ be any elliptic right cylinder. We prove that every type of knot can be realized as the trajectory of a ball in $D.$ This proves a conjecture of Lamm and gives a new proof of a conjecture of Jones and Przytycki. We use Jacobi's…
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…
We consider a sequence of sums of powers of the the roots of the cubic equation characterizing the Tribonacci sequences and derive its relationship with a particular Tribonacci sequence. Then we make a conjecture on the possible…
We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…
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…