ﻻ يوجد ملخص باللغة العربية
Given two variables $s$ and $t$, the associated sequence of Lucas polynomials is defined inductively by ${0}=0$, ${1}=1$, and ${n}=s{n-1}+t{n-2}$ for $nge2$. An integer (e.g., a Catalan number) defined by an expression of the form $prod_i n_i/prod_j k_j$ has a Lucas analogue obtained by replacing each factor with the corresponding Lucas polynomial. There has been interest in deciding when such expressions, which are a priori only rational functions, are actually polynomials in $s,t$. The approaches so far have been combinatorial. We introduce a powerful algebraic method for answering this question by factoring ${n}=prod_{d|n} P_d(s,t)$, where we call the polynomials $P_d(s,t)$ Lucas atoms. This permits us to show that the Lucas analogues of the Fuss-Catalan and Fuss-Narayana numbers for all irreducible Coxeter groups are polynomials in $s,t$. Using gamma expansions, a technique which has recently become popular in combinatorics and geometry, one can show that the Lucas atoms have a close relationship with cyclotomic polynomials $Phi_d(q)$. Certain results about the $Phi_d(q)$ can then be lifted to Lucas atoms. In particular, one can prove analogues of theorems of Gauss and Lucas, deduce reduction formulas, and evaluate the $P_d(s,t)$ at various specific values of the variables.
We study two types of dynamical extensions of Lucas sequences and give elliptic solutions for them. The first type concerns a level-dependent (or discrete time-dependent) version involving commuting variables. We show that a nice solution for this sy
We prove an infinite family of lacunary recurrences for the Lucas numbers using combinatorial means.
The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the q-integers [n]_q.
Let $G$ be a finite cyclic group of order $n ge 2$. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)cdot ... cdot (n_lg)$ where $gin G$ and $n_1,..., n_l in [1,ord(g)]$, and the index $ind (S)$ of $S$ is defined as the minimum of $(n_
In this note, by the umbra calculus method, the Sun and Zagiers congruences involving the Bell numbers and the derangement numbers are generalized to the polynomial cases. Some special congruences are also provided.