Trees Iii

After the 1986 and 1989 volumes, this is the third volume on biotechnology for propagation of trees. Comprising 28 chapters contributed by international experts the book deals with fruit, ornamental, and forest trees, such as Black cherry, Sour cherry, Pomegranate, Loquat, Ficus, Yellow poplar, Horse chestnut, Judas tree, Linden tree, Saskatoons, Taiwan sassafras, Plane-tree, Rattans, Bamboos, Engelmann spruce, White spruce, Larches, Hinoki cypress, Western redcedar, and various types of pines, i.e. Jack, Carribean, Eldarica, Slash, Egg-cone, Maritime, Ponderosa, Eastern white, Loblolly pine. Trees III is an excellent reference book for scientists, educators, and students of forestry, botany, genetics, and horticulture, who are interested in tree biotechnology.

This well-illustrated seven-volume work (1906-13) covers the varieties, distribution, history and cultivation of tree species in the British Isles.

This paper addresses questions of quasi-isometric rigidity and classification for fundamental groups of finite graphs of groups, under the assumption that the Bass-Serre tree of the graph of groups has finite depth. The main example of a finite depth graph of groups is one whose vertex and edge groups are coarse Poincare duality groups. The main theorem says that, under certain hypotheses, if $\mathcal{G}$ is a finite graph of coarse Poincare duality groups, then any finitely generated group quasi-isometric to the fundamental group of $\mathcal{G}$ is also the fundamental group of a finite graph of coarse Poincare duality groups, and any quasi-isometry between two such groups must coarsely preserve the vertex and edge spaces of their Bass-Serre trees of spaces. Besides some simple normalization hypotheses, the main hypothesis is the ``crossing graph condition'', which is imposed on each vertex group $\mathcal{G}_v$ which is an $n$-dimensional coarse Poincare duality group for which every incident edge group has positive codimension: the crossing graph of $\mathcal{G}_v$ is a graph $\epsilon_v$ that describes the pattern in which the codimension 1 edge groups incident to $\mathcal{G}_v$ are crossed by other edge groups incident to $\mathcal{G}_v$, and the crossing graph condition requires that $\epsilon_v$ be connected or empty.