Related papers: On the congruence subgroup problem for branch grou…
In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…
In 1966, Cummins introduced the "tree graph": the tree graph $\mathbf{T}(G)$ of a graph $G$ (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge,…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…
Myasnikov et al. have introduced the knapsack problem for arbitrary finitely generated groups. In previous work, the authors proved that for each graph group, the knapsack problem can be solved in $\mathsf{NP}$. Here, we determine the exact…
We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional $2$-step nilpotent Lie algebras over a field and for a class of finite $p$-groups. We show that the…
This work examines the problem of topology inference over discrete-time nonlinear stochastic networked dynamical systems. The goal is to recover the underlying digraph linking the network agents, from observations of their state-evolution.…
We give a geometric description of the Poisson boundaries of certain extensions of free and hyperbolic groups. In particular, we get a full description of the Poisson boundaries of free-by-cyclic groups. We rely upon the description of…
This is a survey of some of the consequences of the recently introduced congruences on the theory of connectednesses (radical classes) and disconnectednesses (semisimple classes) of graphs and topological spaces. In particular, it is shown…
We study the Fibered Isomorphism Conjecture of Farrell and Jones in L-theory for groups acting on trees. In several cases we prove the conjecture. This includes wreath products of abelian groups and free metabelian groups. We also deduce…
Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the graph $\Gamma_G(N)$, which is the graph associated to the conjugacy classes of $G$ contained in $N$, has no triangles and when the graph…
We study congruences on the partial automorphism monoid of a finite rank free group action. We give a decomposition of a congruence on this monoid into a Rees congruence, a congruence on a Brandt semigroup and an idempotent separating…
We establish a combination theorem for parafree groups. These groups were introduced by Baumslag in the sixties. One of the current motivations for a better understanding of their structure is that they show up naturally in connection with…
We show that the natural algebraic structure of the singular chains on a path connected topological space determines the fundamental group functorially. Moreover, we describe a notion of weak equivalence for the relevant algebraic structure…
Automorphism groups of locally finite trees provide a large class of examples of simple totally disconnected locally compact groups. It is desirable to understand the connections between the global and local structure of such a group.…
In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky…
Wu, Zhang and Li [4] conjectured that the set of vertices of any simple graph $G$ can be equitably partitioned into $\lceil(\Delta(G)+1)/2\rceil$ subsets so that each of them induces a forest of $G$. In this note, we prove this conjecture…
We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…
Groups acting freely on Z^n-trees (Z^n-free groups) play a key role in the study of non-archimedean group actions. Following Stallings' ideas, we develop graph-theoretic techniques to investigate subgroup structure of Z^n-free groups. As an…
The congruence subgroup property is established for the modular representations associated to any modular tensor category. This result is used to prove that the kernel of the representation of the modular group on the conformal blocks of…