Related papers: 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 middle paper, we adapt a…
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 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…
In this paper, we construct countably many isolated circular orders on the free products $G = F_{2n} \ast \mathbb{Z}_{m_1} \ast \cdots \ast \mathbb{Z}_{m_k}$ of cyclic groups. Moreover, we prove that these isolated circular orders are not…
Fong developed `decorated cospans' to model various kinds of open systems: that is, systems with inputs and outputs. In this framework, open systems are seen as the morphisms of a category and can be composed as such, allowing larger open…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
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…
We give a new method to construct isolated left orderings of groups whose positive cones are finitely generated. Our construction uses an amalgamated free product of two groups having an isolated ordering. We construct a lot of new examples…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
If $\mathbf{C}$ is a category with pullbacks then there is a bicategory with the same objects as $\mathbf{C}$, spans as morphisms, and maps of spans as 2-morphisms, as shown by Benabou. Fong has developed a theory of "decorated" cospans,…
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 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…
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 discuss the possibility of lifting finite subgroups, and in particular finite cyclic subgroups, with respect to the canonical projections between automorphism and outer automorphism groups of free groups, surface groups and their…
We use higher dimensional bosonization and fermion decoration to construct exactly soluble interacting fermion models to realize fermionic symmetry protected trivial (SPT) orders (which are also known as symmetry protected topological…
Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…
Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…
It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…
We study the loxodromic elements for the action of $Out(F_n)$ on the free splitting complex of the rank $n$ free group $F_n$. We prove that each outer automorphism is either loxodromic, or has bounded orbits without any periodic point, or…