Bijective enumerations of \(\Gamma\)-free \(0\)-\(1\) matrices

DOI10.1016/j.aam.2017.12.002zbMath1383.05003arXiv1707.06899OpenAlexW2794199602WikidataQ114214528 ScholiaQ114214528MaRDI QIDQ2412998

Beáta Bényi, Gábor V. Nagy

Publication date: 6 April 2018

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.06899

zbMATH Keywords

\(\Gamma\)-free matrixnon-ambiguous forest

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05)

Related Items (5)

On \(q\)-poly-Bernoulli numbers arising from combinatorial interpretations ⋮ Poly-Cauchy numbers of the second kind - the combinatorics behind ⋮ Lonesum and \(\Gamma\)-free \(0-1\) fillings of Ferrers shapes ⋮ Poly-Bernoulli Numbers and Eulerian Numbers ⋮ Combinatorial proof of an identity on Genocchi numbers

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorics of non-ambiguous trees
• Enumeration of \((0.1)\)-matrices avoiding some \(2 \times 2\) matrices
• Davenport-Schinzel theory of matrices
• Combinatorics of poly-Bernoulli numbers
• Enumeration of pairs of permutations and sequences
• Combinatorial properties of poly-Bernoulli relatives
• Heaps and two exponential structures

This page was built for publication: Bijective enumerations of \(\Gamma\)-free \(0\)-\(1\) matrices