相关论文: Whitehead moves for G-trees

This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…

To a graph, Hausel and Proudfoot associate two complex manifolds, B and D, which behave, respectively like moduli of local systems on a Riemann surface, and moduli of Higgs bundles. For instance, B is a moduli space of microlocal sheaves,…

The purpose of this note is to exhibit some simple and basic constructions for smooth compact transformation groups, and some of their most immediate applications to geometry.

Graham and Pollak showed that the determinant of the distance matrix of a tree $T$ depends only on the number of vertices of $T$. Graphical distance, a function of pairs of vertices, can be generalized to ``Steiner distance'' of sets $S$ of…

Behavior trees (BTs) are an optimally modular framework to assemble hierarchical hybrid control policies from a set of low-level control policies using a tree structure. Many robotic tasks are naturally decomposed into a hierarchy of…

Rotation distances measure the differences in structure between rooted ordered binary trees. The one-dimensional skeleta of associahedra are rotation graphs, where two vertices representing trees are connected by an edge if they differ by a…

We extend the notion of 'homomorphism-homogeneity' to a wider class of kinds of maps than previously studied, and we investigate the relations between the resulting notions of homomorphism-homogeneity, giving several examples. We also give…

A degeneration of compact Kaehler manifolds gives rise to a monodromy action on Betti moduli space H^1(X, G) = Hom(\pi_1(X),G)/G over smooth fibres with a complex algebraic structure group G being either abelian or reductive. Assume that…

As well known the rotation distance D(S,T) between two binary trees S, T of n vertices is the minimum number of rotations of pairs of vertices to transform S into T. We introduce the new operation of chain rotation on a tree, involving two…

When applying isogeometric analysis to engineering problems, one often deals with multi-patch spline spaces that have incompatible discretisations, e.g. in the case of moving objects. In such cases mortaring has been shown to be…

We introduce a novel combinatorial method to study $Q^{**}$-transformations of group presentations or, equivalently, 3-deformations of CW-complexes of dimension 2. Our procedure is based on a refinement of discrete Morse theory that gives a…

We have established a 1-1 correspondence between a solution of the universal Whitham hierarchy and a twistor space. The twistor space consists of a complex surface and a family of complex curves together with a meromorphic 2-form. The…

We show that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. This comes as a corollary of a similar decomposition theorem…

Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of…

Kauer moves are local moves of an edge in a Brauer graph that yield derived equivalences between Brauer graph algebras [Kau98]. These derived equivalences may be interpreted in terms of silting mutations. In this paper, we generalize the…

Generalized trees, we call them O-trees, are defined as hierarchical partial orders, i.e., such that the elements larger than any one are linearly ordered. Quasi-trees are, roughly speaking, undirected O-trees. For O-trees and quasi-trees,…

We investigate a relationship between a particular class of two-dimensional integrable non-linear $\sigma$-models and variations of Hodge structures. Concretely, our aim is to study the classical dynamics of the $\lambda$-deformed $G/G$…

Let $T$ be a tree and $e$ an edge in $T$. If $C$ is a component of $T\setminus e$ and both $C$ and its complement are infinite we say that $C$ is a half-tree. The main result of this paper is that if $G$ is a closed subgroup of the…

The segmentation of individual trees from forest point clouds is a crucial task for downstream analyses such as carbon sequestration estimation. Recently, deep-learning-based methods have been proposed which show the potential of learning…

In this paper we study the minimum number of reversals needed to transform a unicellular fatgraph into a tree. We consider reversals acting on boundary components, having the natural interpretation as gluing, slicing or half-flipping of…