Results 201 to 210 of about 8,688 (230)
Some of the next articles are maybe not open access.
An Extension of Franklin’s Bijection
2001The author gives a purely combinatorial proof of the identity \[ \prod_{n>m}(1-q^n) = \sum_{n=1}^{\infty} (-1)^n \left[ {n+m \atop m} \right] q^{nm+n(3n+1)/2}(1-q^{2n+m+1}), \] which generalizes Franklin's proof for the case \(m=0\).
openaire +2 more sources
Reversible and Bijectively Related Posets
Order, 2009A poset is said to be reversible if every of its order-preserving self-bijections is an automorphism. Three classes of reversible posets are described: 1) Every poset \(P\) of height 2 that has finitely many connected components and contains finitely many crowns is reversible. 2) Let \(P\) be a well-founded poset such that every level \(P_{\alpha}\), \(
openaire +2 more sources
The q-Variations of Sylvester’s Bijection Between Odd and Strict Partitions
Ramanujan Journal, 2005Jiang Zeng
exaly
Blossoming Bijection for Higher-Genus Maps
Journal of Combinatorial Theory - Series A, 2019Mathias Lepoutre
exaly
Crystal Interpretation of Kerov–Kirillov–Reshetikhin Bijection II. Proof for \mathfrak{Sl}ₙ Case
Journal of Algebraic Combinatorics, 2008Reiho Sakamoto
exaly
On a Functional Equation Involving Iterates of a Bijection on the Unit Interval
Nonlinear Analysis: Theory, Methods & Applications, 1983Arunava Mukherjea
exaly