Some results and conjectures about recurrence relations for certain sequences of binomial sums
英文摘要:
We give some results and conjectures about recurrence relations for certain sequences of binomial sums.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
Johann Cigler
We give some results and conjectures about recurrence relations for certain sequences of binomial sums.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
继续探索
We deliver here H(x)binomials recurrence formula appointed by Ward Horadam sequence of functions which in mostly considered since decades cases where chosen to be polynomials .
Recently we had derived a new type generalized binomials mixed recurrence for primordial sequence case . Here we report on this new type mixed V and U binomials recurrence in brief.
The looked for V-binomials recurrence for Lucas companion to $U_n$ sequence $V_n$ is delivered
Binomial-Eulerian polynomials were introduced by Postnikov, Reiner and Williams. In this paper, properties of the binomial-Eulerian polynomials, including recurrence relations and generating functions are studied. We present three constructive proofs of the recurrence relations for binomial-Eulerian polynomials. Moreover, we give a combinatorial interpretation of the Betti number of the complement of the k-equal real hyperplane arrangement.
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, we supply a review of selected related combinatorial interpretations of generalized binomial coefficients. We then propose also a kind of transfer of interpretation of $p,q-binomial $ coefficients onto $q-binomial$ coefficients interpretations thus bringing us back to $Gy{ö}rgy Pólya $ and Donald Ervin Knuth relevant investigation decades ago.
We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.
We present some new linear, quadratic, cubic and quartic binomial Fibonacci, Lucas and Fibonacci--Lucas summation identities.
Modifying an idea of E. Brietzke we give simple proofs for the recurrence relations of some sequences of binomial sums which have previously been obtained by other more complicated methods.
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving binomial coefficients and Fibonacci type sequences.
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.
Double sums involving binomial coefficients and special numbers
该研究提出一种初等方法处理内层为不完全二项式和的双重求和问题,并将核心恒等式应用于含调和数、Fibonacci数等多种特殊数的双重求和场景。
The main purpose of this paper is to establish some new properties of Horadam numbers in terms of binomial sums. By that, we can obtain these special numbers in a new and direct way. Moreover, some connections between Horadam and generalized Lucas numbers are revealed to get a more strong result.
Double sums associated with binomial transforms
本文针对内层为不完整二项式和的二重和展开研究,证明其与二项式变换对相关的新结果,推导了多类特殊数、多项式族相关的二重和恒等式及含双曲函数的新二重和。
In this paper we discuss a class of double sums involving ratios of binomial coefficients. The sums are of the form \[ \sum_{j=0}^{n} \sum_{i=0}^j \frac{\binom{f_1(n)}{i}}{\binom{f_2(n)}{j}}\,c^{i-j}, \] where $f_1, f_2$ are functions of $n$. Such sums appear in the analyses of the Mabinogion urn and the Ehrenfest urn in probability. Using hypergeometric functions, we are able to simplify these sums, and in some cases express them in terms of the harmonic numbers.
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
Binomial Fibonacci sums from Chebyshev polynomials
本文通过将特定二项式系数求和与切比雪夫多项式建立联系,推导出涉及斐波那契数和卢卡斯数的新型二项式和恒等式,并进一步研究组合和及其与 Chu 和 Guo 2022 年工作的联系。
Due to some results by John P. D Angelo and Dusty Grundmeier about CR- mappings the main results of my 2001 paper about recurrences for some sequences of binomial sums can be simplified.
A Formal Refutation of the Hypergeometric Parametric Extension for Reciprocal Binomial Sums
本文通过逻辑一致性检查、积分推导分析和符号计算,证明Pain提出的参数扩展在递归二项式和中的超几何闭形式表示是错误的。
Sums of products of binomial coefficients mod 2 and run length transforms of sequences
该研究推导了二项式系数乘积之和模2的递推关系,证明其生成序列为已知基本序列的游程长度变换,并给出正整数、斐波那契数等序列游程长度变换的公式。
We prove exact asymptotic expansions for the partial sums of the sequences of central binomial coefficients and Catalan numbers, $\sum_{k=0}^n \binom{2k}{k}$ and $\sum_{k=0}^n C_n$. We also obtain closed forms for the polynomials $\sum_{k=0}^{q-1}\binom{2k}{k}x^k$ and $\sum_{k=0}^{q-1}C_kx^k$ over the field of $p$ elements, where $q$ is a power of the prime $p$.
We prove that a certain family of sums of products of three binomials has alternating behavior modulo a prime $p$. To accomplish this we rewrite these sums as signed sums of products of three binomials, the better to handle $p$, and we give closed-form expressions for two related sums of signed products of three binomials.
Ismail et al. (Constr. Approx. {\bf 15} (1999) 69--81) proved the positivity of some trigonometric polynomials with single binomial coefficients. In this paper, we prove some similar results by replacing the binomial coefficients with products of two binomial coefficients.
We prove some 3-adic congruences for binomial sums, which were conjectured by Sun.
Reciprocal binomial sums via Beta integrals
本文通过Beta积分技术系统地推导了涉及二项式系数倒数的二项式和的求解方法,建立了Frisch公式等经典恒等式,并扩展到参数和,利用超几何函数获得闭式解。
We confirm several conjectures of Guo, Jouhet and Zeng concerning the factors of alternative binomials sums.
In this paper we find closed form for the generating function of powers of any non-degenerate second-order recurrence sequence, completing a study begun by Carlitz and Riordan in 1962. Moreover, we generalize a theorem of Horadam on partial sums involving such sequences. Also, we find closed forms for weighted (by binomial coefficients) partial sums of powers of any non-degenerate second-order recurrence sequences. As corollaries we give some known and seemingly unknown identities and derive some very interesting congruence relations involving Fibonacci and Lucas sequences.
Binomial sum relations involving Fibonacci and Lucas numbers
该研究探讨了含(广义)斐波那契数、卢卡斯数与不同类型二项式系数的二项式和的关联,给出多类二项式和关系并重新发现部分已作为问题提案的关系式。
In this note, we confirm two conjectural supercongruences on double sums of binomial coefficients due to El Bachraoui.
Tuenter [Fibonacci Quarterly 40 (2002), 175-180] and other authors have considered centred binomial sums of the form \[S_r(n) = \sum_k \binom{2n}{k}|n-k|^r,\] where $r$ and $n$ are non-negative integers. We consider sums of the form \[U_r(n) = \sum_k \binom{n}{k}|n/2-k|^r\] which are a generalisation of Tuenter's sums as $S_r(n) = U_r(2n)$ but $U_r(n)$ is also well-defined for odd arguments $n$. $U_r(n)$ may be interpreted as a moment of a symmetric Bernoulli random walk with $n$ steps. The form of $U_r(n)$ depends on the parities of both $r$ and $n$. In fact, $U_r(n)$ is the product of a poly…
We establish $q$-analogs for four congruences involving central binomial coefficients. The $q$-identities necessary for this purpose are shown via the $q$-WZ method.
In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$ toroidal chessboard such that no two polyominos overlap is eventually a polynomial in $n$, and that certain sets of these polynomials satisfy binomial-type recurrences. We exhibit generalizations of this theorem to higher dimensions and other lattices. Finally, we apply the techniques developed in this paper to resolve an open question about the structure of coef…
We find the joint distribution of three simple statistics on lattice paths of n upsteps and n downsteps leading to a triple sum identity for the central binomial coefficient {2n}-choose-{n}. We explain why one of the constituent double sums counts the irreducible pairs of compositions considered by Bender et al., and we evaluate some of the other sums.
By using the Rodriguez-Villegas-Mortenson supercongruences, we prove four supercongruences on sums involving binomial coefficients, which were originally conjectured by Sun. We also confirm a related conjecture of Guo on integer-valued polynomials.
We prove the divisibility conjecture on sums of even powers of $q$-binomial coefficients, which was recently proposed by Guo, Schlosser and Zudilin. Our proof relies on two $q$-harmonic series congruences due to Shi and Pan.
In this paper, we prove a divisibility result for the lacunary $q$-binomial sum $$ \sum_{k\equiv r\pmod{c}}(-1)^kq^{\binom{k}{2}}\qbinom{n}{k}{q}\qbinom{(k-r)/c}{l}{q^{c}}. $$
Periodic Weighted Sums of Binomial Coefficients
本文用初等方法建立了二项式系数与斐波那契数、卢卡斯数等之间的新旧关系。
We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are divisible by arbitrarily large powers of prime $p$.
A $q$-analogue of Boyadzhiev-Mneimneh-type binomial sums of finite multi-polylogarithms
该研究给出有限多重多重对数的Boyadzhiev-Mneimneh型二项式和的$q$-模拟公式,其$q\ o1$极限等价于Sakugawa-Seki恒等式,还给出对应柯西二项式定理的该类和的公式。
We establish a $q$-analogue of Sun--Zhao's congruence on harmonic sums. Based on this $q$-congruence and a $q$-series identity, we prove a congruence conjecture on sums of central $q$-binomial coefficients, which was recently proposed by Guo. We also deduce a $q$-analogue of a congruence due to Apagodu and Zeilberger from Guo's $q$-congruence.
With help of $q$-congruence, we prove the divisibility of some binomial sums. For example, for any integers $ρ,n\geq 2$, $$\sum_{k=0}^{n-1}(4k+1) \binom{2k}{k}^ρ\cdot (-4)^{ρ(n-1-k)} \equiv 0\pmod{2^{ρ-2}n\binom{2n}{n}}.$$
Three combinatorial sums involving central binomial coefficients
本文研究三类含中心二项式系数及不同调和数的组合和,通过分部求和建立递归式,并用第二类 Stirling 数与 r-Stirling 数给出闭合形式。
Let $(a_n)_{n\geq 0}$ be an arbitrary sequence and $(a_{\lfloor n/k \rfloor})_{n\geq 0}$ its dual floor sequence. We study infinite series and finite generalized binomial sums involving $(a_{\lfloor n/k \rfloor})_{n\geq 0}$. As applications we prove a range of new closed form expressions for Fibonacci (Lucas) series and binomial sum identities as particular cases.
Recently several authors have proved results on Ehrhart series of free sums of rational polytopes. In this note we treat these results from an algebraic viewpoint. Instead of attacking combinatorial statements directly, we derive them from structural results on affine monoids and their algebras that allow conclusions for Hilbert and Ehrhart series. We characterize when a binomial regular sequence generates a prime ideal or even normality is preserved for the residue class ring.
We provide a unified, probabilistic approach using renewal theory to derive some novel limits of sums for the normalized binomial coefficients and for the normalized Eulerian numbers. We also investigate some corresponding results for their associated distributions -- the binomial distributions for the binomial coefficients and the Irwin-Hall distributions (uniform B-splines) for the Eulerian numbers.
Multiple binomial sums
本文研究多重二项式和的生成函数有理函数积分表示,证明单变量序列为多重二项式和的充要条件,并提出判定其相等、计算递推的算法,规避离散创造性望远镜法的相关问题。
We give combinatorial proofs for some identities involving binomial sums that have no closed form.
Abstract. We generalize the $b$-ary binomial coefficients with negative entries, which is based on the generating function obtained in early work. Besides an explicit expression involving the restricted partition, several properties such as symmetry, congruence and Pascal-like recurrence are studies. Finally, we also provide two different generalizations, partially satisfying Pascal-like recurrences.
We prove that for any nonnegative integers $n$ and $r$ the binomial sum $$ \sum_{k=-n}^n\binom{2n}{n-k}k^{2r} $$ is divisible by $2^{2n-\min\{α(n),α(r)\}}$, where $α(n)$ denotes the number of 1's in the binary expansion of $n$. This confirms a recent conjecture of Guo and Zeng.
In this paper we initiate the study of products and sums divisible by central binomial coefficients. We show that 2(2n+1)binom(2n,n)| binom(6n,3n)binom(3n,n) for every n=1,2,3,... Also, for any nonnegative integers $k$ and $n$ we have $$\binom {2k}k | \binom{4n+2k+2}{2n+k+1}\binom{2n+k+1}{2k}\binom{2n-k+1}n$$ and $$\binom{2k}k | (2n+1)\binom{2n}nC_{n+k}\binom{n+k+1}{2k},$$ where $C_m$ denotes the Catalan number $\binom{2m}m/(m+1)=\binom{2m}m-\binom{2m}{m+1}$. Applying this result we obtain two sums divisible by central binomial coefficients.
We consider several families of binomial sum identities whose definition involves the absolute value function. In particular, we consider centered double sums of the form \[S_{α,β}(n) := \sum_{k,\;\ell}\binom{2n}{n+k}\binom{2n}{n+\ell} |k^α-\ell^α|^β,\] obtaining new results in the cases $α= 1, 2$. We show that there is a close connection between these double sums in the case $α=1$ and the single centered binomial sums considered by Tuenter.
In this study, we apply the binomial transforms to Tribonacci and Tribonacci-Lucas sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we illustrate the relation between these transforms by deriving new formulas.
In this paper, we confirm several conjectured congruences of Sun concerning the divisibility of binomial sums. For example, with help of a quadratic hypergeometric transformation, we prove that $$ \sum_{k=0}^{p-1}\binom{p-1}k\binom{2k}k^2\frac{P_k}{8^k}\equiv0\pmod{p^2} $$ for any prime $p\equiv 7\mod{8}$, where $P_k$ is the $k$-th Pell number. Further, we also propose three new congruences of the same type.
We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer $r$, there holds {align*} \sum_{k=0}^{n_1}ε^k (2k+1)^{2r+1}\prod_{i=1}^{m} {n_i+n_{i+1}+1\choose n_i-k} \equiv 0 \mod (n_1+n_m+1){n_1+n_m\choose n_1}, {align*} and conjecture that for any nonnegative integer $r$ and positive integer $s$ such that $r+s$ is odd, $$ \sum_{k=0}^{n}ε^k (2k+1)^{r}({2n\choose n-k}-{2n\choose n-k-1})^{s} \equiv 0 \mod{2n\choose n}, $$…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $π$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of generating series. For these generating series, we derive integral representations in terms of root-valued iterated integrals. Using substitutions, we express the interated integrals as cyclotomic harmonic polylogarithms. Finally, by applying known relations among the cyclotomic harmonic polylogarithms, we derive expressions in terms of several constants.
We give a combinatorial interpretation of a certain positivity conjecture of Chern-Schwartz-MacPherson classes, as stated by P. Aluffi and the author in a previous paper. It translates into a positivity property for a sum of p by p determinants consisting of binomial coefficients, generalizing the classical Theorem of Lindstrom-Gessel-Viennot et al. which computes these determinants in terms of non-intersecting lattice paths. We prove this conjecture for p=2,3.
Matrix products of binomial coefficients and unsigned Stirling numbers
本文研究二项式系数与无符号斯特林数构成的矩阵乘积和式,分析其闭式表达、组合解释、递推关系及多项式基变换系数意义。
In this paper, we consider two particular binomial sums \begin{align*} \sum_{k=0}^{n-1}(20k^2+8k+1){\binom{2k}{k}}^5 (-4096)^{n-k-1} \end{align*} and \begin{align*} \sum_{k=0}^{n-1}(120k^2+34k+3){\binom{2k}{k}}^4\binom{4k}{2k} 65536^{n-k-1}, \end{align*} which are inspired by two series for $\frac{1}{π^2}$ obtained by Guillera. We consider their divisibility properties and prove that they are divisible by $2n^2 \binom{2n}{n}^2$ for all integer $n\geq 2$. These divisibility properties are stronger than those divisibility results found by He, who proved the above two sums are divisible by $2n \b…
Rotation symmetric Boolean functions are invariant under circular translation of indices. These functions have very rich cryptographic properties and have been used in different cryptosystems. Recently, Thomas Cusick proved that exponential sums of rotation symmetric Boolean functions satisfy homogeneous linear recurrences with integer coefficients. In this work, a generalization of this result is proved over any Galois field. That is, exponential sums over Galois fields of rotation symmetric polynomials satisfy linear recurrences with integer coefficients. In the particular case of $\mathbb{F…
Sums of powers of binomials, their Apéry limits, and Franel's suspicions
本文显式确定了二项式系数幂和的Apéry极限,并在假设递归可通过创造性望远镜法获得的前提下,证明了关于这些序列递归阶的Franel猜想的最小阶版本。
Recurrence Relations for Some Integer Sequences Related to Ward Numbers
本文研究了与Ward数相关的整数序列,给出了Ward-Lah数、变型Ward数和二项式Ward数等多种序列的三角递推关系、水平递推关系、生成函数及高阶递推关系。
扫码添加微信好友,提出您的宝贵建议 👇
💡 备注请填写:网站反馈
发表机构由 AI 从论文文本抽取,如发现错误,欢迎反馈修正建议。