Related papers: Algebraic C(4) and T(4) groups are bi-automatic
We provide a necessary and sufficient condition on a finite flag simplicial complex, L, for which there exists a unique CAT(0) cube complex whose vertex links are all isomorphic to L. We then find new examples of such CAT(0) cube complexes…
Let $E$ be a virtually central extension of the group $G$ by a finitely generated abelian group $A$. We show that $E$ carries a biautomatic structure if and only if $G$ has a biautomatic structure $L$ for which the cohomology class of the…
We show that the Hilbert space compression of any finite dimensional CAT(0) cube complex is 1 and deduce that any discrete group acting properly, co-compactly on a CAT(0) cube complex is exact. The class of groups covered by this theorem…
We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…
A criterion is given which assures that two p-divisible groups X and Y over an algebraically closed field of characteristic p are isomorphic when their p-kernels X[p] and Y[p] are isomorphic.
Using a ``3 by 3 matrix trick'' we previously showed that multiplication in a C*-algebra A, an algebraic structure, is determined by the geometry of the C*-algebra of the 3 by 3 matrices with entries from A. As an application of this…
A graph $G$ with four or more vertices is called bicritical if the removal of any pair of distinct vertices of $G$ results in a graph with a perfect matching. A bicritical graph is minimal if the deletion of each edge results in a…
A multigraph $G$ is near-bipartite if $V(G)$ can be partitioned as $I,F$ such that $I$ is an independent set and $F$ induces a forest. We prove that a multigraph $G$ is near-bipartite when $3|W|-2|E(G[W])|\ge -1$ for every $W\subseteq…
Quadric complexes are square complexes satisfying a certain combinatorial nonpositive curvature condition. These complexes generalize 2-dimensional CAT(0) cube complexes and are a square analog of systolic complexes. We introduce and study…
We describe the development of the theory of automatic groups. We begin with a historical introduction, define the concepts of automatic, biautomatic and combable groups, derive basic properties, then explain how hyperbolic groups and the…
We prove the $K$-theoretic Farrell-Jones conjecture for groups as in the title with coefficient rings and $C^*$-algebras which are stable with respect to compact operators. We use this and Higson-Kasparov's result that the Baum-Connes…
We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on…
An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…
Let X be a proper CAT(0) cube complex admitting a proper cocompact action by a group G. We give three conditions on the action, any one of which ensures that X has a factor system in the sense of [BHS14]. We also prove that one of these…
Any abstract (not necessarily continuous) group automorphism of a simple, compact Lie group must be continuous due to Cartan (1930) and van der Waerden (1933). The purpose of this paper is to study a similar question in nilpotent Lie…
The following discourse is inspired by the works on hyperbolic groups of Epstein, and Neumann/Reeves. Epstein showed that geometrically finite hyperbolic groups are biautomatic. Neumann/Reeves showed that virtually central extensions of…
Small cancellation groups form an interesting class with many desirable properties. It is a well-known fact that small cancellation groups are generic; however, all previously known results of their genericity are asymptotic and provide no…
For any second countable locally compact group G, we construct a simple G-C*-algebra whose full and reduced crossed product norms coincide. We then construct its G-equivariant representation on another simple G-C*-algebra without the…
We introduce a topological property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define…
Suppose that $\tilde{G}$ is a connected reductive group defined over a field $k$, and $\Gamma$ is a finite group acting via $k$-automorphisms of $\tilde{G}$ satisfying a certain quasi-semisimplicity condition. Then the connected part of the…