Related papers: Context-free graphs and their transition groups
We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…
We propose a definition of graph subshifts of finite type that can be seen as extending both the notions of subshifts of finite type from classical symbolic dynamics and finitely presented groups from combinatorial group theory. These are…
Random graphs offer a useful mathematical representation of a variety of real world complex networks. Exponential random graphs, for example, are particularly suited towards generating random graphs constrained to have specified statistical…
This note provides an alternate account of Calegari's rationality theorem for stable commutator length in free groups.
A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between graph theory and quantum information, which we explore in…
This text, Chapter 23 in the "AutoMathA" handbook, is devoted to the study of rational subsets of groups, with particular emphasis on the automata-theoretic approach to finitely generated subgroups of free groups. Indeed, Stallings'…
We study universal groups for right-angled buildings. Inspired by Simon Smith's work on universal groups for trees, we explicitly allow local groups that are not necessarily finite nor transitive. We discuss various topological and…
We discuss quantum non-locality and contextuality using the notion of transition sets. This approach provides a way to obtain a direct logical contradiction with locality/non-contextuality in the EPRB gedanken experiment as well as a clear…
We prove various results connecting structural or algebraic properties of graphs and groups to conditions on their spaces of harmonic functions. In particular: we show that a group with a finitely supported symmetric measure has a…
We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative…
The co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group has context-free co-word problem. We use this method to…
This note studies the Burnside problem for homeomorphism groups of compact connected manifolds. For surfaces, we prove that the identity component of the homeomorphism group is torsion-free precisely when the surface is not the sphere,…
The `random intersection graph with communities' models networks with communities, assuming an underlying bipartite structure of groups and individuals. Each group has its own internal structure described by a (small) graph, while groups…
A group $G$ is said to satisfy the finitely generated intersection property (f.g.i.p.) if the intersection of any two finitely generated subgroups of $G$ is again finitely generated. The aim of this article is to understand when the…
We study closed subgroups $G$ of the automorphism group of a locally finite tree $T$ acting doubly transitively on the boundary. We show that if the stabiliser of some end is metabelian, then there is a local field $k$ such that…
Inspired by results for graph $C^*$-algebras, we investigate connections between the ideal structure of an inverse semigroup $S$ and that of its tight $C^*$-algebra by relating ideals in $S$ to certain open invariant sets in the associated…
In this paper, we discuss the concept of quantum graphs with transparent vertices by considering the case where the graph interacts with an external time-independent field. In particular, we address the problem of transparent boundary…
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…
We extend L\"uck's determinant conjecture from groups to invariant random subgroups (IRS) of free groups, a framework generalizing groups where a non-sofic object is known to exist. For every free group, we prove the existence of an IRS…