相关论文: Polymatrix and generalized polynacci numbers

The generalized Fibonacci recurrence $g_n=g_{n-k}+g_{n-m}$ was recently used to demonstrate the theoretically optimal nature of limited senescence in morphologically symmetrically dividing bacteria. Here, we study this recurrence from a…

New bispectral polynomials orthogonal on a quadratic bi-lattice are obtained from a truncation of Wilson polynomials. Recurrence relation and difference equation are provided. The recurrence coefficients can be encoded in a perturbed…

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

In this paper, algorithms are developed for computing the Stirling transform and the inverse Stirling transform; specifically, we investigate a class of sequences satisfying a two-term recurrence. We derive a general identity which…

Generalized Pascal matrix whose elements are generalized binomial coefficients is included in the group of generalized Riordan arrays. There is a special set of generalized Riordan arrays defined by parameter $q$. If $q=0$, they are…

We show that certain weighted Fibonacci and Lucas series can always be expressed as linear combinations of polylogarithms. In some special cases we evaluate the series in terms of Bernoulli polynomials, making use of the connection between…

We generalize the solution of linear recurrence relations from fields to central division algebras, adapting the standard tools of companion matrices and characteristic polynomials to the non-commutative setting. We then solve linear…

We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…

We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

We prove that the m-generated Grassmann algebra can be embedded into a 2^{m-1}x2^{m-1} matrix algebra over a factor of a commutative polynomial algebra in m indeterminates. Cayley-Hamilton and standard identities for nxn matrices over the…

In this paper, we provide new applications of Fibonacci and Lucas numbers. In some circumstances, we find algebraic structures on some sets defined with these numbers, we generalize Fibonacci and Lucas numbers by using an arbitrary binary…

In this paper, as an analogue of the integer case, we study detailedly the period and the rank of the generalized Fibonacci sequence of polynomials over a finite field modulo an arbitrary polynomial. We establish some formulas to compute…

In 2016, Edgar and, independently of him, Bhatnagar sta\-ted a nice polynomial identity that connects Fibonacci and Lucas numbers. Shortly after their publications, this identity has been generalized in two different ways: Dafnis, Phillipou…

We give new identities for some symmetric polynomials. As applications of these identities, we obtain some formulas for a higher order analogue of Fibonacci and Lucas numbers.

We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…

In [Trace identities and $\bf {Z}/2\bf {Z}$-graded invariants, {\it Trans. Amer. Math. Soc. \bf309} (1988), 581--589] we generalized the first and second fundamental theorems of invariant theory from the general linear group to the general…

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…

The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent…

Based on well-known properties of Fibonacci and Lucas numbers and polynomials we give a self-contained approach to some bivariate analogs.