Searcharxiv⌕ Search

arXiv subjects

Volker Diekert

Publications and source records attributed to Volker Diekert.

39 records · Page 3Linked to original sources

On Computing Geodesics in Baumslag-Solitar Groups

We introduce the peak normal form of elements of the Baumslag-Solitar groups BS(p,q). This normal form is very close to the length-lexicographical normal form, but more symmetric. Both normal forms are geodesic. This means the normal form of an element $u^{-1}v$ yields the shortest path between $u$ and $v$ in the Cayley graph. For horocyclic elements the peak normal form and the length-lexicographical normal form coincide. The main result of this paper is that we can compute the peak normal form in polynomial time if $p$ divides $q$. As consequence we can compute geodesic lengths in this case. In particular, this gives a partial answer to Question 1 in Elder et al. 2009, arXiv.org:0907.3258. For arbitrary $p$ and $q$ it is possible to compute the peak normal form (length-lexicolgraphical normal form resp.) also for elements in the horocyclic subgroup and, more generally, for elements which we call hills. This approach leads to a linear time reduction of the problem of computing geodesics to the problem of computing geodesics for Britton-reduced words where the $t$-sequence starts with $t^{-1}$ and ends with $t$. To solve the general case in polynomial time for arbitrary $p$ and $q$ remains a challenging open problem.

math.GR↗

Geodesic rewriting systems and pregroups

In this paper we study rewriting systems for groups and monoids, focusing on situations where finite convergent systems may be difficult to find or do not exist. We consider systems which have no length increasing rules and are confluent and then systems in which the length reducing rules lead to geodesics. Combining these properties we arrive at our main object of study which we call geodesically perfect rewriting systems. We show that these are well-behaved and convenient to use, and give several examples of classes of groups for which they can be constructed from natural presentations. We describe a Knuth-Bendix completion process to construct such systems, show how they may be found with the help of Stallings' pregroups and conversely may be used to construct such pregroups.

math.GR↗

The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete

It is known that the existential theory of equations in free groups is decidable. This is a famous result of Makanin. On the other hand it has been shown that the scheme of his algorithm is not primitive recursive. In this paper we present an algorithm that works in polynomial space, even in the more general setting where each variable has a rational constraint, that is, the solution has to respect a specification given by a regular word language. Our main result states that the existential theory of equations in free groups with rational constraints is PSPACE-complete. We obtain this result as a corollary of the corresponding statement about free monoids with involution.

cs.DS↗