相关论文: Whitehead moves for G-trees
We consider the motion of small bodies in general relativity. The key result captures a sense in which such bodies follow timelike geodesics (or, in the case of charged bodies, Lorentz-force curves). This result clarifies the relationship…
We define a graph Laplacian with vertex weights in addition to the more classical edge weights, which unifies the combinatorial Laplacian and the normalised Laplacian. Moreover, we give a combinatorial interpretation for the coefficients of…
We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one…
We give a precise description of combed trees in terms of Kelly-Mac Lane graphs. We show that any combed tree is uniquely expressed as an allowable Kelly-Mac Lane graph of a certain shape. Conversely, we show that any such Kelly-Mac Lane…
We study the limiting behavior of a Bienayme-Galton-Watson tree conditioned to have a large number of vertices and either a fixed number of leaves or a fixed number of internal nodes. The first biconditioning gives a universal result with…
We introduce the concept of paravectors to describe the geometry of points in a three dimensional space. After defining a suitable product of paravectors, we introduce the concepts of biparavectors and triparavectors to describe line…
The geometry of the total space of a principal bundle with regard to the action of the bundle's structure group is elegantly described by the bundle's operation, a collection of derivations consisting of the de Rham differential and the…
A new relation in Grassmann algebra is presented, corresponding naturally to the four-dimensional Pachner move 3 -> 3. This relation is obtained by deforming a known relation associated with an exotic chain complex built for a triangulated…
The dual to a tetrahedron consists of a single vertex at which four edges and six faces are incident. Along each edge, three faces converge. A 2-foam is a compact topological space such that each point has a neighborhood homeomorphic to a…
Higher-rank versions of Wold decomposition are shown to hold for doubly commuting isometric representations of product systems of C*-correspondences over N^k, generalising the classical result for a doubly commuting pair of isometries due…
Graph decompositions are the natural generalisation of tree decompositions where the decomposition tree is replaced by a genuine graph. Recently they found theoretical applications in the theory of sparsity, topological graph theory,…
This work addresses the intrinsic relationship between trees and networks (i.e. graphs). A complete (invertible) mapping is presented which allows trees to be mapped into weighted graphs and then backmapped into the original tree without…
We show how to associate an R-tree to the set of cut points of a continuum. If X is a continuum without cut points we show how to associate an R-tree to the set of cut pairs of X.
We provide a new representation of an $\mathbb R$-tree by using a special set of metric rays. We have captured the four-point condition from these metric rays and shown an equivalence between the $\mathbb R$-trees with radial and river…
Suppose curves are moving by curvature in a plane, but one embeds the plane in $R^3$ and looks at the plane from an angle. Then circles shrinking to a round point would appear to be ellipses shrinking to an ``elliptical point,'' and the…
After a quick review of the wild structure of the complex moduli space of Calabi-Yau threefolds and the role of geometric transitions in this context (the Calabi-Yau web) the concept of "deformation equivalence" for geometric transitions is…
We generalize the notion of tight geodesics in the curve complex to tight trees. We then use tight trees to construct model geometries for certain surface bundles over graphs. This extends some aspects of the combinatorial model for doubly…
We develop the theory of meta-iteration trees, that is, iteration trees whose base "model" is itself an ordinary iteration tree. We prove a comparison theorem for meta-iteration strategies parallel to the one for ordinary iteration…
Let $G$ be an undirected graph. We say that $G$ contains a ladder of length $k$ if the $2 \times (k+1)$ grid graph is an induced subgraph of $G$ that is only connected to the rest of $G$ via its four cornerpoints. We prove that if all the…
This is the second part of a series of three articles which introduce laminations for free groups (see math.GR/0609416 for the first part). Several definition of the dual lamination of a very small action of a free group on an $\R$-tree are…