Related papers: Algorithmic constructions of relative train track …
An outer automorphism of a free group is geometric if it can be represented by a homeomorphism of a compact surface. Bestvina and Handel gave an algorithmic characterization of geometric irreducible outer automorphisms using relative train…
The fundamental group of a finite graph of groups with trivial edge groups is a free product. We are interested in those outer automorphisms of such a free product that permute the conjugacy classes of the vertex groups. We show that in…
We define train track maps for graphs-of-groups $\cal G$ and exhibit the precise conditions under which the fundamental finiteness properties known for classical train track maps extend to this generalization. These finiteness properties…
Every irreducible outer automorphism of the free group of rank r is topologically represented by an irreducible train track map $f$ on some graph $\Gamma$ of rank r. Moreover, $f$ can always be written as a composition of folds and a graph…
We present an effective algorithm for detecting automorphic orbits in free groups, as well as a number of algorithmic improvements of train tracks for free group automorphisms.
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…
Our goal is to find dynamic invariants that completely determine elements of the outer automorphism group $\Out(F_n)$ of the free group $F_n$ of rank $n$. To avoid finite order phenomena, we do this for {\it forward rotationless} elements.…
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…
Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…
By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…
A survey article that presents some recent algebraic and model-theoretic results on the automorphism groups of relatively free groups of infinite rank. The topics include topological aspects, generating sets, descripition of automorpisms…
In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…
We prove that the minimally displaced set of a relatively irreducible automorphism of a free splitting, situated in a deformation space, is uniformly locally finite. The minimally displaced set coincides with the train track points for an…
Kernel approximation using randomized feature maps has recently gained a lot of interest. In this work, we identify that previous approaches for polynomial kernel approximation create maps that are rank deficient, and therefore do not…
Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…
We give an algorithm for finding the index of a positive outer automorphism of the free group, and prove the algorithm exits in a finite time.
Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
This is the second of two papers in which we investigate the properties of displacement functions of automorphisms of free groups (more generally, free products) on the Culler-Vogtmann Outer space $CV_n$ and its simplicial bordification. We…