Related papers: Building Groups From Restricted Diagrams of Groups

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

We give a necessary and sufficient condition for the fundamental group of a finite graph of groups with infinite cyclic edge groups to be acylindrically hyperbolic, from which it follows that a finitely generated group splitting over Z…

The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…

We consider a few types of bounded homomorphisms on a topological group. These classes of bounded homomorphisms are, in a sense, weaker than the class of continuous homomorphisms. We show that with appropriate topologies each class of these…

We develop the fundamental theory to study cubical isometry groups as totally disconnected, locally compact groups. We show how cubical isometries are determined by their local actions and how this can be applied in explicit constructions.…

Given a graph $G$, a configuration space of $G$ can be thought of as the set of all possible configurations of "robots" which can move throughout $G$, subject to some constraints. We introduce a type of configuration space which we call…

We construct a finitely presented group with property (T) which can not act on on reasonable spaces. Such group is constructed using an generalization of Hall embedding theorem, where property (T) is added at the expense of weakening the…

We study fundamental groups of non compact Riemannian manifolds. We find conditions which ensure that the fundamental group is trivial, finite or finitely generated.

Suppose that $\Gamma$ is a non-empty connected graph, $\mathfrak{G}$ is the fundamental group of a graph of groups over $\Gamma$, and $\mathcal{C}$ is a root class of groups (the last means that $\mathcal{C}$ contains non-trivial groups and…

In this paper we consider two functions related to the arithmetic and geometric means of element orders of a finite group, showing that certain lower bounds on such functions strongly affect the group structure. In particular, for every…

We provide a novel family of generative block-models for random graphs that naturally incorporates degree distributions: the block-constrained configuration model. Block-constrained configuration models build on the generalised…

In this article we survey and examine the realizability of $p$-groups as Galois groups over arbitrary fields. In particular we consider various cohomological criteria that lead to necessary and sufficient conditions for the realizability of…

In this paper it is shown how to construct a finite topological space $X$ for a given finitely presentable group $G$ such that $\pi_1(X)\cong G$. Our construction is not optimal in the sense that the cardinality of the space $X$ might not…

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

In this paper, we investigate the profit-driven team grouping problem in social networks. We consider a setting in which people possess different skills, and the compatibility between these individuals is captured by a social network.…

We start with a small paradigm shift about group representations, namely the observation that restriction to a subgroup can be understood as an extension-of-scalars. We deduce that, given a group $G$, the derived and the stable categories…

For several instances of metric largeness like enlargeability or having hyperspherical universal covers, we construct non-large vector subspaces in the rational homology of finitely generated groups. The functorial properties of this…

We wish to understand how irreducible representations of a group G behave when restricted to a subgroup G' (the branching problem). Our primary concern is with representations of reductive Lie groups, which involve both algebraic and…

An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…

We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…