Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.17188 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929327966257152 |
|---|---|
| author | Wong, Alexander |
| author_facet | Wong, Alexander |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_17188 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Hipster Tree Growth Rates Wong, Alexander Combinatorics 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. |
| title | Hipster Tree Growth Rates |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2404.17188 |