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 not deleted
user 65993
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.
8
votes
1
answer
405
views
Embedding Euclidean buildings into products of trees
Question: Is it true that every (finite rank) Euclidean building has a biLipschitz embedding into a finite product of metric $\mathbb{R}$-trees? … ,
$$ C^{-1}d_X(x,y)^p \leq d_T(f(x),f(y)) \leq Cd_X(x,y)^p.$$
So what I am asking is if there is any obstruction to taking $p=1$ (maybe increasing the number of trees in the product if necessary). …
- 83