相关论文: The Reconstruction of Cycle-free Partial Orders fr…

In this triple of papers, we examine when two cycle-free partial orders can share an abstract automorphism group. This question was posed by M. Rubin in his memoir concerning the reconstruction of trees. In this first paper, we give a…

In this triple of papers, we examine when two cycle-free partial orders can share an abstract automorphism group. This question was posed by M. Rubin in his memoir concerning the reconstruction of trees. In this final paper, we give…

We give a complete classification to when a finite group of outer automorphisms preserves a bi-order on a non-abelian free group and bi-orderable surface groups. We also give another new criterion for an outer automorphism of $F_n$ induced…

We provide a description of the structure of $\aleph_0$-categorical trees and cycle-free partial orders. First the maximal branches of $\aleph_0$-categorical tree are examined, followed by the configuration of the ramification orders, which…

We give an amalgamation construction of free multiple trees with a strongly transitive automorphism group. The construction shows that any partial codistance function on a tuple of finite trees can be extended to yield multiple trees.

This work addresses the existence of transitive extensions of certain infinite permutation groups which arise as the automorphism groups of model-theoretic structures which are generic in the Fra\"iss\'e sense. The study of transitive…

In the classical setting, a convex polytope is said to be semiregular if its facets are regular and its symmetry group is transitive on vertices. This paper studies semiregular abstract polytopes, which have abstract regular facets, still…

We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method…

We give a characterisation of quantum automorphism groups of trees. In particular, for every tree, we show how to iteratively construct its quantum automorphism group using free products and free wreath products. This can be considered a…

We study the automorphism groups of free-by-cyclic groups and show these are finitely generated in the following cases: (i) when defining automorphism has linear growth and (ii) when the rank of the underlying free group has rank at most 3.…

This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…

In two previous papers we constructed new families of completely regular codes by concatenation methods. Here we determine cases in which the new codes are completely transitive. For these cases we also find the automorphism groups of such…

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…

We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, 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…

We construct large families of groups admitting free transitive actions on median spaces. In particular, we construct groups which act freely and transitively on the complete universal real tree with continuum valence such that any subgroup…

This paper is an exploration of the faithful transitive permutation representations of the orientation-preserving automorphisms groups of highly symmetric toroidal maps and hypermaps. The main theorems of this paper give a list of all…

We present obstruction results for self-similar groups regarding the generation of free groups. As a main consequence of our main results, we solve an open problem posed by Grigorchuk by showing that in an automaton group where a…

We are concerned with orderable groups and particularly those with orderings invariant not only under multiplication, but also under a given automorphism or family of automorphisms. Several applications to topology are given: we prove that…

For any choice of a basis $\cal A$ the free group $F_N$ of finite rank $N \geq 2$ can be canonically identified with the set $F(\cal A)$ of reduced words in $\cal A\cup \cal A^{-1}$. However, such a word $w \in F(\cal A)$ admits a second…