基于一个抽球模型的组合恒等式及组合解释

本文研究了抽球概率模型的问题.利用概率方法,获得了关于第一类Stirling数和广义可重复二项式系数的无限求和形式的组合恒等式以及有关组合解释,推广了Stirling数和二项式系数的无限求和结果.     

新型组合恒等式（一）

新型组合恒等式是研讨别开生面的几类组合孪生恒等式组的问题．本要主要研讨互逆类的组合孪生恒等式组，该类可分为多项式型、二项式定理型、指数函数型以及三角函数（或双曲函数）型等四型，一批成双出现的新结果。与许多著名数列（Ｆｉｂｏｎａｃｃｉ数列、Ｂｅｒｎｏｕｌｌｉ数、Ｅｕｌｅｒ数以及二项式定理系数数列等）有着密切关系．此外，本人还研讨了一类特殊行列式的性质及其应用。     

Riordan群的反演链及在组合和中的应用

利用函数复合关系,本文在Ｒｉｏｒｄａｎ群中引入Ｒｉｏｒｄａｎ反演链的概念及其Ｒｉｏｒ－ｄａｎ反演链存在的充要条件,给出计算组合和式的递推方法．进一步讨论了二项式系数所对应的Ｒｉｏｒｄａｎ反演链问题,建立了一个Ｒｉｏｒｄａｎ求和公式,该式蕴含了某些与Ｆｉｂｏｎａｃｃｉ数相关的恒等式在内的一系列组合恒等式     

构造组合数模型巧证组合恒等式

证明组合恒等式,一般是利用组合数的性质、数学归纳法、二项式定理等,通过一些适当的计算或化简来完成.但是,很多组合恒等式,也可直接利用组合数的意义来证明.即构造一个组合问题的模型,把等式两边看成同一组合问题的两种计算方法,由结论的唯一性,即可证明组合恒等式.例1证明:C     

二项式定理与组合恒等式

二项式定理是组合数学中一个重要的恒等式 ,即(ａ ｂ) ｎ= ｎｉ=0 Ｃｉｎａｎ -ｉｂｉ.其中Ｃｉｎ 称为二项式系数 .由于组合计数问题在数学竞赛中的重要地位 ,熟练地掌握组合数的性质 ,并能灵活地运用它们来解决各种问题 ,这对参赛选手来说 ,是十分必要的 .本文我们将介绍计算含有组合数的和式以及证明组合恒等式的一些常用方法 .例 1　证明 :Ｃ1ｎ 2Ｃ2 ｎ 3Ｃ3ｎ … ｎＣｎｎ=ｎ·2 ｎ - 1.证　注意到组合数的性质Ｃｋｎ=ｎｋＣｋ- 1ｎ - 1,∴Ｃ1ｎ =ｎＣ0 ｎ - 1,2Ｃ2 ｎ =ｎＣ1ｎ - 1,… ,ｎＣｎｎ =ｎＣｎ - 1ｎ - 1.于是　Ｃ1ｎ 2…     

与格路有关的组合恒等式

通过研究格路径的性质得到一类组合恒等式的通式,代入不同的参数给出已有的一些组合恒等式新的简洁证明,并得到一些新的组合恒等式.最后推广得到多项式系数的恒等式.     

Pascal算子矩阵在组合恒等式中的应用

定义了四种Pascal算子矩阵,给出了它们的代数性质及它们之间的关系,并且利用二项式型多项式序列、算子及哑运算得到许多组合恒等式.     

Pascal算子矩阵在组合恒等式中的应用(英文)

定义了四种Pascal算子矩阵,给出了它们的代数性质及它们之间的关系,并且利用二项式型多项式序列、算子及哑运算得到许多组合恒等式.     

关于Lucas数列同余性质的研究

将二项式系数的性质应用到Lucas数列的研究中,并结合Fibonacci数列与Lucas数列的恒等式得到几个有趣的Lucas数列的同余式.     

组合恒等式证明的几种途径

