相关论文: Tadpole Labelled Oriented Graph Groups and Cyclica…

We use results concerning the Smith forms of circulant matrices to identify when cyclically presented groups have free abelianisation and so can be Labelled Oriented Graph (LOG) groups. We generalize a theorem of Odoni and Cremona to show…

The class of connected LOG (Labelled Oriented Graph) groups coincides with the class of fundamental groups of complements of closed, orientable 2-manifolds embedded in S^4, and so contains all knot groups. We investigate when Campbell and…

A {\em word labeled oriented graph} (WLOG) is an oriented graph $\cal G$ on vertices $X=\{ x_1,\ldots ,x_k\}$, where each oriented edge is labeled by a word in $X^{\pm1}$. WLOGs give rise to presentations which generalize Wirtinger…

This is a draft of a book submitted for publication by the AMS. Its theme is the remarkable interplay, accelerating in the last few decades, between topology and the theory of orderable groups, with applications in both directions. It…

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…

In this paper we give the complete classification of solitons for a cubic NLS equation on the simplest network with a non-trivial topology: the tadpole graph, i.e. a ring with a half-line attached to it and free boundary conditions at the…

We study a class of two-generator two-relator groups, denoted $J_n(m,k)$, that arise in the study of relative asphericity as groups satisfying a transitional curvature condition. Particular instances of these groups occur in the literature…

We show that any graph product of finitely generated groups is hierarchically hyperbolic relative to its vertex groups. We apply this result to answer two questions of Behrstock, Hagen, and Sisto: we show that the syllable metric on any…

In this paper we study the word problem of groups corresponding to tessellations of the hyperbolic plane. In particular using the Fibonacci technology developed by the second author we show that groups corresponding to the pentagrid or the…

Building on previous results concerning hyperbolicity of groups of Fibonacci type, we give an almost complete classification of the (non-elementary) hyperbolic groups within this class. We are unable to determine the hyperbolicity status of…

A biased graph consists of a graph $G$ together with a collection of distinguished cycles of $G$, called balanced cycles, with the property that no theta subgraph contains exactly two balanced cycles. Perhaps the most natural biased graphs…

Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to…

A piece of a labelled graph $\Gamma$ defined by D. Gruber is a labelled path that embeds into $\Gamma$ in two essentially different ways. We prove that graphical $Gr'(\frac{1}{6})$ small cancellation groups whose associated pieces have…

We develop a general diagrammatic theory of welded graphs, and provide an extension of Satoh's Tube map from welded graphs to ribbon surface-links. As a topological application, we obtain a complete link-homotopy classification of so-called…

Carrier graphs of groups representing subgroups of a given relatively hyperbolic groups are introduced and a combination theorem for relatively quasi-convex subgroups is proven. Subsequently a theory of folds for such carrier graphs is…

A new family of groups, called trickle groups, is presented. These groups generalize right-angled Artin and Coxeter groups, as well as cactus groups. A trickle group is defined by a presentation with relations of the form $xy = zx$ and…

In this paper we introduce the graph $\Gamma_{sc}(G)$ associated with a group $G$, called the solvable conjugacy class graph (abbreviated as SCC-graph), whose vertices are the nontrivial conjugacy classes of $G$ and two distinct conjugacy…

A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial set $S$ of vertices such that every vertex can be reached…

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…

We discuss the fundamental (relative) 3-classes of knots (or hyperbolic links), and provide diagrammatic descriptions of the push-forwards with respect to every link-group representation. The point is an observation of a bridge between the…