Related papers: A combinatorial proof for Cayley's identity

We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…

In this paper we formulate combinatorial identities that give representation of positive integers as linear combination of even powers of 2 with binomial coefficients. We present side by side combinatorial as well as computer generated…

This paper proposes seven combinatorial problems around formulas for the characteristic polynomial and the spectral numbers of a quasihomogeneous singularity. One of them is a new conjecture on the characteristic polynomial. It is an…

In this paper we give a combinatorial proof and refinement of a Rogers-Ramanujan type partition identity of Siladi\'c arising from the study of Lie algebras. Our proof uses generating functions and $q$-difference equations.

This note concerns a one-line diagrammatic proof of the Cayley-Hamilton Theorem. We discuss the proof's implications regarding the "core truth" of the theorem, and provide a generalization. We review the notation of trace diagrams and…

This paper generalizes a graph theoretic proof technique for a Fibonacci identity proposed by Lee Knisley Sanders, and explores characteristics of these generalized theorems ad infinitum.

A conjecture of Chunwei Song on a limiting case of the q,t-Schr\"{o}der theorem is proved combinatorially. The proof matches pairs of tableaux to Catalan words in a manner that preserves differences in the maj statistic.

A simple heuristic proof of an integral identity recently derived (Glasser ML 2011 J. Phys. A: Math. Theor. 44 225202) is presented.

We lift to the multivariate Eulerian polynomials the identity implying that univariate Eulerian polynomials are palindromic. As a consequence of this generalization, we obtain nice combinatorial identities that can be directly extracted…

We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…

It is well known that the integral identity conjecture is of prime importance in Kontsevich-Soibelman's theory of motivic Donaldson-Thomas invariants for non-commutative Calabi-Yau threfolds. In this article we consider its numerical…

While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoulli numbers with combinatorial reasoning via up-down…

In this note, we will give a short proof of an identity for cubic partitions.

The proof identity problem asks: When are two proofs the same? The question naturally occurs when one reflects on mathematical practice. The problem understandably can be seen as a challenge for mathematical logic, and indeed various…

In this paper, we provide combinatorial proofs for certain partition identities which arise naturally in the context of Langlands' beyond endoscopy proposal. These partition identities motivate an explicit plethysm expansion of…

In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled…

The paper presents several combinatorial properties of the boolean cumulants. A corollary is a new proof of the multiplicative property of the boolean cumulant series that can be easily adapted for the case of boolean independence with…

We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.

We examine Deligne's classical proof of the asphericity of simplicial arrangements from the viewpoint of the combinatorics of the poset of regions of the arrangement. This turns out to be very natural. In particular, we show that an…

An elementary proof of an identity by Lyons, Paule and Riese is given. It is simpler than all the 3 published proofs.