Related papers: Cartesian subgroups in graph products of groups
We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…
This document aims to give a self-contained account of the parts of abelian group theory that are most relevant for algebraic topology. It is almost purely expository, although there are some slightly unusual features in the treatment of…
A notion of \emph{graph-wreath product} is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type $\operatorname{F}_n$. Under various additional assumptions we show…
We study conditions under which subdirect products of various types of algebraic structures are finitely generated or finitely presented. In the case of two factors, we prove general results for arbitrary congruence permutable varieties,…
Given a graph G with a distinguished vertex s, the critical group of (G,s) is the cokernel of their reduced Laplacian matrix L(G,s). In this article we generalize the concept of the critical group to the cokernel of any matrix with entries…
Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…
We investigate Cayley graphs of graph products by showing that graph products with vertex groups that have isomorphic Cayley graphs yield isomorphic Cayley graphs.
This paper classifies the derivations of group algebras in terms of the generators and defining relations of the group. If $RG$ is a group ring, where $R$ is commutative and $S$ is a set of generators of $G$ then necessary and sufficient…
We define and study dense Frechet subalgebras of compact quantum groups consisting of elements rapidly decreasing with respect to an unbounded sequence of real numbers. Further, this sequence can be viewed as the eigenvalues of a Dirac-like…
The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime.…
This article is dedicated to the study of the acylindrical hyperbolicity of automorphism groups of graph products of groups. Our main result is that, if $\Gamma$ is a finite graph which contains at least two vertices and is not a join and…
We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.
Group lattices (Cayley digraphs) of a discrete group are in natural correspondence with differential calculi on the group. On such a differential calculus geometric structures can be introduced following general recipes of noncommutative…
We introduce a notion of partition wreath product of a finite group by a partition quantum group, a construction motivated on the one hand by classical wreath products and on the other hand by the free wreath product of J. Bichon. We…
We describe the (co)homology of a certain family of normal subgroups of right-angled Artin groups that contain the commutator subgroup, as modules over the quotient group. We do so in terms of (skew) commutative algebra of squarefree…
The main goal of this paper is a calculation of the integral (co)homology of the group of symmetric automorphisms of a free product. We proceed by giving a geometric interpretation of symmetric automorphisms via a moduli space of certain…
Generators and relations are given for the subalgebra of cocommutative elements in the quantized coordinate rings of the classical groups, where the deformation parameter q is transcendental. This is a ring theoretic formulation of the well…
We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this…
We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be…
We generalise the notion of a separating intersection of links (SIL) to give necessary and sufficient criteria on the defining graph $\Gamma$ of a right-angled Coxeter group $W_\Gamma$ so that its outer automorphism group is large: that is,…