中文
相关论文

相关论文: The logarithmic fibbinomial formula

200 篇论文

We show some applications of the formulas-as-polynomials correspondence: 1) a method for (dis)proving formula isomorphism and equivalence based on showing (in)equality; 2) a constructive analogue of the arithmetical hierarchy, based on the…

逻辑 · 数学 2019-05-21 Danko Ilik

This note gives a simple approach to q-analogues of some results associated with Abel polynomials.

组合数学 · 数学 2008-03-11 Johann Cigler

The Lemma on the Logarithmic Derivative of a meromorphic function has many applications in the study of meromorphic functions and ordinary differential equations. In this paper, a difference analogue of the Logarithmic Derivative Lemma is…

复变函数 · 数学 2007-05-23 R. G. Halburd , R. J. Korhonen

We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.

组合数学 · 数学 2021-05-21 Kunle Adegoke

By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…

组合数学 · 数学 2020-10-29 Oktay K. Pashaev , Merve Ozvatan

The paper reviews various arithmetic analogues of Hamiltonian systems and presents some new facts suggesting ways to relate/unify these examples.

数论 · 数学 2018-05-25 Alexandru Buium

In this paper we evaluate sums and integrals of products of Fubini polynomials and have new explicit formulas for Fubini polynomials and numbers. As a consequence of these results new explicit formulas for p-Bernoulli numbers and…

经典分析与常微分方程 · 数学 2019-08-01 Levent Kargın

We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…

组合数学 · 数学 2016-09-06 Daniel E. Loeb

In this letter, we prove an inequality involving alternating binomial logarithmic sums by exploiting the variance of the logarithm of the maximum of independent and identically distributed exponential random variables. This inequality was…

概率论 · 数学 2026-03-13 Aristides V. Doumas

Powers of Fibonacci polynomials are expressed as single sums, improving on a double sum recently seen in the literature.

数论 · 数学 2021-07-29 Helmut Prodinger

In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…

组合数学 · 数学 2016-05-10 Zhumagali Shomanov

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

数论 · 数学 2022-09-20 Johann Cigler

In this note we prove an explicit binomial formula for Jack polynomials and discuss some applications of it.

q-alg · 数学 2008-02-03 Andrei Okounkov , Grigori Olshanski

In this paper we state some conjectures about q-Fibonacci polynomials which for q=1 reduce to well-known results about Fibonacci numbers and Fibonacci polynomials.

组合数学 · 数学 2008-05-06 Johann Cigler

We deliver here second new $\textit{H(x)}-binomials'$ recurrence formula, were $H(x)-binomials' $ array is appointed by $Ward-Horadam$ sequence of functions which in predominantly considered cases where chosen to be polynomials . Secondly,…

组合数学 · 数学 2015-03-17 Andrzej Krzysztof Kwasniewski

In this paper, we gave some properties of binomial coefficient.

组合数学 · 数学 2017-01-24 Daniel Yaqubi , Madjid Mirzavaziri

A sequence of coefficients that appeared in the evaluation of a rational integral has been shown to be unimodal. An alternative proof is presented.

经典分析与常微分方程 · 数学 2013-05-01 Tewodros Amdeberhan , Atul Dixit , Xiao Guan , Lin Jiu , Victor H. Moll

We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

综合数学 · 数学 2019-01-09 Kunle Adegoke , Tokunbo Omiyinka

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…

组合数学 · 数学 2009-11-18 Bruce Sagan , Carla Savage

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