中文
相关论文

相关论文: A note on some binomial sums

200 篇论文

We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example…

经典分析与常微分方程 · 数学 2023-08-17 Jing Gao , Arieh Iserles

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

Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…

组合数学 · 数学 2025-12-22 Kunle Adegoke

From an identity connecting a combinatorial sum and Legendre polynomials, we derive closed forms for a number of combinatorial sums. Some of them are obtained via results about the integrals of functions associated with Legendre…

数论 · 数学 2026-05-01 Michel Bataille , Robert Frontczak

In this note, we combine ideas of several previous proofs in order to obtain a quite short proof of Gr\"otzsch theorem.

组合数学 · 数学 2013-12-02 Zdeněk Dvořák

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

数论 · 数学 2016-11-29 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…

组合数学 · 数学 2025-11-19 Vincent Brugidou

Euler discovered recurrence for divisor sum functions as a consequence of the pentagonal numbers theorem. With similar idea and also motivated by Ewell's work in 1977, we prove new recurrences for certain divisor sum functions and…

数论 · 数学 2022-07-14 Masato Kobayashi

We provide a simple method to recognize classical orthogonal polynomials on lattices defined only by their coefficients of the three term recurrence relation.

经典分析与常微分方程 · 数学 2023-01-18 D. Mbouna

It is well known that the derangement numbers $d_n$, which count permutations of length $n$ with no fixed points, satisfy the recurrence $d_n=nd_{n-1}+(-1)^n$ for $n\ge1$. Combinatorial proofs of this formula have been given by Remmel,…

组合数学 · 数学 2020-05-25 Sergi Elizalde

In this note, we use the method of [3] to give a simple proof of famous Witten conjecture. Combining the coefficients derived in our note and this method, we can derive more recursion formulas of Hodge integrals.

代数几何 · 数学 2007-05-23 Lin Chen , Yi Li , Kefeng Liu

In this note we refine the alternativity in some bifurcation theorems of Rabinowitz type, and then improve a few of results in Lu (2022) [17].

泛函分析 · 数学 2023-09-13 Guangcun Lu

In this note, we give a simple method for computing the column sums of the Sonnenschein summability matrices.

经典分析与常微分方程 · 数学 2019-07-19 Gholamreza Talebi , Masoud Aminizadeh

In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For…

数论 · 数学 2008-07-14 Zhi-Wei Sun

A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…

组合数学 · 数学 2010-09-21 Giuseppe Scollo

We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…

组合数学 · 数学 2015-07-16 Bo Tan , Zhi-Xiong Wen , Yiping Zhang

In this note, we presented a new decomposition of elements of finite fields of even order and illustrated that it is an effective tool in evaluation of some specific exponential sums over finite fields, the explicit value of some…

组合数学 · 数学 2013-11-12 Xiwang Cao

We give a simple proof of a recently result concerning Hardy $q$-inequalities.

经典分析与常微分方程 · 数学 2014-12-18 Peng Gao

In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually…

交换代数 · 数学 2021-07-08 Vikramjeet Singh Chandel , Uma Dayal

We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…

复变函数 · 数学 2022-09-15 Abhijit Banerjee , Bikash Chakraborty