Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2106.07494 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916559929212928 |
|---|---|
| author | Dai, Xinle Long, Jordan Yeats, Karen |
| author_facet | Dai, Xinle Long, Jordan Yeats, Karen |
| contents | A gluing of two rooted trees is an identification of their leaves and un-subdivision of the resulting 2-valent vertices. A gluing of two rooted trees is subdivergence free if it has no 2-edge cuts with both roots on the same side of the cut. The problem and language is motivated by quantum field theory. We enumerate subdivergence-free gluings for certain families of trees, showing a connection with connected permutations, and we give algorithms to compute subdivergence-free gluings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2106_07494 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Subdivergence-free gluings of trees Dai, Xinle Long, Jordan Yeats, Karen Combinatorics Primary: 05A15, Secondary: 05C05, 81T18 A gluing of two rooted trees is an identification of their leaves and un-subdivision of the resulting 2-valent vertices. A gluing of two rooted trees is subdivergence free if it has no 2-edge cuts with both roots on the same side of the cut. The problem and language is motivated by quantum field theory. We enumerate subdivergence-free gluings for certain families of trees, showing a connection with connected permutations, and we give algorithms to compute subdivergence-free gluings. |
| title | Subdivergence-free gluings of trees |
| topic | Combinatorics Primary: 05A15, Secondary: 05C05, 81T18 |
| url | https://arxiv.org/abs/2106.07494 |