Related papers: Rewriting Systems in Alternating Knot groups with …

The classical attenuation regulation of gene expression in bacteria is considered. We propose to represent the secondary RNA structure in the leader region of a gene or an operon by a term, and we give a probabilistic term rewriting system…

A series of works has established rewriting as an essential tool in order to prove coherence properties of algebraic structures, such as MacLane's coherence theorem for monoidal categories, based on the observation that, under reasonable…

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram…

A palindrome is a word that reads the same left-to-right as right-to-left. We show that every simple group has a finite generating set $X$, such that every element of it can be written as a palindrome in the letters of $X$. Moreover, every…

We give a uniform explicit construction of finite two-generator presentations for the special linear groups over the integers in all ranks at least three. The construction builds on the generating-pair work of Conder--Liversidge--Vsemirnov…

There are various results that frame left-orderability of a group as a geometric property. Indeed, the fundamental group of a 3-manifold is left-orderable whenever the first Betti number is positive; in the case that the first Betti number…

In synchronous rewriting, the productions of two rewriting systems are paired and applied synchronously in the derivation of a pair of strings. We present a new synchronous rewriting system and argue that it can handle certain phenomena…

For pseudo-Anosov mapping tori with co-orientable invariant foliations and monodromies reversing their co-orientations, a family of taut foliations was constructed in previous work on Dehn fillings with all rational slopes outside a…

A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages which is closed under boolean operations…

We introduce a new method of detecting when the fundamental group of a Dehn surgery on a knot admits a left-ordering, a method which is particularly useful for 2-bridge knots. As an illustration of this method, we show that all Dehn…

Let $p$ be a prime number, and let $k$ be an algebraically closed field of characteristic $p$. We show that the tame fundamental group of a smooth affine curve over $k$ is a projective profinite group. We prove that the fundamental group of…

We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS)…

Let $p$ be a fixed prime. For a finite group generated by elements of order $p$, the $p$-width is defined to be the minimal $k\in\mathbb{N}$ such that any group element can be written as a product of at most $k$ elements of order $p$. Let…

Any knot group is the image of the group of a prime knot by a homomorphism that preserves peripheral structure. In fact, there are infinitely many such prime knots. A related partial order on knots is defined, and its properties are…

We give a finite presentation of the mapping class group of an oriented (possibly bounded) surface of genus greater or equal than 1, considering Dehn twists on a very simple set of curves.

In this paper we show how string rewriting methods can be applied to give a new method of computing double cosets. Previous methods for double cosets were enumerative and thus restricted to finite examples. Our rewriting methods do not…

First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we…

I propose a class of non-positional numeral systems where numbers are represented by Dyck words, with the systems arising from a recursive extension of prime factorization. After describing two proper subsets of the Dyck language capable of…

Defined on Birman-Ko-Lee monoids, the rotating normal form has strong connections with the Dehornoy's braid ordering. It can be seen as a process for selecting between all the representative words of a Birman-Ko-Lee braid a particular one,…

A coherent presentation of an n-category is a presentation by generators, relations and relations among relations. Confluent and terminating rewriting systems generate coherent presentations, whose relations among relations are defined by…