相关论文: A note on recurrence sequences

In this paper we get two new classes of regular sequences in the polynomial ring over the field of complex numbers.

One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by the recurrence $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several generalizations of this sequence and also several interesting identities. In this…

In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…

Let G be the space of generating functions of a periodic infinite order linear recurrence. In this paper we provide an explicit procedure for computing a basis of G.

In this note, we use the method of [3] to give a simple proof of famous Witten conjecture. Combining the coefficients derived in our note and this method, we can derive more recursion formulas of Hodge integrals.

We provide a recursive construction of all the semi-Heyting algebras that can be defined on a chain with $n$ elements. This construction allows us to count them easily. We also compare the formula for the number of semi-Heyting chains thus…

A recurrence equation is a discrete integrable equation whose solutions are all periodic and the period is fixed. We show that infinitely many recurrence equations can be derived from the information about invariant varieties of periodic…

New cases of the multiplicity conjecture are considered.

This note describes a way of obtaining e that differs from the standard one. It could be used as an alternate way of showing how the value of e is obtained. No attempt is made to show the existence of the limit in the definition of e that…

Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…

In this paper we formally define the family of sequences know as "Pea Pattern". We then analyse its behaviour and conditions for fixed and periodic points. The paper ends with a list of fixed points and cycles.

We compute the limits of a class of continued radicals extending the results of a previous note in which only periodic radicals of the class were considered.

We provide a formula for the $n^{th}$ term of the $k$-generalized Fibonacci-like number sequence using the $k$-generalized Fibonacci number or $k$-nacci number, and by utilizing the newly derived formula, we show that the limit of the ratio…

Diese kurze Einfuehrung in Theorie und Berechnung linearer Rekurrenzen versucht, eine Luecke in der Literatur zu fuellen. Zu diesem Zweck sind viele ausfuehrliche Beispiele angegeben. This short introduction to theory and usage of linear…

The point of this short note concerns with two facts on the scheme of secant loci. The first one is an attempt to describe the tangent cone of these schemes globally and the second one is a comparision on the dimension of the tangent spaces…

Many integer sequences including the Catalan numbers, Motzkin numbers, and the Apr{\'e}y numbers can be expressed in the form ConstantTermOf$\left[P^nQ\right]$ for Laurent polynomials $P$ and $Q$. These are often called ``constant term…

In this paper, we investigate the generalized Pell sequence, the generalized complex Pell sequence and the generalized dual Pell sequence using the Pell numbers. We obtain special cases of these sequences. Furthermore, we give recurrence…

We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.

We study recurrence, and multiple recurrence, properties along the $k$-th powers of a given set of integers. We show that the property of recurrence for some given values of $k$ does not give any constraint on the recurrence for the other…