Related papers: Algorithmic constructions of relative train track …
Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…
In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
This paper introduces a set of formally defined and transparent problems for reinforcement learning algorithms with the following characteristics: (1) variable degrees of observability (non-Markov observations), (2) distal and sparse…
Any endomorphism of a finitely generated free group naturally descends to an injective endomorphism of its stable quotient. In this paper, we prove a geometric incarnation of this phenomenon: namely, that every expanding irreducible train…
The vertices of a finite state system are usually a subset of the natural numbers. Most algorithms relative to these systems only use this fact to select vertices. For infinite state systems, however, the situation is different: in…
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…
A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white vertex is of degree 1 or 2, with a cyclic order imposed on every set of…
From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…
We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…
We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…
We describe the full automorphism group of the directed reduced power graph and the undirected reduced power graph of a finite group. We compute the full automorphism groups of these graphs of several classes of finite groups. Also, we…
In this article we continue the study of automorphism groups of constant length substitution shifts and also their topological factors. We show that up to conjugacy, all roots of the identity map are letter exchanging maps, and all other…
In this paper, we present a method to generate compact geometric track-maps for train-borne localization applications. Therefore, we first give a brief overview on the purpose of track maps in train-positioning applications. It becomes…
In this article we provide necessary and sufficient conditions for a completely positive trace-preserving (CPT) map to be decomposable into a convex combination of unitary maps. Additionally, we set out to define a proper distance measure…
Given a positive definite even lattice and a commutative ring, there is a standard construction of a lattice vertex algebra over the commutative ring, and it admits a natural grading by non-negative integers. We describe the groups of…
We describe the outer automorphism group of a one-ended fundamental group of a graph of groups, when edge groups are cyclic, and vertex groups are torsion-free with cyclic centralizers. We show that in this case the outer automorphism group…