组合恒等式的证明是一种常见题型 .虽然它在近几年高考试题中出现较少 ,但在教材及参考书中却屡见不鲜 .由于它综合了二项式、组合数性质、代数恒等变形等内容 ,其技巧性强 ,解题方法独特 ,因此学生解决这类问题往往感到困难 .本文试图通过一些实例谈一谈组合恒等式证明的几种途径 .1　构造模型直接运用题设条件难以证题时 ,不妨把所考虑的问题置于某种特定背景 ,构造模型往往可得到简捷、巧妙的证明 .例 1　求证 :Ｃ0 ｍＣｒｎ Ｃ1ｍＣｒ - 1ｎ …… ＣｒｍＣ0 ｎ=Ｃｒｍ ｎ.分析　根据左式各项特征 ,构造组合模型 :甲、乙两只袋 ,甲袋…     

The Pfaff/Cauchy derivative identities and Hurwitz type extensions

More than 200 years ago, Pfaff found two generalizations of Leibniz’s rule for the nth derivative of a product of two functions. Thirty years later Cauchy found two similar identities, one equivalent to one of Pfaff’s and the other new. We give simple proofs of these little-known identities and some further history. We also give applications to Abel-Rothe type binomial identities, Lagrange’s series, and Laguerre and Jacobi polynomials. Most importantly, we give extensions that are related to the Pfaff/Cauchy theorems as Hurwitz’s generalized binomial theorems are to the Abel-Rothe identities. We apply these extensions to Laguerre and Jacobi polynomials as well. Dedicated to Dick Askey on the occasion of his 70th birthday. 2000 Mathematics Subject Classification Primary—05A19; Secondary—33C45     

On solving composite power polynomial equations

It is well known that a system of power polynomial equations can be reduced to a single-variable polynomial equation by exploiting the so-called Newton's identities. In this work, by further exploring Newton's identities, we discover a binomial decomposition rule for composite elementary symmetric polynomials. Utilizing this decomposition rule, we solve three types of systems of composite power polynomial equations by converting each type to single-variable polynomial equations that can be solved easily. For each type of system, we discuss potential applications and characterize the number of nontrivial solutions (up to permutations) and the complexity of our proposed algorithmic solution.

     

Counting hypercubes in hypercubes

Subcubes of a hypercube are counted in three different ways, yielding a new graph theory interpretation of a known combinatorial identity. From this and the binomial inversion some additional combinatorial identities related to hypercubes are obtained.     

包含幂和二项式系数倒数的等式

In this paper,we give several identities of finite sums and some infinite series involving powers and inverse of binomial coefficients,which extends the results of T.Trif.     

Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

M-bonomial coefficients and their identities

In this note, we introduce M-bonomial coefficients or (M-bonacci binomial coefficients). These are similar to the binomial and the Fibonomial (or Fibonacci–binomial) coefficients and can be displayed in a triangle similar to Pascal's triangle from which some identities become obvious.     

Graded central polynomials for the matrix algebra of order two

Let K be an infinite integral domain, and let A = M ₂(K) be the matrix algebra of order two over K. The algebra A can be given a natural -grading by assuming that the diagonal matrices are the 0-component while the off-diagonal ones form the 1-component. In this paper we study the graded identities and the graded central polynomials of A. We exhibit finite bases for these graded identities and central polynomials. It turns out that the behavior of the graded identities and central polynomials in the case under consideration is much like that in the case when K is an infinite field of characteristic 0 or p > 2. Our proofs are characteristic-free so they work when K is an infinite field, char K = 2. Thus we describe finite bases of the graded identities and graded central polynomials for M ₂(K) in this case as well. A. Krasilnikov has been partially supported by CNPq and FINATEC.     

Hypergeometric identities for 10 extended Ramanujan-type series

We prove, by the WZ-method, some hypergeometric identities which relate ten extended Ramanujan type series to simpler hypergeometric series. The identities we are going to prove are valid for all the values of a parameter a when they are convergent. Sometimes, even if they do not converge, they are valid if we consider these identities as limits.