Related papers: On a generalization of Dehn's algorithm

We study Dehn twists in the outer automorphism group of a finitely generated non-abelian free group. Our main result states that, under certain compatibility conditions, sufficiently large powers of finitely many Dehn twists generate a…

We prove that Abels' group over an arbitrary nondiscrete locally compact field has a quadratic Dehn function. As applications, we exhibit connected Lie groups and polycyclic groups whose asymptotic cones have uncountable abelian fundamental…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

For the whole class of linear term rewriting systems, we define \emph{bottom-up rewriting} which is a restriction of the usual notion of rewriting. We show that bottom-up rewriting effectively inverse-preserves recognizability and analyze…

We consider finite deterministic automata such that their alphabets consist of exactly one letter of defect 1 and a set of permutations of the state set. We study under which conditions such an automaton is completely reachable. We focus…

Universal Cycles, or U-cycles, as originally defined by de Bruijn, are an efficient method to exhibit a large class of combinatorial objects in a compressed fashion, and with no repeats. de Bruijn's theorem states that U-cycles for $n$…

For every pair of positive integers $p > q$ we construct a one-relator group $R_{p,q}$ whose Dehn function is $\simeq n^{2 \alpha}$ where $\alpha = \log_2(2p / q)$. The group $R_{p,q}$ has no subgroup isomorphic to a Baumslag-Solitar group…

Searching and sorting used as a subroutine in many important algorithms. Quantum algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block)…

We consider a general class of non-linear Bellman equations. These open up a design space of algorithms that have interesting properties, which has two potential advantages. First, we can perhaps better model natural phenomena. For…

We construct group codes over two letters (i.e., bases of subgroups of a two-generated free group) with special properties. Such group codes can be used for reducing algorithmic problems over large alphabets to algorithmic problems over a…

This paper gives a complete selfcontained proof of our result announced in hep-th/9909126 showing that renormalization in quantum field theory is a special instance of a general mathematical procedure of extraction of finite values based on…

The study of the word problems of groups dates back to Dehn in 1911, and has been a central topic of study in both group theory and computability theory. As most naturally occurring presentations of groups are recursive, their word problems…

We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…

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…

In this paper we extend the algorithm for extraspecial groups in \cite{iss07}, and show that the hidden subgroup problem in nil-2 groups, that is in groups of nilpotency class at most 2, can be solved efficiently by a quantum procedure. The…

Let $F_n$ be the free group of a finite rank $n$. We study orbits $Orb_{\phi}(u)$, where $u$ is an element of the group $F_n$, under the action of an automorphism $\phi$. If an orbit like that is finite, we determine precisely what its…

We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an…

Let $X=S\times E \times B$ be the metric product of a symmetric space $S$ of noncompact type, a Euclidean space $E$ and a product $B$ of Euclidean buildings. Let $\Gamma$ be a discrete group acting isometrically and cocompactly on $X$. We…

It is well known that Universal Cycles of $k$-letter words on an $n$-letter alphabet exist for all $k$ and $n$. In this paper, we prove that Universal Cycles exist for restricted classes of words, including: non-bijections, equitable words…

We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.