English
Related papers

Related papers: The Binomial Transforms of Tribonacci and Tribonac…

200 papers

In this paper, we consider several special polynomials related to associated sequences of polynomials. Finally, we give some new and interesting identities of those polynomials arising from transfer formula for the associated sequences.

Number Theory · Mathematics 2013-02-01 Taekyun Kim , Dae San Kim

In the present article we introduce three new notions which are called Gaussian Mersenne Lucas numbers, Mersenne Lucas polynomials and Gaussian Mersenne Lucas polynomials. We present and prove our exciting properties and results of them…

Number Theory · Mathematics 2023-03-08 Nabiha Saba , Ali Boussayoud

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

Mathematical Physics · Physics 2007-05-23 Mark W. Coffey

Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…

General Mathematics · Mathematics 2021-09-10 Roudy El Haddad

The following article summarizes research where theorems and their respective demonstrations are postulated based on quadratic equations with special properties given by the Pythagorean triplets and the Fibonacci sequence given the second…

General Mathematics · Mathematics 2024-06-03 Pablo José Vega Esparza

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…

History and Overview · Mathematics 2018-11-07 Bernhard Moser

Sury's 2014 proof of an identity for Fibonacci and Lucas numbers (Identity 236 of Benjamin and Quinn's 2003 book: {\em Proofs that count: The art of combinatorial proof}) has excited a lot of comment. We give an alternate, telescoping,…

Combinatorics · Mathematics 2016-08-09 Gaurav Bhatnagar

We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…

Number Theory · Mathematics 2021-06-08 Levent Kargın , Mehmet Cenkci

Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…

Combinatorics · Mathematics 2009-11-18 Bruce Sagan , Carla Savage

In this paper, using a generating function approach, we derive several new convolution sum identities involving Fibonacci m-step numbers. As special instances of the results derived herein, we will get many new and known results involving…

General Mathematics · Mathematics 2024-04-01 Robert Frontczak , Karol Gryszka

We evaluate some types of infinite series with balancing and Lucas-balancing polynomials in closed form. These evaluations will lead to some new curious series for $\pi$ involving Fibonacci and Lucas numbers. Our findings complement those…

Number Theory · Mathematics 2022-07-21 Robert Frontczak , Kalika Prasad

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…

Number Theory · Mathematics 2021-01-01 Issam Kaddoura , Bassam Mourad

We study formal power series which can be interpreted as interpolations of Fibonacci and Lucas polynomials with even (or odd) indices.

Combinatorics · Mathematics 2025-09-08 Johann Cigler

The aim of this paper is to investigate generating functions for modification of the Milne-Thomson's polynomials, which are related to the Bernoulli polynomials and the Hermite polynomials. By applying the Umbral algebra to these generating…

Classical Analysis and ODEs · Mathematics 2018-11-19 Rahime Dere , Yilmaz Simsek

We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…

Number Theory · Mathematics 2010-05-21 Akos Pinter , Volker Ziegler

In this paper, we provide some novel binomial convolution related to symmetric functions, as well as convolution sums without the binomial symbol. Moreover we give some new convolution sums of Bernoulli, Euler, and Genocchi numbers and…

Combinatorics · Mathematics 2025-04-30 Meryem Bouzeraib , Ali Boussayoud , Salah Boulaaras

Notions of the orthogonality and convolution orthogonality are explored with the use of the Kontorovich-Lebedev transform and its convolution. New classes of the corresponding orthogonal polynomials and functions are investigated. Integral…

Classical Analysis and ODEs · Mathematics 2019-09-24 Semyon Yakubovich

In this paper, we find explicit formulas for higher order derivatives of the inverse tangent function. More precisely, we study polynomials which are induced from the higher-order derivatives of arctan(x). Successively, we give generating…

Classical Analysis and ODEs · Mathematics 2017-12-12 Mohamed Amine Boutiche , Mourad Rahmani

In this paper we study substitutions and some of their associated generating functions. This association takes aperiodicity to transcendence, and vice-versa. These generating functions have a recursive structure arising from the…

Combinatorics · Mathematics 2026-05-27 Aisling Pouti , Christopher Ramsey , Nicolae Strungaru

In this paper, we study norms of circulant and $r-$circulant matrices involving harmonic Fibonacci and hyperharmonic Fibonacci numbers. We obtain inequalities by using matrix norms.

Number Theory · Mathematics 2016-03-28 Naim Tuglu , Can Kizilateş