中文
相关论文

相关论文: Fibonacci q-gaussian sequences

200 篇论文

In this paper, we study the binomial sum $S_{n}(q):=% \overset{n}{\underset{k=0}{\sum }}a_{k}\binom{n}{k}\left( 1-q\right) ^{k}q^{n-k}$ for a given sequence $\left( a_{n}\right) $ of real or complex numbers. We express $S_{n}(q)$ in…

数论 · 数学 2026-03-10 Laid Elkhiri , Miloud Mihoubi , Meriem Moulay

Based on a variant of Sury's polynomial identity we derive new expressions for various finite Fibonacci (Lucas) sums. We extend the results to Fibonacci and Chebyshev polynomials, and also to Horadam sequences. In addition to deriving sum…

数论 · 数学 2023-12-06 Kunle Adegoke , Robert Frontczak

For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…

组合数学 · 数学 2007-05-23 H. A. Verrill

Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial.

组合数学 · 数学 2016-05-12 Ilker Akkus

We define an overpartition analogue of Gaussian polynomials (also known as $q$-binomial coefficients) as a generating function for the number of overpartitions fitting inside the $M \times N$ rectangle. We call these new polynomials over…

组合数学 · 数学 2014-12-30 Jehanne Dousse , Byungchan Kim

In this paper, we establish a q-analog of partial fraction decomposition formula. By using formula, we develop new closed form representations of sums of q-harmonic numbers and reciprocal q-binomial coefficients. Moreover, we give explicit…

数论 · 数学 2017-10-24 Ce Xu

We study the extended Frobenius problem for sequences of the form $\{f_a+f_n\}_{n\in\mathbb{N}}$, where $\{f_n\}_{n\in\mathbb{N}}$ is the Fibonacci sequence and $f_a$ is a Fibonacci number. As a consequence, we show that the family of…

数论 · 数学 2023-05-29 Aureliano M. Robles-Pérez , José Carlos Rosales

Let $F_k$ be the $k$th Fibonacci number. Let $(G_k)_{k\in\mathbb Z}$ be any sequence obeying the recurrence relation of the Fibonacci numbers. We employ the Gerin-Ces\`aro identity and an identity of Brousseau to evaluate the following…

组合数学 · 数学 2023-10-10 Kunle Adegoke

In this paper, we study the concept of Fibonacci statistical convergence on intuitionisitic fuzzy normed space. We define the Fibonacci statistically Cauchy sequences with respect to an intuitionisitic fuzzy normed space and introduce the…

综合数学 · 数学 2018-12-31 Murat Kirişci

In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…

历史与综述 · 数学 2021-04-27 Lorenzo David

Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all…

组合数学 · 数学 2007-05-23 Helmut Prodinger

In this paper, we get the generating functions of q-Chebyshev polynomials using operator. Also considering explicit formulas of q-Chebyshev polynomials, we give new generalizations of q-Chebyshev polynomials called incomplete q-Chebyshev…

数论 · 数学 2016-03-28 Elif Ercan , Mirac Cetin Firengiz , Naim Tuglu

We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…

组合数学 · 数学 2009-06-16 Victor Reiner , Dennis Stanton

In this paper, we study the linear space of all two-sided generalized Fibonacci sequences $\{F_n\}_{n \in \mathbb{Z}}$ that satisfy the recurrence equation of order $k$: $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$. We give two types of…

数论 · 数学 2023-04-07 Martin Bunder , Joseph Tonien

Combining the derivative operator with a binomial sum from the telescoping method, we establish a family of summation formulas involving generalized harmonic numbers.

组合数学 · 数学 2012-03-14 Chuanan Wei , Qinglun Yan , Dianxuan Gong

We study three different $q$-analogues of the harmonic numbers. As applications, we present some generating functions involving number theoretical functions and give the $q$-generalization of Gosper's exponential generating function of…

组合数学 · 数学 2011-06-27 István Mező

In this paper, we consider the generalized Fibonacci quaternion which is the Horadam quaternion sequence. Then we used the Binet's formula to show some properties of the Horadam quaternion. We get some generalized identities of the Horadam…

环与代数 · 数学 2020-07-29 Gamaliel Cerda-Morales

The coefficients occurring in summation formulae of the Lubbock type are shown to be generalised Bernoulli polynomials which turn up in subdivision questions such as quantum field theory around a conical singularity and on spherical lunes.…

数值分析 · 数学 2013-08-27 J. S. Dowker

Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with…

数论 · 数学 2021-07-01 Martin Bunder , Joseph Tonien

The {\em Fibonacci cube} of dimension $n$, denoted as $\Gamma\_n$, is the subgraph of $n$-cube $Q\_n$ induced by vertices with no consecutive 1's. We study the maximum number of disjoint subgraphs in $\Gamma\_n$ isomorphic to $Q\_k$, and…

组合数学 · 数学 2015-04-06 Sylvain Gravier , Michel Mollard , Simon Spacapan , Sara Zemljic