Related papers: $C$-Width of Graph of Groups
We construct words with small image in a given finite alternating or unimodular group. This shows that word width in these groups is unbounded in general.
A graph is $H$-free if it has no induced subgraph isomorphic to $H$. We continue a study into the boundedness of clique-width of subclasses of perfect graphs. We identify five new classes of $H$-free split graphs whose clique-width is…
We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…
A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the…
In this paper, we determine the diameter of the commuting involution graphs of special and general linear groups over an arbitrary field. It turns out that our results also determine the diameter for certain projective special linear groups…
We establish results on holomorphic extension of CR-mappings of class $C^\infty$ between a real-analytic CR-submanifold of $\C^N$ and a real-algebraic CR-submanifold of $\C^{N'}$.
The homology cobordism group of homology cylinders is a generalization of the mapping class group and the string link concordance group. We study this group and its filtrations by subgroups by developing new homomorphisms. First, we define…
Given two graphs $G$ and $H$, we say that $G$ contains $H$ as an induced minor if a graph isomorphic to $H$ can be obtained from $G$ by a sequence of vertex deletions and edge contractions. We study the complexity of Graph Isomorphism on…
We give a new proof of a theorem of D. Calegari that says that the Cayley graph of a surface group with respect to any generating set lying in finitely many mapping class group orbits has infinite diameter. This applies, for instance, to…
A nonpolycyclic nilpotent-by-cyclic group Gamma can be expressed as the HNN extension of a finitely-generated nilpotent group N. The first main result is that quasi-isometric nilpotent-by-cyclic groups are HNN extensions of quasi-isometric…
We show that one relator groups viewed as metric spaces with respect to the word-length metric have finite asymptotic dimension in the sense of Gromov and give an estimate of their asymptotic dimension in terms of the relator length.
In this paper, we show that any knot group maps onto at most finitely many knot groups. This gives an affirmative answer to a conjecture of J. Simon. We also bound the diameter of a closed hyperbolic 3-manifold linearly in terms of the…
In this paper we study a notion of HL-extension (HL standing for Herwig--Lascar) for a structure in a finite relational language $\mathcal{L}$. We give a description of all finite minimal HL-extensions of a given finite…
We establish analytic linearization of s-proper analytic groupoids around invariant submanifolds. We apply this result to show that any such groupoid admits a holomorphic extension.
It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…
The girth of a finitely generated group G is the supremum of the girth of Cayley graphs for G over all finite generating sets. Let G be a finitely generated subgroup of the mapping class group Mod(S), where S is a compact orientable…
Using non-selfadjoint techniques, we establish the Hao-Ng isomorphism for the reduced crossed product and all discrete groups. For the full crossed product an analogous result holds for all discrete groups but the C*-correspondences…
We classify by numerical invariants the finite subgroups $H$ of a primary abelian group $G$ for which every homomorphism or monomorphism of $H$ into $G$, or every endomorphism of $H$, extends to an endomorphism of $G$. We apply these…
We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of…
Clique-width is a well-studied graph parameter. For graphs of bounded clique-width, many problems that are NP-hard in general can be polynomial-time solvable. The fact motivates several studies to investigate whether the clique-width of…