Arboretum for a generalisation of Ramanujan polynomials
DOI10.1007/S11139-019-00185-6zbMATH Open1462.05037arXiv1905.02083OpenAlexW2982136015WikidataQ126981529 ScholiaQ126981529MaRDI QIDQ829672FDOQ829672
Authors: Lucas Randazzo
Publication date: 6 May 2021
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.02083
Recommendations
Trees (05C05) Exact enumeration problems, generating functions (05A15) Graph polynomials (05C31) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial identities, bijective combinatorics (05A19) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Geometry of the space of phylogenetic trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- The tropical Grassmannian
- A new proof of Cayley's formula for counting labeled trees
- Chapter 3 of Ramanujan's second notebook
- A Ramanujan sequence that refines the Cayley formula for trees
- A generalization of the Ramanujan polynomials and plane trees
- Bijections behind the Ramanujan polynomials
- Term rewriting induction
- Opérades différentielles graduées sur les simplexes et les permutoèdres
- Ramanujan grammar and Cayley trees
- Derivatives of the tree function
Cited In (5)
- Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices
- A context-free grammar for the Ramanujan-Shor polynomials
- A generalization of the Ramanujan polynomials and plane trees
- Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees
- Bijections behind the Ramanujan polynomials
This page was built for publication: Arboretum for a generalisation of Ramanujan polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q829672)