Related papers: Information on Combinatorial Interpretation of Fib…
This paper investigates the natural density and structural relationships within Fibonacci words, the density of a Fibonacci word is $\operatorname{DF}(F_k)=n/(n+m),$ where $m$ denote the number of zeros in a Fibonacci word and $n$ denote…
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…
We look at the rate of growth of the partial quotients of the infinite continued fraction expansion of an irrational number relative to the rate of approximation of the number by its convergents. In non-generic cases the Hausdorff dimension…
This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.
The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…
By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…
We study the random Fibonacci tree, which is an infinite binary tree with non-negative integers at each node. The root consists of the number 1 with a single child, also the number 1. We define the tree recursively in the following way: if…
A numerical semigroup is an additive submonoid of the natural numbers with finite complement. The size of the complement is called the genus of the semigroup. How many numerical semigroups have genus equal to $g$? We outline Zhai's proof of…
We consider the generalized Fibonacci counting problem with rabbits that become fertile at age $f$ and die at age $d$, with $1<=f<=d$ and $d$ finite or infinite. We provide a simple proof, based exclusively on a counting argumentation, for…
A generating function for reciprocal binomial coefficients is written down, integral representations of this function are obtained, generating functions for sums of reciprocal binomial coefficients are derived, new identities are obtained,…
We investigate paths in Bernoulli's triangles, and derive several relations linking the partial sums of binomial coefficients to the Fibonacci numbers.
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
Body-mass growth is usually described by continuous models that represent the gradual increase of mass toward an adult or asymptotic value. In this work, we formulate and test an alternative description based on a Fibonacci-inspired…
In this article, we establish polynomial-growth bound for the sequence of Fourier coefficients associated to even integer weight vector-valued automorphic forms of Fuchsian groups of the first kind. At the end, their $L$-functions and…
In this paper, we study partitions of positive integers into distinct quasifibonacci numbers. A digraph and poset structure is constructed on the set of such partitions. Furthermore, we discuss the symmetric and recursive relations between…
The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…
The Fibonacci sequence is a series of positive integers in which, starting from $0$ and $1$, every number is the sum of two previous numbers, and the limiting ratio of any two consecutive numbers of this sequence is called the golden ratio.…
In this note we present examples of cumulative connection constants included new fibonomial ones. All examples posses combinatorial interpretation.
We make an asymptotic analysis via singularity analysis of generating functions of a number sequence that involves the Fibonacci numbers and generalizes the binomial coefficients.
In analogy to a concept of Fibonacci trees, we define the leaf-Fibonacci tree of size $n$ and investigate its number of nonisomorphic leaf-induced subtrees. Denote by $f_0$ the one vertex tree and $f_1$ the tree that consists of a root with…