The following pages link to Counting trees using symmetries (Q2434888):
Displaying 11 items.
- The number of prefixes of minimal factorisations of a cycle (Q311552) (← links)
- A simple model of trees for unicellular maps (Q388727) (← links)
- Bijections and symmetries for the factorizations of the long cycle (Q394753) (← links)
- Free energies and fluctuations for the unitary Brownian motion (Q728503) (← links)
- Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti (Q1885017) (← links)
- Almost all trees have quantum symmetry (Q2198269) (← links)
- Coding multitype forests: application to the law of the total population of branching forests (Q2787987) (← links)
- A robust generalization of the Legendre transform for QFT (Q5272616) (← links)
- A refined enumeration of hex trees and related polynomials (Q5964268) (← links)
- A large-deviations principle for all the components in a sparse inhomogeneous random graph (Q6045832) (← links)
- On quasi-polynomials counting planar tight maps (Q6615501) (← links)
