Related papers: Bijections for generalized Wilf equivalences
In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…
We derive an identity connecting any two second-order linear recurrence sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are…
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.
We prove several combinatorial properties of suffix arrays, including a characterization of suffix arrays through a bijection with a certain well-defined class of permutations. Our approach is based on the characterization of…
We consider the monomial expansion of the $q$-Whittaker and modified Hall-Littlewood polynomialsarising from specialization of the modified Macdonald polynomial. The two combinatorial formulas for the latter due to Haglund, Haiman, and…
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…
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…
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 provide a bijective proof of a formula of Auli and the author expressing the number of inversion sequences with no three consecutive equal entries in terms of the number of non-derangements, that is, permutations with fixed points.…
We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.
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…
We propose a natural, bivariate, generalization of the nonsingular similarity relations considered by T. Fine. We also provide an enumeration formulae and a generating tree for those relations. The latter allow us to give a new bijection…
Recently, B\'{e}nyi and the second author introduced two combinatorial interpretations for symmetrized poly-Bernoulli polynomials. In the present study, we construct bijections between these combinatorial objects. We also define various…
Using a direct algebraic approach we derive convolution identities for second order sequences, hereby distinguishing between sequences obeying the same or different recurrence relations. We also state a general convolution for Horadam…
In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
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…
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Science, these notions allow us to give a unified view of a…
Motivated by a correlation between the distribution of descents over permutations that avoid a consecutive pattern and those avoiding the respective quasi-consecutive pattern, as established in this paper, we obtain a complete $\des$-Wilf…
We classify all bi-vincular patterns of length two and three according to the number of permutations avoiding them. These patterns were recently defined by Bousquet-Melou et. al., and are natural generalizations of Babson and…