T. Mansour
In this note we present a method for obtaining a wide class of combinatorial identities. We give several examples, in particular, based on the Gamma and Beta functions. Some of them have already been considered by previously, and other are new.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Using a probabilistic approach, we derive several interesting identities involving beta functions. Our results generalize certain well-known combinatorial identities involving binomial coefficients and gamma functions.
Given two combinatorial identities proved earlier, a new set of variations of these combinatorial identities is listed and proved with the integral representation method. Some identities from literature are shown to be special cases of these new identities.
Eight combinatorial identities are listed and proved by counting paths in the one-dimensional random walk. Four of these identities are assumed to be new.
A probability method is provided to prove three classes of combinatorial identities. The method is extremely simple, only one step after the proper probability setup.
Capelli's and Turnbull's classical identities are given elegant combinatorial proofs.
A product difference equation is proved and used for derivation by elementary methods of four combinatorial identities, eight combinatorial identities involving generalized harmonic numbers and eight combinatorial identities involving classical harmonic numbers. For the binomial coefficients the definition with gamma functions is used, thus also allowing non-integer arguments in the identities. The generalized harmonic numbers in this case are harmonic numbers with a complex offset, where the classical harmonic numbers are a special case with offset zero.
We survey combinatorial interpretations of some dozen identities for the double factorial such as, for instance, (2n-2)!! + Sum_{k=2}^{n} (2n-1)!!(2k-4)!!/(2k-1)!! = (2n-1)!!. Our methods are mostly bijective.
We naturally obtain some combinatorial identities finding the difference analogs of hyperbolic and trigonometric functions of order $n.$ In particular, we obtain the identities connected with the proved in the paper the addition formulas for these analogs.
We present here some new identities for generalizations of Fibonacci and Lucas numbers by combinatorially interpreting these numbers in terms of numbers of certain tilings of a $1 \times m$ board. As a consequence, some new interesting identities involving the ordinaries Fibonacci and Lucas numbers are derived.
We give combinatorial interpretations of several related identities associated with the names Barrucand, Strehl and Franel, including one for the Apery numbers. The combinatorial constructs employed are derangement-type card deals as introduced in a previous paper on Barrucand's identity, labeled lattice paths and, following a comment of Jeffrey Shallit, abelian words over a 3-letter alphabet.
Combinatorial proof of identities involving partitions with distinct even parts and 4-regular partitions
针对Andrews与Bachraoui用基本超几何级数证明并寻求组合解释的互异偶数部分分拆与4-正则分拆恒等式，本文通过构造双射给出组合证明。
In this paper we give combinatorial proofs of some well known identities and obtain some generalizations. We give a visual proof of a result of Chapman and Costas-Santos regarding the determinant of sum of matrices. Also we find a new identity expressing permanent of sum of matrices. Besides, we give a graphical interpretation of Newton-Girard identity.
The incomplete tribonacci polynomials, denoted by T_n^{(s)}(x), generalize the usual tribonacci polynomials T_n(x) and were introduced in [10], where several algebraic identities were shown. In this paper, we provide a combinatorial interpretation for T_n^{(s)}(x) in terms of weighted linear tilings involving three types of tiles. This allows one not only to supply combinatorial proofs of the identities for T_n^{(s)}(x) appearing in [10] but also to derive additional identities. In the final section, we provide a formula for the ordinary generating function of the sequence T_n^{(s)}(x) for a f…
We give a combinatorial proof of the first Rogers-Ramanujan identity by using two symmetries of a new generalization of Dyson's rank. These symmetries are established by direct bijections.
In this article we obtain a general polynomial identity in $k$ variables, where $k\geq 2$ is an arbitrary positive integer. We use this identity to give a closed-form expression for the entries of the powers of a $k \times k$ matrix. Finally, we use these results to derive various combinatorial identities.
Signed Counting on Restricted Partitions and Combinatorial Proofs of Three Identities
该研究受相关组合方法启发，对\(l\)-正则划分及其变体的三个恒等式给出组合证明，其中两个恒等式此前由他人通过解析方法建立，此为恒等式证明提供了新的组合证明方式。
Combinatorial Identities for Vacillating Tableaux
本文针对源自分拆代数表示论等领域的游移表计数问题展开研究，推导出了与游移表、简化游移表、极限游移表数量相关的多个组合恒等式与整数序列。
In this article we provide with combinatorial proofs of some recent identities due to Sury and McLaughlin. We show that, the solution of a general linear recurrence with constant coefficients can be interpreted as a determinant of a matrix. Also, we derive a determinantal expression of Fibonacci and Lucas numbers. We prove Binets formula for Fibonacci and Lucas numbers in a purely combinatorial way and in course of doing so, we find a determinantal identity, which we think to be new.
The restricted partitions in which the largest part is less than or equal to $N$ and the number of parts is less than or equal to $k$ were investigated by Andrews in \cite{Andrews76}. These partitions were extended recently by the author to the partitions into parts of two kinds. In this paper, we use a new class of restricted partitions into parts of two kinds to provide new combinatorial interpretations for two identities of Guo and Yang.
Combinatorial perspectives on identities for partitions with distinct even parts
本文从组合学角度研究具有不同偶数部分的划分，通过与带符号划分和双色划分的联系，获得新的划分身份，并通过双射证明解决相关组合问题。
Combinatorial Proofs for Two-Color Partition Identities Involving Overpartitions and Minimal Excludants
研究涉及超分割和最小排除数的双色分拆恒等式，通过构造显式保权双射和奇偶反转对合给出组合证明，还给出相关超分割精细化的新组合证明。
Berkovich-Uncu have recently proved a companion of the well-known Capparelli's identities as well as refinements of Savage-Sills' new little Göllnitz identities. Noticing the connection between their results and Boulet's earlier four-parameter partition generating functions, we discover a new class of partitions, called $k$-strict partitions, to generalize their results. By applying both horizontal and vertical dissections of Ferrers' diagrams with appropriate labellings, we provide a unified combinatorial treatment of their results and shed more lights on the intriguing conditions of their co…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements of the considered ordered sets might carry some additional information. In this way an analytic proof of generalized Cauchy identities from the previous work of the second author can be directly reformulated in our new language of the combinatorial calculus; furthermore the additional information carried by vertices determines uniquely the bijections present…
Recursive matrices are ubiquitous in combinatorics, which have been extensively studied. We focus on the study of the sums of $2\times 2$ minors of certain recursive matrices, the alternating sums of their $2\times 2$ minors, and the sums of their $2\times 2$ permanents. We obtain some combinatorial identities related to these sums, which generalized the work of Sun and Ma in [{\it Electron. J. Combin. 2014}] and [{\it European J. Combin. 2014}]. With the help of the computer algebra package {\tt HolonomicFunctions}, we further get some new identities involving Narayana polynomials.
In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the generalisation (to more nodes, or dimensions) is straightforward. At an instant m, we "take a picture" of the system and we compute the probabilities of being at particular positions in space. The sum of all these probabilities is equal to one.
The combinatorics of some two-color partition identities
本研究针对Andrews、EI Bachraoui及Chen和Zhou提出的双色分拆恒等式相关问题，给出了已有恒等式的组合证明，还推导了若干新的双色分拆恒等式并提供组合证明，推进了分拆组合学领域的相关研究。
We derive new combinatorial identities which may be viewed as multivariate analogs of summation formulas for hypergeometric series. As in the previous paper [Re], we start with probability distributions on the space of the infinite Young tableaux. Then we calculate the probability that the entry of a random tableau at a given box equals n=1,2,.... Summing these probabilities over n and equating the result to 1 we get a nontrivial identity. Our choice for the initial distributions is motivated by the recent work on harmonic analysis on the infinite symmetric group and related topics.
Brualdi and Ma found a connection between involutions of length $n$ with $k$ descents and symmetric $k\times k$ matrices with non-negative integer entries summing to $n$ and having no row or column of zeros. From their main theorem they derived two alternating sums by algebraic means and asked for combinatorial proofs. In this note we provide such demonstrations making use of the Robinson-Schensted-Knuth correspondence between symmetric matrices and semi-standard Young Tableau. Additionally, we restate the proof of Brualdi and Ma's main result with this perspective which shortens the argument.
We obtain a family of new combinatorial identities for symmetric formal power series.
New Polynomial Identities and Some Consequences
本文借助 Euler Beta 函数与二项式定理推导两个多项式恒等式，推广已知结果，并由此得到及推广 Frisch、Klamkin 组合恒等式，还给出一类恒等式的推导方案。
Combinatorial Proofs of Some Results of Andrews and El Bachraoui
本文针对 Andrews 与 El Bachraoui 由 q-级数恒等式导出的受限互异偶数分拆和 4-正则分拆恒等式，给出组合证明，并进一步证明受限互异奇数分拆的对应恒等式。
In this work we prove a new combinatorial identity and applying it we establish many finite harmonic sum identities. Among many others, we prove that \begin{equation*} \sum_{k=1}^{n}\frac{(-1)^{k-1}}{k}\binom{n}{k}H_{n-k}=H_n^2+\sum_{k=1}^{n}\frac{(-1)^{k}}{k^2\binom{n}{k}}, \end{equation*} and \begin{equation*} \sum_{k=1}^{n}\frac{(-1)^{k-1}}{k^2}\binom{n}{k}H_{n-k}=\frac{H_n[H_n^2+H_n^{(2)}]}{2}-\sum_{k=0}^{n-1}\frac{(-1)^k[H_n-H_k]}{(k+1)(n-k)\binom{n}{k}}. \end{equation*} Almost all of our results are new, while a few of them recapture know results.
Generalization and Probabilistic Proofs of Some Combinatorial Identities
本文通过概率方法推导出涉及伽马和贝塔函数的组合恒等式，扩展了二项式系数和特殊函数的已知恒等式，并通过研究两个伽马和贝塔随机变量差的矩得出新恒等式。
The two partition functions $p_ω(n)$ and $p_ν(n)$ were introduced by Andrews, Dixit and Yee, which are related to the third order mock theta functions $ω(q)$ and $ν(q)$, respectively. Recently, Andrews and Yee analytically studied two identities that connect the refinements of $p_ω(n)$ and $p_ν(n)$ with the generalized bivariate mock theta functions $ω(z;q)$ and $ν(z;q)$, respectively. However, they stated these identities cried out for bijective proofs. In this paper, we first define the generalized trivariate mock theta functions $ω(y,z;q)$ and $ν(y,z;q)$. Then by utilizing odd Ferrers graph…
We provide combinatorial proofs of some of the q-series identities considered by Andrews, Jimenez-Urroz and Ono [q-series identities and values of certain $L$-functions. Duke Math. J. 108 (2001), no. 3, 395--419].
This paper describes a method to find a connection between combinatorial identities and hypergeometric series with a number of examples. Combinatorial identities can often be written as hypergeometric series with unit argument. In a number of cases these hypergeometric series are balanced and can be reduced to a simpler form. In this paper some combinatorial identities are proved using this method assuming that the results in the tables of Prudnikov et al. [12] are proven without using hypergeometric functions.
We prove a master identity for a class of sequences defined by full-history linear homogeneous recurrences with (non-negative) constant coefficients. The identity is derived in a combinatorial way, providing thus combinatorial proofs for many known and new identities obtained as its corollaries. In particular, we prove several interesting identities for the Pell, the Jacobsthal, and the m-nacci numbers.
Stirling numbers of both kinds are linked to each other via two combinatorial identities due to Schläfli and Gould. Using q-analogs of Stirling numbers defined as inversion generating functions, we provide q-analogs of the two identities. The proof is computational and we leave open the problem of finding a more combinatorial one.
Combinatorial proofs of several partition identities of Andrews and Merca
本文基于Fu和Tang的双射，为Andrews和Merca的若干分拆恒等式提供了组合证明，并引入两种分拆权重扩展了其中一个恒等式。
We introduce a class of $f(t)$-factorials, or $f(t)$-Pochhammer symbols, that includes many, if not most, well-known factorial and multiple factorial function variants as special cases. We consider the combinatorial properties of the corresponding generalized classes of Stirling numbers of the first kind which arise as the coefficients of the symbolic polynomial expansions of these $f$-factorial functions. The combinatorial properties of these more general parameterized Stirling number triangles we prove within the article include analogs to known expansions of the ordinary Stirling numbers by…
A combinatorial approach to Berkovich type identities
本研究受Berkovich的9个含勒让德符号的q-二项式恒等式启发，采用组合方法构建了这类恒等式的统一形式，既涵盖原有9个恒等式，还能推导更多同类恒等式。
We discuss CLT for the global and local linear statistics of random matrices from classical compact groups. The main part of our proofs are certain combinatorial identities much in the spirit of works by Kac and Spohn.
Finite sums associated with some polynomial identities
本文提出一个通用框架，从特定多项式恒等式推导涉及二项式系数乘积、调和数及平方调和数的有限组合和，并应用于讨论近期著名多项式恒等式相关的组合和。
A Combinatorial Proof of an Identity of Malik and Sarma on Overpartitions with Repeated Smallest Non-Overlined Part
本文为Malik和Sarma提出的关于具有重复最小非上划线部分的超分拆的四个恒等式中剩余的一个提供了组合证明，解决了该开放问题。
We present a generalization, which we call (k,m)-rank, of Dyson's notion of rank to integer partitions with k successive Durfee rectangles and give two combinatorial symmetries associated with this new definition. We prove these symmetries bijectively. Using the two symmetries we give a new combinatorial proof of generalized Roger-Ramanujan identities. We also describe the relationship between (k,m)-rank and Garvan's k-rank.
We consider an identity relating Fibonacci numbers to Pascal's triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, most of them rather involved or else relying on sophisticated number theoretical arguments. We present a new proof, quite simple and based on a Riordan array argument. The main point of the proof is the construction of a new Riordan array from a given Riordan array, by the elimination of elements. We extend the method and as an application we obtain other identities, some of which are new. An important feature of our construction is that it esta…
We prove some combinatorial identities using the Polya urn and the closely related Hoppe urn.
The coefficient of x^{-1} of a formal Laurent series f(x) is called the formal residue of f(x). Many combinatorial numbers can be represented by the formal residues of hypergeometric terms. With these representations and the extended Zeilberger's algorithm, we generate recurrence relations for summations involving combinatorial sequences such as Stirling numbers. As examples, we give computer proofs of several known identities and derive some new identities. The applicability of this method is also studied.
Combinatorial Identities Using the Matrix Tree Theorem
本文利用矩阵树定理，探讨了完全图和完全二分图中生成树分布的组合解释，并推导出新的恒等式。
"Overpartitionized" Rogers--Ramanujan type identities
本文通过对经典 $q$-级数进行代数操作，为 Rogers--Ramanujan 等恒等式提供了基于过度划分的组合解释，并给出了双射证明。
In the computation of the intersection cohomology of Shimura varieties, or of the $L^2$ cohomology of equal rank locally symmetric spaces, combinatorial identities involving averaged discrete series characters of real reductive groups play a large technical role. These identities can become very complicated and are not always well-understood (see for example the appendix of [8]). We propose a geometric approach to these identities in the case of Siegel modular varieties using the combinatorial properties of the Coxeter complex of the symmetric group. Apart from some introductory remarks about …
Based on an exact trace formula for a one-dimensional ray-splitting system, we derive novel combinatorial identities for cyclic binary sequences (Pólya necklaces).
In this article we explore some of the combinatorial consequences of recent results relating the isospectral commuting variety and the Hilbert scheme of points in the plane.
We derive combinatorial identities for variables satisfying specific systems of commutation relations, in particular elliptic commutation relations. The identities thus obtained extend corresponding ones for $q$-commuting variables $x$ and $y$ satisfying $yx=qxy$. In particular, we obtain weight-dependent binomial theorems, functional equations for generalized exponential functions, we derive results for an elliptic derivative of elliptic commuting variables, and finally study weight-dependent extensions of the Weyl algebra which we connect to rook theory.
The main result of this paper is a combinatorial description of a basis of standard level 1 module for the twisted affine Lie algebra $A_2^{(2)}.$ This description also gives two new combinatorial identities of Göllnitz (or Rogers--Ramanujan) type. Methods used through the paper are mainly developed by J. Lepowsky, R. L. Wilson, A. Meurman and M. Primc, and the crucial role in constructions plays a vertex operator algebra approach to standard representations of affine Lie algebras.
Combinatorial identities with multiple harmonic-like numbers
该研究利用生成函数方法推导多重类调和数相关二项式和的闭式，并给出多个推论、示例及与超调和数和奇调和数相关的组合恒等式。
We present a few combinatorial identities which were encountered in our work on the spectral theory of quantum graphs. They establish a new connection between the theory of random matrix ensembles and combinatorics.
Osburn and Schneider derived several combinatorial identities involving harmonic numbers using the computer programm Sigma. Here, they are derived by partial fraction decomposition and creative telescoping.
Combinatorial approach to Andrews-Gordon and Bressoud type identities
本研究受Warnaar工作启发，通过构造整数分拆相关集合间显式保权重保长度双射，给出Andrews-Gordon与Bressoud恒等式和式侧的组合解释，还发现并证明了奇偶条件相反的Kurşungöz恒等式的q级数版本，同时证明了一批该类已知及新恒等式。
The interaction between combinatorics and algebraic and differential geometry is very strong. While researching a problem of Hessian topology, we came across a series of identities of binomial coefficients, which are useful for proving a topological property of certain spaces whose elements are graphs of a class of hyperbolic polynomials. These identities are proven by different methods in combinatorics.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。