Related papers: Complexity of word problems for HNN-extensions
In this paper we study the word problem of groups corresponding to tessellations of the hyperbolic plane. In particular using the Fibonacci technology developed by the second author we show that groups corresponding to the pentagrid or the…
We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…
A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…
Let $G$ be a toral relatively hyperbolic group, and let $\varphi\in\mathrm{Aut}(G)$. We prove that, under iteration of $\varphi$, the conjugacy length $||\varphi^n(g)||$ of every element $g\in G$ grows like $n^d\lambda^n$ for some…
We prove that the power word problem for certain metabelian subgroups of $\mathsf{GL}(2,\mathbb{C})$ (including the solvable Baumslag-Solitar groups $\mathsf{BS}(1,q) = \langle a,t \mid t a t^{-1} = a^q \rangle$) belongs to the circuit…
This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
We study the following generalization of the Hamiltonian cycle problem: Given integers $a,b$ and graph $G$, does there exist a closed walk in $G$ that visits every vertex at least $a$ times and at most $b$ times? Equivalently, does there…
For certain problems involving vector fields, it is possible to find an associated imaginary field that, in conjunction with the first, forms a complex field for which the equation can be solved. This result is generalized to arbitrary…
In this work we introduce a new succinct variant of the word problem in a finitely generated group $G$, which we call the power word problem: the input word may contain powers $p^x$, where $p$ is a finite word over generators of $G$ and $x$…
We give a simple combinatorial criterion, in terms of an action on a hyperbolic simplicial complex, for a group to be hierarchically hyperbolic. We apply this to show that quotients of mapping class groups by large powers of Dehn twists are…
Let $H$ be a group, $m$ be a positive integer, $Ext_m H$ be the set of all isomorphic in $G$ classes of group monomorphisms $\varphi: H \rightarrow G$ such that index of $\varphi(H)$ in $G$ is $m$. The main goal of this paper is to describe…
We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…
Motivated by an application where we try to make proofs for Description Logic inferences smaller by rewriting, we consider the following decision problem, which we call the small term reachability problem: given a term rewriting system $R$,…
The VertexCover problem is proven to be computationally hard in different ways: It is NP-complete to find an optimal solution and even NP-hard to find an approximation with reasonable factors. In contrast, recent experiments suggest that on…
Prolongations of a group extension can be studied in a more general situation that we call group extensions of the co-type of a crossed module. Cohomology classification of such extensions is obtained by applying the obstruction theory of…
The (n,k)-hypersimplex is the convex hull of all 0/1-vectors of length n with coordinate sum k. We explicitly determine the extension complexity of all hypersimplices as well as of certain classes of combinatorial hypersimplices. To that…
In this paper we prove several results regarding decidability of the membership problem for certain submonoids in amalgamated free products and HNN extensions of groups. These general results are then applied to solve the prefix membership…
The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. A word (pattern) over a finite set is said to be unavoidable if, for all but finitely many words, there exists a morphism mapping…
Given the Hilbert space compression of two groups, we find bounds on the Hilbert space compression of their free product. We also investigate the Hilbert space compression of an HNN-extension of a group relative to a finite normal subgroup…