相关论文: Generating functions, Fibonacci numbers and ration…

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

In this paper we study substitutions and some of their associated generating functions. This association takes aperiodicity to transcendence, and vice-versa. These generating functions have a recursive structure arising from the…

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…

Introducing a way to modify knots using $n$-trivial rational tangles, we show that knots with given values of Vassiliev invariants of bounded degree can have arbitrary unknotting number (extending a recent result of Ohyama, Taniyama and…

This paper gives new and elementary combinatorial topological proofs of the classification of unoriented and oriented rational knots and links. These proofs are based on the known classification of alternating knots through flyping, and the…

We use combinatorial and generating function techniques to enumerate various sets of involutions which avoid 231 or contain 231 exactly once. Interestingly, many of these enumerations can be given in terms of $k$-generalized Fibonacci…

The binomial convolution of two sequences $\{a_n\}$ and $\{b_n\}$ is the sequence whose $n$th term is $\sum_{k=0}^{n} \binom{n}{k} a_k b_{n-k}$. If $\{a_n\}$ and $\{b_n\}$ have rational generating functions then so does their binomial…

We have the generating function which determines the number of $2$-bridge knot groups admitting epimorphisms onto the knot group of a given $2$-bridge knot, in terms of crossing number. In this paper, we will refine this formula by taking…

Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…

Let A be a class of objects, equipped with an integer size such that for all n the number a(n) of objects of size n is finite. We are interested in the case where the generating fucntion sum_n a(n) t^n is rational, or more generally…

We prove that certain fibered, $-$amphicheiral knots are rationally slice. Moreover, we show that the concordance invariants $\nu^+$ and $\Upsilon(t)$ from Heegaard Floer homology vanish for a class of knots that includes rationally slice…

We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…

By investigating a recurrence relation about functions, we first give alternative proofs of various identities on Fibonacci numbers and Lucas numbers, and then, make certain well known identities visible via certain trivalent graph…

Farey sequences, Stern-Brocot sequences, the Calkin-Wilf sequences are shown to be generated via almost identical second order recurrence relations. These sequences have combinatorial, computational, and geometric applications, and are…

We continue our study on relationships between Fibonacci (Lucas) numbers and Bernoulli numbers and polynomials. The derivations of our results are based on functional equations for the respective generating functions, which in our case are…

Let X be an algebraic curve over Q and t a non-constant Q-rational function on X such that Q(t) is a proper subfield of Q(X). For every integer n pick a point P_n on X such that t(P_n)=n. We conjecture that, for large N, among the number…

In this paper, we enumerate the number of oriented rational knots and the number of oriented rational links with any given crossing number and minimum genus. This allows us to obtain a precise formula for the average minimal genus of…

By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…

Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…