A criterion for sharpness in tree enumeration and the asymptotic number of triangulations in Kuperberg's \(G_2\) spider
From MaRDI portal
Publication:6615503
DOI10.5070/C64163851zbMATH Open1547.05031MaRDI QIDQ6615503
Publication date: 8 October 2024
Published in: Combinatorial Theory (Search for Journal in Brave)
Combinatorial aspects of representation theory (05E10) Representations of Lie algebras and Lie superalgebras, algebraic theory (weights) (17B10) Asymptotic enumeration (05A16)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spanning forests in regular planar maps
- Random walks in Weyl chambers and the decomposition of tensor powers
- Lattice path combinatorics and asymptotics of multiplicities of weights in tensor powers
- Enumeration of non-positive planar trivalent graphs
- Power series from a computational point of view
- On the distribution of roots of algebraic equations with integral coefficients
- The height and range of watermelons without wall
- On an asymptotic method in enumeration
- Spiders for rank 2 Lie algebras
- On some combinatorial sequences associated to invariant theory
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
- Singularity Analysis of Generating Functions
- Random Walk in a Weyl Chamber
- On the Altitude of Nodes in Random Trees
- THE QUANTUM G2 LINK INVARIANT
- Treatise on the approximation of functions of very large numbers and on a class comprising series expansions.
This page was built for publication: A criterion for sharpness in tree enumeration and the asymptotic number of triangulations in Kuperberg's \(G_2\) spider
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615503)