相关论文: Orders on trees and free products of left-ordered …
We prove a bi-ordered version of Rivas' result for free products of left-order groups. Namely, we show that a free product of bi-ordered groups does not admit isolated bi-ordering. Our method relies on the dynamical realization of…
We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new…
In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…
It was proved that for any finite set of elements of a free product of residually finite groups such that no two of them belong to conjugate cyclic subgroups and each of them do not belong to a subgroup which is conjugate a to free factor…
Let G be a countable group. We show there is a topological relationship between the space CO(G) of circular orders on G and the moduli space of actions of G on the circle; as well as an analogous relationship for spaces of left orders and…
A conjecture of Dicks and the author on rank of the intersection of factor-free subgroups in free products of groups is proved for the case of left ordered groups.
The primary tool for analysing groups acting on trees is Bass--Serre Theory. It is comprised of two parts: a decomposition result, in which an action is decomposed via a graph of groups, and a construction result, in which graphs of groups…
In this paper we develop the metric theory for the outer space of a free product of groups. This generalizes the theory of the outer space of a free group, and includes its relative versions. The outer space of a free product is made of…
We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…
We show that there exists no left order on the free product of two nontrivial, finitely generated, left-orderable groups such that the corresponding positive cone is represented by a regular language. Since there are orders on free groups…
There has been interest recently concerning when a left ordered group is locally indicable. Bergman and Tararin have shown that not all left ordered groups are locally indicable, but all known examples contain a nonabelian free subgroup. We…
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…
Inspired by [4] we present a new algorithm for uniformly random generation of ordered trees in which all occuring outdegrees can be specified by a given sequence of numbers. The method can be used for random generation of binary or n-ary…
We investigate fixed subgroups of automorphisms of generalised Baumslag-Solitar (GBS) groups. Our main results are for automorphisms leaving a Bass-Serre tree invariant, under the assumption that all edge stabilisers are strictly contained…
The Burns-Hale theorem states that a group G is left-orderable if and only if G is locally projectable onto the class of left-orderable groups. Similar results have appeared in the literature in the case of UPP groups and Conradian…
This is the first paper in a series of three where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Our main goal is to show that group actions on Z^n-trees give one a powerful tool to…
A $\Lambda$-tree is a $\Lambda$-metric space satisfying three axioms (1), (2) and (3). We give a characterization of those ordered abelian groups $\Lambda$ for which axioms (1) and (2) imply axiom (3). As a special case, it follows that for…
We generalize several recognizability theorems for free single-sorted algebras to the field of many-sorted algebras and provide, in a uniform way and without using neither regular tree grammars nor tree automata, purely algebraic proofs of…
AT-free graphs are characterized by vertex elimination orders. We show that these AT-free orders of a graph can be generated in constant amortized time.
For every finite rank k, k>1, we explicitly construct (2k)! left orders on the free group F_k of rank k. Each order is induced by a word of length 2k in which each generator of F_k and its inverse appear exactly once. For each of these…