On a Theorem of J. Shallit Concerning Fibonacci Partitions
نویسندگان
چکیده
In this note I prove a~claim on determinants of some special tridiagonal matrices. Together with my result about Fibonacci partitions (arXiv:math/0307150), claim allows one to (slightly strengthened) Shallit's such partitions.
منابع مشابه
On a Conjecture of J. Shallit
We solve a conjecture of J. Shallit related to the automaticity function of a unary language, or equivalently to the rst occurrence function in a symbolic sequence. The answer is negative: the conjecture is false, but it can be corrected by changing the constant involved. The proof is based on a study of paths in the Rauzy graphs associated to the sequence.
متن کاملNotes on Fibonacci Partitions
Abstract. Let f1 = 1, f2 = 2, f3 = 3, f4 = 5, . . . be the sequence of Fibonacci numbers. It is well known that for any natural n there is a unique expression n = fi1 + fi2 + · · · + fiq , such that ia+1 − ia > 2 for a = 1, 2, . . . , q− 1 (Zeckendorf Theorem). By means of it we find an explicit formula for the quantity Fh(n) of partitions of n with h summands, all parts of them are the pairwis...
متن کاملFibonacci Partitions
Then f(z) is also an analytic function without zeros on compact subsets of the unit disk. We have A * ) = n o * * ) 1 = z v < °=0(4) «>1 «>0 Definition 1: Let r(#)? r^(n), r0(w) denote, respectively, the number of partitions of n into distinct parts, evenly many distinct parts, oddly many distinct parts from {un}. Let r (0) = rE(0) = l, r0(0) = 0. If an =rE(n)-rQ(n)9 then U„ is the number of pa...
متن کاملGraphs, partitions and Fibonacci numbers
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees with n edges and Fibonacci number > 2n−1 + 5 have diameter ≤ 4 and determine the order of these trees with respect to their Fibonacci numbers. Furthermore, it is shown that the average Fibonacci number of a star-like ...
متن کاملA theorem on the cores of partitions
Suppose that s, t ∈ N are relatively prime positive integers. In the study of block inclusions between sand t-blocks of partitions [4] we introduced an (s, t)-abacus to study relations between sand t-cores of partitions. This is because the cores determine the blocks. Before we state our main result let us mention that the basic facts about partitions, hooks and blocks of partitions may be foun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematics
سال: 2023
ISSN: ['2336-1298', '1804-1388']
DOI: https://doi.org/10.46298/cm.10769