We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

math.CO

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Mathematics > Combinatorics

Title: Hipster Tree Growth Rates

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.
Comments: 9 pages, 55th Southeastern International Conference on Combinatorics, Graph Theory & Computing
Subjects: Combinatorics (math.CO)
Cite as: arXiv:2404.17188 [math.CO]
  (or arXiv:2404.17188v1 [math.CO] for this version)

Submission history

From: Alexander Wong [view email]
[v1] Fri, 26 Apr 2024 07:02:02 GMT (5kb)

Link back to: arXiv, form interface, contact.