Hipster Tree Growth Rates
Combinatorics
2024-04-29 v1
Abstract
A plane rooted tree is called a hipster tree if it has no nontrivial automorphisms. Equivalently, a tree is a hipster tree if no two siblings have isomorphic subtrees. We impose the hipster condition on various classes of rooted trees. By approximating the generating function for the number of such trees, we obtain bounds on their exponential growth rates.
Keywords
Cite
@article{arxiv.2404.17188,
title = {Hipster Tree Growth Rates},
author = {Alexander Wong},
journal= {arXiv preprint arXiv:2404.17188},
year = {2024}
}
Comments
9 pages, 55th Southeastern International Conference on Combinatorics, Graph Theory & Computing