Related papers: On a generalization of Dehn's algorithm

Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an…

We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also…

A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with…

We consider whether given a simple, finite description of a group in the form of an algorithm, it is possible to algorithmically determine if the corresponding group has some specified property or not. When there is such an algorithm, we…

Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…

An automorphism $\alpha$ of a group $G$ is normal if it fixes every normal subgroup of $G$ setwise. We give an algebraic description of normal automorphisms of relatively hyperbolic groups. In particular, we prove that for any relatively…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

We revisit a classical crossword filling puzzle which already appeared in Garey\&Jonhson's book. We are given a grid with $n$ vertical and horizontal slots and a dictionary with $m$ words and are asked to place words from the dictionary in…

This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has…

We demonstrate under appropriate finiteness conditions that a coarse embedding induces an inequality of homological Dehn functions. Applications of the main results include a characterization of what finitely presentable groups may admit a…

Accessible groups for which the language of all words defining the identity is accepted by a certain class of nested stack automata are virtually free.

We propose a new algorithm for Dehn surgery problem, finding exceptional Dehn filling slopes for a given hyperbolic 3-manifold with a torus boundary, using a quantum invariant called "3D index". The invariant is defined using an ideal…

We study the Dehn function of connected Lie groups. We show that this function is always exponential or polynomially bounded, according to the geometry of weights and of the 2-cohomology of their Lie algebras. Our work, which also addresses…

The hyperelliptic Torelli group is the subgroup of the mapping class group consisting of elements that act trivially on the homology of the surface and that also commute with some fixed hyperelliptic involution. The authors and Putman…

Jumping automata are finite automata that read their input in a non-consecutive manner, disregarding the order of the letters in the word. We introduce and study jumping automata over infinite words. Unlike the setting of finite words,…

Many key invariants in the representation theory of classical groups (symmetric groups $S_n$, matrix groups $GL_n$, $O_n$, $Sp_{2n}$) are polynomials in $n$ (e.g., dimensions of irreducible representations). This allowed Deligne to extend…

We find a polynomial (n^6) isoperimetric function for Artin groups, the defining graph of which contains no edges labelled by 3. This in particular shows that even Artin groups have solvable word problem. We use small cancellation theory of…

This paper continues the 2012 STACS contribution by Diekert, Ushakov, and the author. We extend the results published in the proceedings in two ways. First, we show that the data structure of power circuits can be generalized to work with…

We show that groups presented by inverse-closed finite convergent length-reducing rewriting systems are characterised by a striking geometric property: their Cayley graphs are geodetic and side-lengths of non-degenerate triangles are…

The isomorphism problem for finite groups of order n (GpI) has long been known to be solvable in $n^{\log n+O(1)}$ time, but only recently were polynomial-time algorithms designed for several interesting group classes. Inspired by recent…