A bijective proof of the Shor recurrence
From MaRDI portal
Publication:1746570
DOI10.1016/j.ejc.2017.12.004zbMath1384.05095OpenAlexW2782121123WikidataQ114184740 ScholiaQ114184740MaRDI QIDQ1746570
Publication date: 25 April 2018
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2017.12.004
Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (3)
Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices ⋮ Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees ⋮ A context-free grammar for the Ramanujan-Shor polynomials
Cites Work
- Unnamed Item
- A bijective enumeration of labeled trees with given indegree sequence
- Context-free grammars, differential operators and formal power series
- An insertion algorithm and leaders of rooted trees
- Counting labelled trees with given indegree sequence
- Coalescent random forests
- A Ramanujan sequence that refines the Cayley formula for trees
- Incidence algebra antipodes and Lagrange inversion in one and several variables
- A new proof of Cayley's formula for counting labeled trees
- Ramanujan grammar and Cayley trees
- A generalization of the Ramanujan polynomials and plane trees
- Disposition polynomials and plane trees
- A general bijective algorithm for trees.
- Forests of labeled trees
- Proofs from THE BOOK
- Bijections behind the Ramanujan polynomials
This page was built for publication: A bijective proof of the Shor recurrence
