/
lectern.tv
Play15s30s1x0:00/--:--
DoneWatched
Expand
University of Oxford·Sam Adam-Day
1:02:43
0:00/1:02:43
Type below to lock the video timestamp, or press S to capture a slide.
Continuous Gradability of R-tree Cut-Point Orders
An exploration of the continuous gradability of cut-point orders in R-trees, addressing a problem posed by Favre and Jonsson and establishing new links with set-theoretic trees.
Abstract. An R-tree is a metric space tree in which every point can be branching. Favre and Jonsson posed the following problem in 2004: can the class of orders underlying R-trees be characterised by the fact that every branch is order-isomorphic to a real interval? In the first part of the talk, I answer this question in the negative: there is a branchwise-real tree order which is not continuously gradable. In the second part, I show that a branchwise-real tree order is continuously gradable if and only if every embedded well-stratified (i.e. set-theoretic) tree is R-gradable. This tighter link with set theory is put to work in the third part answering a number of refinements of the main question, yielding several independence results.