Related papers: Bijections for hook pair identities
In this paper are defined cohomology-like groups that classify loop extensions satisfying a given identity in three variables for association identities, and in two variables for the case of commutativity. It is considered a large amount of…
Recently, Amdeberhan et al. proved congruences for the number of hooks of fixed even length among the set of self-conjugate partitions of an integer $n$, therefore answering positively a conjecture raised by Ballantine et al.. In this…
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…
We establish three identities involving Dyck paths and alternating Motzkin paths, whose proofs are based on variants of the same bijection. We interpret these identities in terms of closed random walks on the halfline. We explain how these…
Let $\mathcal{T}_3$ be the three-rowed strip. Recently Regev conjectured that the number of standard Young tableaux with $n-3$ entries in the "skew three-rowed strip" $\mathcal{T}_3 / (2,1,0)$ is $m_{n-1}-m_{n-3}$, a difference of two…
Homological Projective duality (HP-duality) theory, introduced by Kuznetsov [42], is one of the most powerful frameworks in the homological study of algebraic geometry. The main result (HP-duality theorem) of the theory gives complete…
Starting with an inclusion-exclusion proof of a combinatorial identity, a direct bijection can be produced using recursive subtraction (sometimes with a direct combinatorial description). We apply this method to identities for generalized…
We say two posets are "doppelg\"angers" if they have the same number of $P$-partitions of each height $k$. We give a uniform framework for bijective proofs that posets are doppelg\"angers by synthesizing $K$-theoretic Schubert calculus…
We prove some combinatorial identities using the Polya urn and the closely related Hoppe urn.
Biunit pairs are introduced as pairs of elements in a semiheap that generalize the notion of unit. Families of functions generalizing involutions and conjugations, called switches and warps, are investigated. The main theorem establishes…
This paper contains a description of a connection between the matching arrangement and the matching polyhedron. A bijection between regions of the matching arragement and LP-orientations of the matching polyhedron is constructed. This…
Using the model of words, we give bijective proofs of Gould-Mohanty's and Raney-Mohanty's identities, which are respectively multivariable generalizations of Gould's identity $$\sum_{k=0}^{n}{x-kz\choose k}{y+kz\choose n-k}=…
We present an elegant bijection between standard Young tableaux with 2n cells and at most two rows, and pairs of standard Young tableaux of the same shape, with n+1 cells, where only the top row can have more than one cell.
We give a bijection between the set of self-conjugate partitions and that of ordinary partitions. Also, we show the relation between hook lengths of self conjugate partition and corresponding partition via the bijection. As a corollary, we…
We highlight the role of q-series techniques in proving identities arising from knot theory. In particular, we prove Rogers-Ramanujan type identities for alternating knots as conjectured by Garoufalidis, Le and Zagier.
We prove a conjecture of Shokurov which characterises toric varieties using log pairs.
For the double of a quiver, the works of Ginzburg, Bocklandt-Le Bruyn and Schedler show that its closed paths, called the necklaces, have a natural Lie bialgebra structure. Schedler also constructed,in [Int. Math. Res. Notices, 2005 (12),…
In [7], Higashitani, Kummer, and Micha{\l}ek pose a conjecture about the symmetric edge polytopes of complete multipartite graphs and confirm it for a number of families in the bipartite case. We confirm that conjecture for a number of new…
In this we paper we prove several new identities of the Rogers-Ramanujan-Slater type. These identities were found as the result of computer searches. The proofs involve a variety of techniques, including series-series identities, Bailey…
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.