Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8900501 | Advances in Applied Mathematics | 2018 | 21 Pages |
Abstract
We construct a new bijection between the set of nÃk 0-1 matrices with no three 1's forming a Î configuration and the set of (n,k)-Callan sequences, a simple structure counted by poly-Bernoulli numbers. We give two applications of this result: We derive the generating function of Î-free matrices, and we give a new bijective proof for an elegant result of Aval et al. that states that the number of complete non-ambiguous forests with n leaves is equal to the number of pairs of permutations of {1,â¦,n} with no common rise.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Beáta Bényi, Gábor V. Nagy,