Related papers: On groups presented by inverse-closed finite conve…
We study biinvariant word metrics on groups. We provide an efficient algorithm for computing the biinvariant word norm on a finitely generated free group and we construct an isometric embedding of a locally compact tree into the biinvariant…
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…
Algorithmic methods for the explicit inversion of the indefinite double covering maps are proposed. These are based on either the Givens decomposition or the polar decomposition of the given matrix in the proper, indefinite orthogonal group…
We show that the pure mapping class group is uniformly perfect for a certain class of infinite type surfaces with noncompact boundary components. We then combine this result with recent work in the remaining cases to give a complete…
We construct group codes over two letters (i.e., bases of subgroups of a two-generated free group) with special properties. Such group codes can be used for reducing algorithmic problems over large alphabets to algorithmic problems over a…
We generalize [Vav] to give sufficient conditions, primarily on coarse geometry, to ensure that a subset of a Cayley graph is a finite Hausdorff distance from a subgroup. Using this result, we prove a partial converse to the Flat Torus…
We prove that convex-cocompact representations of finitely generated groups in the group of isometries of the infinite-dimensional hyperbolic space form an open set in the space of representations, allowing us to deform these…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…
In a seminal paper, Stallings introduced folding of morphisms of graphs. One consequence of folding is the representation of finitely-generated subgroups of a finite-rank free group as immersions of finite graphs. Stallings's methods allow…
Given a permutation group $G$, the derangement graph of $G$ is the Cayley graph with connection set the derangements of $G$. The group $G$ is said to be innately transitive if $G$ has a transitive minimal normal subgroup. Clearly, every…
A reduction $\varphi$ of an ordered group $(G,P)$ to another ordered group is an order homomorphism which maps each interval $[1,p]$ bijectively onto $[1, \varphi(p)]$. We show that if $(G,P)$ is weakly quasi-lattice ordered and reduces to…
Let $\Gamma=\mathrm{Cay}(G,S)$ be a Cayley digraph on a group $G$ and let $A=\mathrm{Aut}(\Gamma)$. The Cayley index of $\Gamma$ is $|A:G|$. It has previously been shown that, if $p$ is a prime, $G$ is a cyclic $p$-group and $A$ contains a…
We prove that the reduced C*-algebras of centerless mapping class groups and outer automorphism groups of free groups are simple, as are the irreducible pure subgroups of mapping class groups and the analogous subgroups of outer…
We describe a flexible construction that produces triples of finitely generated, residually finite groups $M\hookrightarrow P \hookrightarrow \Gamma$, where the maps induce isomorphisms of profinite completions…
This note is a continuation of the study of the relationship between the geometry of Cayley graphs and the size of its metric-functional boundary. We show that, if there exists a Cayley graph with finitely many Busemann points, then the…
We exhibit a finitely generated group $\M$ whose rational homology is isomorphic to the rational stable homology of the mapping class group. It is defined as a mapping class group associated to a surface $\su$ of infinite genus, and…
We consider certain correspondences on a Riemann surface, and show that they admit a weak form of hyperbolicity: sufficiently long loops get shorter under lifting at a fixed point and closing. In terms of their algebraic encoding by bisets,…
A graph is called claw-free if it contains no induced subgraph isomorphic to the complete bipartite graph $K_{1, 3}$. The undirected power graph of a group $G$ has vertices the elements of $G$, with an edge between $g_1$ and $g_2$ if one of…
The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…
We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…