相关论文: Bijections for hook pair identities

We give a bijective proof of a conjecture of Regev and Vershik on the equality of two multisets of hook numbers of certain skew-Young diagrams. The bijection proves a result that is stronger and more symmetric than the original conjecture,…

Han recently discovered new hook length identities for binary trees. In this paper, we extend Han's identities to binomial families of trees. Moreover, we present a bijective proof of one of the identities for the family of ordered trees.

We provide bijective proofs of two classic identities that are very simple to prove using generating functions, but surprisingly difficult to prove combinatorially. The problem of finding a bijective proof for the first identity was first…

We first give a bijective proof of Gould's identity in the model of binary words. Then we deduce Rothe's identity from Gould's identity again by a bijection, which also leads to a double-sum extension of the $q$-Chu-Vandermonde formula.

Strongly refining results by Regev, Regev and Zeilberger, we prove surprising coincidences between characters to 2-part partitions of size n and characters to hooks of size n+2 on two related families obtained by extending 2-regular…

This paper highlights three known identities, each of which involves sums over alternating sign matrices. While proofs of all three are known, the only known derivations are as corollaries of difficult results. The simplicity and natural…

There are $k$ kinds of length $k$ hooks with different arm length. Actually, this $k$ kinds appear uniformly in Young diagrams of size $n$. The property ``appear uniformly'' is called super symmetric. We give a combinatorial proof of the…

Rogers-Ramanujan type identities occur in various branches of mathematics and physics. As a classic and powerful tool to deal with Rogers-Ramanujan type identities, the theory of Bailey's lemma has been extensively studied and generalized.…

Recently, Naruse presented a beautiful cancellation-free hook-length formula for skew shapes. The formula involves a sum over objects called excited diagrams, and the term corresponding to each excited diagram has hook lengths in the…

Baryshnikov and Romik derived the combinatorial identities for the numbers of the $m$-strip tableaux. This generalized the classical Andr\'e's theorem for the number of up-down permutations. They asked for a bijective proof for the…

In this article, a short combinatorial proof of the Capelli's identity is given. It also leads to an easy proof of the Capelli--Cauchy--Binet identity, a more general form of Capelli's identity. With the technique introduced, the Turnbull's…

This paper gives bijective proofs of some novel coinversion identities first discovered by Ayyer, Mandelshtam, and Martin (arxiv:2011.06117) as part of their proof of a new combinatorial formula for the modified Macdonald polynomials…

Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…

We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fold types are defined. Initial computation results for some…

The connected components of $\mathcal{M}_{0,n}(\mathbb{R})$ are in bijection with the $(n-1)!/2$ dihedral orderings of $[n]$. They are all isomorphic. We construct monomial maps between them, and use these maps to prove a conjecture of…

In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…

The dilogarithm identities for the central charges of conformal field theories of simply laced type were conjectured by Bazhanov, Kirillov, and Reshetikhin. Their functional generalizations were conjectured by Gliozzi and Tateo. They have…

The theory of Bailey's transform provides a systematic method for deriving $q$-identities, the key factor of which is the Bailey pair. The concept of Bailey pair was first extended to bilateral version by Paule. In this paper, following…

Based on the work of A. Vershik, we introduce two new combinatorial identities. We show how these identities can be used to prove a new hook-content identity. The main motivation for deriving this identity was a particular optimization…

We use Bailey pairs to prove $q$-series identities at roots of unity due to Cohen and Bryson-Ono-Pitman-Rhoades. The proofs use Bailey pairs with quadratic forms developed in the study of mock theta functions. In addition to the standard…