English
Related papers

Related papers: Polynomial values with integer coefficients of the…

200 papers

We present several types of ordinary generating functions involving central binomial coefficients, harmonic numbers, and odd harmonic numbers. Our results complement those of Boyadzhiev from 2012 and Chen from 2016. Based on these…

Combinatorics · Mathematics 2024-01-08 Kunle Adegoke , Robert Frontczak , Taras Goy

Ozeki and Prodinger showed that the odd power sum of the first several consecutive Fibonacci numbers of even order is equal to a polynomial evaluated at certain Fibonacci number of odd order. We prove that this polynomial and its derivative…

Combinatorics · Mathematics 2015-02-12 Brian Y. Sun , Matthew H. Y. Xie , Arthur L. B. Yang

Let $C_n(q)$ be the number of ideals of codimension $n$ of $\mathbb{F}_q\left[x, y, x^{-1}, y^{-1} \right]$, where $\mathbb{F}_q$ is the finite field with $q$ elements. Kassel and Reutenauer [KasselReutenauer2015A] proved that $C_n(q)$ is a…

Number Theory · Mathematics 2023-05-03 José Manuel Rodríguez Caballero

The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study…

Number Theory · Mathematics 2021-04-19 Yilmaz Simsek

The main purpose of this paper is to construct not only generating functions of the new approach Genocchi type numbers and polynomials but also interpolation function of these numbers and polynomials which are related to a, b, c arbitrary…

Number Theory · Mathematics 2018-11-19 Burak Kurt , Yilmaz Simsek

Solutions to the random Fibonacci recurrence x_{n+1}=x_{n} + or - Bx_{n-1} decrease (increase) exponentially, x_{n} = exp(lambda n), for sufficiently small (large) B. In the limits B --> 0 and B --> infinity, we expand the Lyapunov exponent…

Statistical Mechanics · Physics 2009-11-07 Clément Sire , Paul L. Krapivsky

In this paper we study the sum $$\sum_{j_1+j_2+...+j_d=n}\prod_{i=1}^d F_{k\cdot j_i},$$ where $d\geq2$ and $k\geq1$.

Combinatorics · Mathematics 2007-05-23 Toufik Mansour

Let $F_n$ be the $n$th Fibonacci number. Let $m, n$ be positive integers. Define a sequence $(G(k,n,m))_{k\geq 1}$ by $G(1,n,m) = F^m_n$, and $G(k+1,n,m) = F_{nG(k,n,m)}$ for all $k\geq 1$. We show that $F_n^{k+m-1}\mid G(k,n,m)$ for all…

Number Theory · Mathematics 2014-05-29 Kritkajohn Onphaeng , Prapanpong Pongsriiam

Convolutions for Tribonacci numbers involving binomial coefficients are treated with ordinary generating functions and the diagonalization method of Hautus and Klarner. In this way, the relevant generating function can be established, which…

Number Theory · Mathematics 2019-10-21 Helmut Prodinger

We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…

Number Theory · Mathematics 2021-02-22 Kevin Hare , J. C. Saunders

The subject of this paper are polynomials in multiple non-commuting variables. For polynomials of this type orthogonal with respect to a state, we prove a Favard-type recursion relation. On the other hand, free Sheffer polynomials are a…

Combinatorics · Mathematics 2008-07-15 Michael Anshelevich

About four centuries ago, Johann Faulhaber developed formulas for the power sum $1^n + 2^n + \cdots + m^n$ in terms of $m(m+1)/2$. The resulting polynomials are called the Faulhaber polynomials. We first give a short survey of Faulhaber's…

Number Theory · Mathematics 2023-10-17 Bernd C. Kellner

We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer…

Combinatorics · Mathematics 2022-07-18 Sergey Kirgizov

Let $F=\mathbb{F}_q(T)$ be the field of rational functions with $\mathbb{F}_q$-coefficients, and $A=\mathbb{F}_q[T]$ be the subring of polynomials. Let $D$ be a division quaternion algebra over $F$ which is split at $1/T$. Given an…

Number Theory · Mathematics 2010-06-17 Mihran Papikian

In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…

Mathematical Physics · Physics 2015-06-04 H. Bergeron , E. M. F. Curado , J. P. Gazeau , Ligia M. C. S. Rodrigues

For any sequences $\mathbf{u}=\{u(n)\}_{n\geq0}, \mathbf{v}=\{v(n)\}_{n\geq0},$ we define $\mathbf{u}\mathbf{v}:=\{u(n)v(n)\}_{n\geq0}$ and $\mathbf{u}+\mathbf{v}:=\{u(n)+v(n)\}_{n\geq0}$. Let $f_i(x)~(0\leq i< k)$ be sequence polynomials…

Number Theory · Mathematics 2018-06-25 Ying-Jun Guo

We study the p-rationality of real quadratic fields in terms of generalized Fibonacci numbers and their periods modulo positive integers.

Number Theory · Mathematics 2019-02-14 Zakariae Bouazzaoui

We study sums of powers of Fibonacci and Lucas polynomials of the form $% \sum_{n=0}^{q}F_{tsn}^{k}(x) $ and $\sum_{n=0}^{q}L_{tsn}^{k}% (x) $, where $s,t,k$ are given natural numbers, together with the corresponding alternating sums…

Combinatorics · Mathematics 2013-03-07 Claudio de Jesus Pita Ruiz Velasco

We generalize generating functions for hypergeometric orthogonal polynomials, namely Jacobi, Gegenbauer, Laguerre, and Wilson polynomials. These generalizations of generating functions are accomplished through series rearrangement using…

Classical Analysis and ODEs · Mathematics 2013-02-12 Howard S. Cohl , Connor MacKenzie , Hans Volkmer

In this note, we present a simple summation formula for $k$-bonacci numbers. The derivation consists in obtaining the generating function of such numbers, and noting that its evaluation at a particular value yields a formula generalizing a…

Number Theory · Mathematics 2022-11-02 Jean-Christophe Pain