Related papers: On the representation of C-recursive integer seque…

Zeckendorf's theorem states that any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers; this result has been generalized to many recurrence relations, especially those arising from linear recurrences with…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

We show that the closure of the value set of a real linear recurrence sequence is the union of a countable set and a finite collection of intervals. Conversely, any finite collection of closed intervals is the closure of the value set of…

We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integer versions of these sequences,…

In this note, we establish a new closed formula for the solution of homogeneous second-order linear difference equations with constant coefficients by using matrix theory. This, in turn, gives new closed formulas concerning all sequences of…

This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomial coefficients of words and the sequence $(S(n))_{n\ge 0}$…

We prove that a real number a greater than or equal to 2 is the irrationality exponent of some computable real number if and only if a is the upper limit of a computable sequence of rational numbers. Thus, there are computable real numbers…

This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…

Linear recursions with integer coefficients, such as the one generating the Fibonacci sequence, have been intensely studied over millennia and yet still hide new mathematics. Such a recursion was used by Ap\'ery in his proof of the…

We survey and prove properties a family of recurrences bears in relation to integer representations, compositions, the Pascal triangle, sums of digits, Nim games and Beatty sequences.

The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…

Let $(X_{k})_{k\geq 1}$ and $(Y_k)_{k\geq 1}$ be the sequence of $X$ and $Y$-coordinates of the positive integer solutions $(x, y)$ of the equation $x^2 - dy^2 = t$. In this paper we completely describe those recurrence sequences such that…

For enumerative problems, i.e. computable functions f from N to Z, we define the notion of an effective (or closed) formula. It is an algorithm computing f(n) in the number of steps that is polynomial in the combined size of the input n and…

In this paper we present some results related to the problem of finding periodic representations for algebraic numbers. In particular, we analyze the problem for cubic irrationalities. We show an interesting relationship between the…

In this paper, we construct Pell matrices, analogous to Fibonacci matrices, to study algebraic properties of Pell numbers via linear algebra. This framework yields identities involving the trace, inverse, and determinant, as well as matrix…

Prunescu and Sauras-Altuzarra showed that all C-recursive sequences of natural numbers have an arithmetic div-mod representation that can be derived from their generating function. This representation consists of computing the quotient of…

A recurrence relation is said to have the Laurent property if all of its iterates are Laurent polynomials in the initial values with integer coefficients. We consider a family of nonlinear recurrences with the Laurent property, which were…

Second order recurrence relations of real numbers arise form various applications in discrete time dynamical systems as well as in the context on Markov chains. Solutions to the recurrence relations are fully defined by the first two…

It is well known that the arithmetic nature of Mills' prime-representing constant is uncertain: we do not know if Mills' constant is a rational or irrational number. In the case of other prime-representing constants, irrationality can be…

We extend our investigation of $2$-determinants, which we defined in a previous paper. For a linear homogenous recurrence of the second order, we consider relations between different sequences satisfying the same linear homogeneous…