Related papers: The word problem in Hanoi Towers groups
We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…
A subalgebra pair of semisimple complex algebras B < A with inclusion matrix M is depth two if MM^t M < nM for some positive integer n and all corresponding entries. If A and B are the group algebras of finite group-subgroup pair H < G, the…
We investigate the fundamental group of Griffiths' space, and the first singular homology group of this space and of the Hawaiian Earring by using (countable) reduced tame words. We prove that two such words represent the same element in…
Our main theorem is that the word problem in the Artin group G = <a,b,c | aba=bab, ac=ca, {}_{n}(b,c) = {}_{n}(c,b) > for n >= 5 can be solved using a system R of length preserving rewrite rules that, together with free reduction, can be…
We develop practical techniques to compute with arithmetic groups $H\leq \mathrm{SL}(n,\mathbb{Q})$ for $n>2$. Our approach relies on constructing a principal congruence subgroup in $H$. Problems solved include testing membership in $H$,…
We study the logic FO(~), the extension of first-order logic with team semantics by unrestricted Boolean negation. It was recently shown axiomatizable, but otherwise has not yet received much attention in questions of computational…
The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P or is NP-complete (Feder-Vardi, 1993). It has been verified for conservative problems (also known as list homomorphism problems) by A.…
We prove a general solvable subgroup theorem in terms of length functions. As applications, we obtain a solvable subgroup theorem in dynamical systems: any solvable group of finite Hirsch length acting on a smooth manifold with uniformly…
We define the Homomorphism Extension (HomExt) problem: given a group $G$, a subgroup $M \leq G$ and a homomorphism $\varphi: M \to H$, decide whether or not there exists a homomorphism $\widetilde{\varphi}: G\to H$ extending $\varphi$,…
Boolean-width is a recently introduced graph parameter. Many problems are fixed parameter tractable when parametrized by boolean-width, for instance "Minimum Weighted Dominating Set" (MWDS) problem can be solved in $O^*(2^{3k})$ time given…
In this paper we formulate some conjectures in sub-Riemannian geometry concerning a characterisation of the Koranyi-Kaplan ball in a group of Heisenberg type through the existence of a solution to suitably overdetermined problems. We prove…
The hidden subgroup problem (HSP) plays an important role in quantum computation, because many quantum algorithms that are exponentially faster than classical algorithms can be casted in the HSP structure. In this paper, we present a new…
The Hidden Subgroup Problem (HSP) is a computational problem which includes as special cases integer factorization, the discrete logarithm problem, graph isomorphism, and the shortest vector problem. The celebrated polynomial-time quantum…
We present deterministic algorithms for the Hidden Subgroup Problem. The first algorithm, for abelian groups, achieves the same asymptotic worst-case query complexity as the optimal randomized algorithm, namely O($\sqrt{ n}\,$), where $n$…
$2$-stratifolds are a generalization of $2$-manifolds in that there are disjoint simple closed curves where several sheets meet. We show that the word problem for fundamental groups of $2$-stratifolds is solvable.
We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…
We investigate subgroups of the group PLo(I) of piecewise-linear, orientation preserving homeomorphisms of the unit interval with finitely many breaks in slope, and also subgroups of Thompson's group F. We find geometric criteria…
We give an $\mathcal{O}(n \log n)$-time, $\mathcal{O}(n)$-space algorithm for factoring a string into the minimum number of palindromic substrings. That is, given a string $S [1..n]$, in $\mathcal{O}(n \log n)$ time our algorithm returns…
For $n\geq 2$ we consider $(n-1)$-connected closed manifolds of dimension at most $(3n-2)$. We prove that away from a finite set of primes, the $p$-local homotopy groups of $M$ are determined by the dimension of the space of indecomposable…
In 1951, Higman constructed a remarkable group $$H=\left\langle a,b,c,d \, \left| \, b^a = b^2, c^b = c^2, d^c = d^2, a^d = a^2 \right. \right\rangle$$ and used it to produce the first examples of infinite simple groups. By studying fixed…