中文
相关论文

相关论文: Bijections for hook pair identities

200 篇论文

Zagier introduced the term "strange identity" to describe an asymptotic relation between a certain $q$-hypergeometric series and a partial theta function at roots of unity. We show that behind Zagier's strange identity lies a statement…

经典分析与常微分方程 · 数学 2022-03-29 Jeremy Lovejoy

In a recent paper (arXiv:2301.09744), Erickson and Hunziker consider partitions in which the arm-leg difference is an arbitrary constant $m$. In previous works, these partitions are called $(-m)$-asymmetric partitions. Regarding these…

组合数学 · 数学 2023-05-16 Nishu Kumari

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…

组合数学 · 数学 2022-12-14 Tomislav Došlić , Luka Podrug

In this paper, we present a direct bijective proof of the hook-length formula for standard immaculate tableaux, which arose in the study of non-commutative symmetric functions. Our proof is along the spirit of Novelli, Pak and…

组合数学 · 数学 2015-03-17 Emma L. L. Gao , Arthur L. B. Yang

The pattern-avoiding fillings of Young diagrams we study arose from Postnikov's work on positive Grassman cells. They are called Le-diagrams, and are in bijection with decorated permutations. Other closely-related diagrams are interpreted…

组合数学 · 数学 2010-11-30 Matthieu Josuat-Vergès

We show how Bailey pairs can be used to give a simple proof of an identity of Chern, Li, Stanton, Xue, and Yee. The same method yields a number of related identities as well as false theta companions.

经典分析与常微分方程 · 数学 2025-04-01 Shashank Kanade , Jeremy Lovejoy

This note provide bijective proofs of two combinatorial identities involving generalized Catalan number $C_{m,5}(n)={m\over 5n+m}{5n+m\choose n}$ recently proposed by Sun.

组合数学 · 数学 2008-05-27 Sherry H. F. Yan

Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…

组合数学 · 数学 2025-09-01 Dandan Chen , Ziyin Zou

Some conjectures on partition hook lengths, recently stated by the author, have been proved and generalized by Stanley, who also needed a formula by Andrews, Goulden and Jackson on symmetric functions to complete his derivation. Another…

组合数学 · 数学 2008-07-14 Guo-Niu Han

Recently, the author and Yamamoto invented a new proof of the duality for multiple zeta values. The technique is applicable in other series identities. In this article, we exhibit such proofs for some series identities.

数论 · 数学 2020-06-23 Shin-ichiro Seki

We obtain a bijection between certain lattice paths and partitions. This implies a proof of polynomial identities conjectured by Melzer. In a limit, these identities reduce to Rogers--Ramanujan-type identities for the…

高能物理 - 理论 · 物理学 2016-09-06 O. Foda , S. O. Warnaar

In a recent paper by L. Fel two new identities for the degree of syzygies are given. We present an algebraic proof of them, using only basic homological algebra tools. We also extend these results.

交换代数 · 数学 2012-06-12 Ivan Martino , Neeraj Kumar

In this paper, we employ the theories and techniques of hypergeometric functions to provide two distinct proofs of the conjectured identities involving multiple Ap\'ery-like series with central binomial coefficients and multiple harmonic…

数论 · 数学 2025-10-13 Ce Xu

Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of…

组合数学 · 数学 2007-05-23 Jason Burns

The existence of $q$-ary linear complementary pairs (LCPs) of codes with $q> 2$ has been completely characterized so far. This paper gives a characterization for the existence of binary LCPs of codes. As a result, we solve an open problem…

信息论 · 计算机科学 2023-12-18 Shitao Li , Minjia Shi , San Ling

The topic of stable matchings (marriages) in a bipartite graph has become widely popular, starting with the appearance of the classical work by Gale and Shapley. We give a detailed survey on selected known results in this field that…

组合数学 · 数学 2023-01-11 Alexander V. Karzanov

We describe two general mechanisms for producing pairing bijections (bijective functions defined from N x N to N). The first mechanism, using n-adic valuations results in parameterized algorithms generating a countable family of distinct…

数学软件 · 计算机科学 2013-01-03 Paul Tarau

We present a proof of Swee Hong Chan's conjecture establishing a bijection between the set of necklaces of length $n$ with at most $q$ colors, and the set of periodic functions $f: \mathbb{Z}_{n}\to {0, 1, ..., q-1}$ whose weighted sum is…

组合数学 · 数学 2025-09-03 Jiyou Li , Yanghongbo Zhou

We prove that the multiset {(RightArmLength,LeftArmLength)} ranging over all cells of all Ferrers diagrams with n cells equals the multiset {(RightArmLength,LegLength)} ranging over all cells of all Ferrers diagrams with n cells, thereby…

组合数学 · 数学 2009-09-22 Amitai Regev , Doron Zeilberger

In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…

组合数学 · 数学 2019-08-13 Hillary S. W. Han , Christian M. Reidys