Related papers: Free crossed resolutions of groups and presentatio…
The results of computer searches for large graphs with given (small) degree and diameter are presented. The new graphs are Cayley graphs of semidirect products of cyclic groups and related groups. One fundamental use of our ``dense graphs''…
We introduce the separability complex, a one-complex associated to a finite regular cover of the rose and show that it is connected if and only if the fundamental group of the associated cover is generated by its intersection with the set…
This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…
Quasirational presentations ($QR$-presentations) of (pro-$p$)groups are studied. Such presentations include, in particular, aspherical presentations of discrete groups and their subpresentations and pro-$p$-groups with a single defining…
This is a common introduction to math.RT/0101170, math.RT/0306333, math.RT/0506043, math.RT/0601028. Compared to these references there are new results including (i) a description of a separable closure of an extension of transcendence…
We introduce the concept of quasirational relation modules for discrete and pro-$p$ presentations of discrete and pro-$p$ groups and show that aspherical presentations and their subpresentations are quasirational. In the pro-$p$-case…
We introduce the notion of isoclinism among crossed modules of Lie algebras, which will be called "Lie crossed modules" hereafter, and investigate some basic properties. Additionally, we introduce the notion of class preserving actor of a…
We define the notion of rough Cayley graph for compactly generated locally compact groups in terms of quasi-actions. We construct such a graph for any compactly generated locally compact group using quasi-lattices and show uniqueness up to…
A combinatorial summation identity over the lattice of labelled hypertrees is established that allows one to gain concrete information on the Euler characteristics of various automorphism groups of free products of groups.
In this paper, we introduce the concept of crossed module for Hom-Leibniz-Rinehart algebras. We study the cohomology and extension theory of Hom-Leibniz-Rinehart algebras. It is proved that there is one-to-one correspondence between…
Building on work of Brandt and Terao in their study of $k$-formality, we introduce a co-chain complex associated to a multi-arrangement and prove that its cohomologies determine freeness of the associated module of multi-derivations. This…
We investigate Cayley graphs of graph products by showing that graph products with vertex groups that have isomorphic Cayley graphs yield isomorphic Cayley graphs.
We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…
We bring a linkage from representation theory of Lie groups to homotopy theory for maps between flag manifolds. As applications we derive from representation theory abundant families of homotopy classes of maps between flag manifolds whose…
We present new, unified proofs for the cell-like, $\mathbb{Z}/p$-, and $\mathbb{Q}$-resolution theorems. Our arguments employ extensions that are much simpler then those used by our predecessors. The techniques allow us to solve problems…
A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show…
For a zero-relation algebra over a field $\mathcal K$, Crawley-Boevey introduced the concept of a tree module and provided a combinatorial description of a basis for the space of homomorphisms between two tree modules--the basis elements…
We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…
We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.
A word in a group is called a test element if any endomorphism fixing it is necessarily an automorphism. In this note, we give a sufficient condition in geometry to construct test elements for monomorphisms of a free group, by using the…