Related papers: On the algorithmic construction of classifying spa…

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…

We present two explicit combinatorial constructions of finitely summable reduced "Gamma"-elements $\gamma_r\,\in\,KK(C^*_r(\Gamma),{\mathbb C})$ for any word-hyperbolic group $(\Gamma,S)$ and obtain summability bounds for them in terms of…

Isomorphism is central to the structure of mathematics and has been formalized in various ways within dependent type theory. All previous treatments have done this by replacing quantification over sets with quantification over groupoids of…

A locally compact group $G$ is a cocompact envelope of a group $\Gamma$ if $G$ contains a copy of $\Gamma$ as a discrete and cocompact subgroup. We study the problem that takes two finitely generated groups $\Gamma,\Lambda$ having a common…

We analyze the classification problem for finitely generated orderable groups from the viewpoint of descriptive set theory. We analyze the standard Borel space of finitely generated left-orderable groups, and the subspace of finitely…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…

We give a complete solution, for discrete countable groups, to the problem of defining and computing a geometric pairing between the left hand side of the Baum-Connes assembly map, given in terms of geometric cycles associated to proper…

We calculate the bivariant local cyclic cohomology of the Banach convolution algebra of summable functions on a word-hyperbolic group. Our result implies that the Banach algebraic assembly map in local cyclic homology is an isomorphism for…

Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to…

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

We study the (virtual) indicability of the automorphism group $Aut(A_\Gamma)$ of the right-angled Artin group $A_\Gamma$ associated to a simplicial graph $\Gamma$. First, we identify two conditions -- denoted (B1) and (B2) -- on $\Gamma$…

Let $V$ be a complete discrete valuation ring, and let $G$ be either a word-hyperbolic group or a reductive $p$-adic group. We prove that the canonical morphism $V[G] \to V[G]^\dagger$ from the group algebra to its dagger completion is an…

Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

Let $X$ and $Y$ be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group $G$. Assuming that $Y$ is $d$-connected and $\dim X\le 2d$, for some $d\geq 1$, we provide an…

We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a regular set of words, and the interpretation of the…

We show that each connected group scheme of finite type over an arbitrary ground field is isomorphic to the component of the identity inside the automorphism group scheme of some projective, geometrically integral scheme. The main…

We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…

For every hyperbolic group and more general hyperbolic graphs, we construct an equivariant ideal bicombing: this is a homological analogue of the geodesic flow on negatively curved manifolds. We then construct a cohomological invariant…