Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with trees
Search options questions only
not deleted
user 14167
A tree is a connected graph without cycles, with a finite or infinite number of vertices. There are many variants of trees, according to further constraints or decorations.
13
votes
5
answers
1k
views
Is the following invariant of rooted trees a complete invariant?
Recall that rooted trees may be generated by starting with a trivial rooted tree (just a vertex), along with the operations of grafting a number of trees (identify their roots) and adding a new vertex … This polynomial is an isomorphism invariant of rooted trees. My question is
If $P_T=P_{T'}$, are the rooted trees, $T,T"$ isomorphic? …
- 1,325
11
votes
1
answer
485
views
What is the precise relationship between "prodsimplicial sets" and rooted trees?
The simplices correspond to maximal depth trees where the valence of a vertex is at most 2, while the cubes correspond to minimal depth (star-shaped) trees where the root vertex has valence n and all the … I see how simplices are the "linear trees", and I see how a map of two simplices will become a map between two such trees. I also see how to send the n-cube to the appropriate star-shaped tree. …
- 1,325