Related papers: On the algorithmic construction of classifying spa…

While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special…

Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…

We present a method for computing the number of epimorphisms from a finitely-presented group G to a finite solvable group \Gamma, which generalizes a formula of G\"aschutz. Key to this approach are the degree 1 and 2 cohomology groups of G,…

Let $\Gamma$ be a discrete group of finite virtual cohomological dimension with certain finiteness conditions of the type satisfied by arithmetic groups. We define a representation ring for $\Gamma$, determined on its elements of finite…

Let $\Gamma$ be a finitely generated group which is hyperbolic relative to a finite family $\{H_1,...,H_n\}$ of subgroups. We prove that $\Gamma$ is uniformly embeddable in a Hilbert space if and only if each subgroup $H_i$ is uniformly…

Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…

Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. We characterize the Hamiltonicity of $\Gamma$ via the structure of the cohomology algebra of $A(\Gamma)$. In doing so, we define and develop a…

Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…

Any action of a group $\Gamma$ on $\mathbb H^3$ by isometries yields a class in degree three bounded cohomology by pulling back the volume cocycle to $\Gamma$. We prove that the bounded cohomology of finitely generated Kleinian groups…

The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…

We consider the cohomology group $H^1(\Gamma, \rho)$ of a discrete subgroup $\Gamma\subset G=SU(n, 1)$ and the symmetric tensor representation $\rho$ on $S^m(\mathbb C^{n+1})$. We give an elementary proof of the Eichler-Shimura isomorphism…

We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…

Thurston has claimed (unpublished) that central extensions of word hyperbolic groups by finitely generated abelian groups are automatic. We show that they are in fact biautomatic. Further, we show that every 2-dimensional cohomology class…

This paper is devoted to the computation of the space $H_b^2(\Gamma,H;\mathbb{R})$, where $\Gamma$ is a free group of finite rank $n\geq 2$ and $H$ is a subgroup of finite rank. More precisely we prove that $H$ has infinite index in…

This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…

Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…

Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…

Let $\Gamma$ be a word hyperbolic group with a cyclic JSJ decomposition that has only rigid vertex groups, which are all fundamental groups of closed surface groups. We show that any group $H$ quasi-isometric to $\Gamma$ is abstractly…

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…

In this article, we will show that the automorphism group of any hypergraph is essentially equal to the determinant of some matrix over a ring generated from the set of ground points. With this, we are also able to determine whether two…