Related papers: Rewriting Systems in Alternating Knot groups with …
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 construct a finitely presented group with undecidable word problem and with Dehn function bounded by a quadratic function on an infinite set of positive integers.
Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term…
We prove that every monoid $\mathrm{Mon}\langle a,b:a^{\alpha}b^{\beta}a^{\gamma}b^{\delta}=b\rangle$ admits a finite complete rewriting system. Furthermore we prove that $\mathrm{Mon}\langle a,b:ab^2a^2b^2=b\rangle$ is non-hopfian,…
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating,…
Every finite flat finitely presented group scheme G of square free order over a scheme S can be written as an extension of a finite etale S-group scheme G" by a commutative finite flat finitely presented S-group scheme G' that is a direct…
The aim of this note is to prove that monoids $\mathrm{Mon}\langle a,b:aUb=b\rangle$, with $aUb$ of relative length 6, admit finite complete rewriting systems. This is some advance in the understanding the long-standing open problem whether…
Previous work of the authors establishes a criterion on the fundamental group of a knot complement that determines when Dehn surgery on the knot will have a fundamental group that is not left-orderable. We provide a refinement of this…
We study the enumeration of alternating links and tangles, considered up to topological (flype) equivalences. A weight $n$ is given to each connected component, and in particular the limit $n\to 0$ yields information about (alternating)…
Higher-order rewriting is a framework in which one can write higher-order programs and study their properties. One such property is termination: the situation that for all inputs, the program eventually halts its execution and produces an…
Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms to normal forms, as well as comparing the different reduction paths that lead to those normal forms. This higher structure can be captured by…
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair steps are relatively terminating with respect to R. We further…
We show the connection between the relative Dehn function of a finitely generated metabelian group and the distortion function of a corresponding subgroup in the wreath product of two free abelian groups of finite rank. Further, we show…
We show how decreasing diagrams introduced in the theory of rewriting systems can be used to prove coherence type theorems in category theory. We apply this method to describe a coherent presentation of the $0$-Hecke monoid…
We revisit the static dependency pair method for proving termination of higher-order term rewriting and extend it in a number of ways: (1) We introduce a new rewrite formalism designed for general applicability in termination proving of…
On the topic of probabilistic rewriting, there are several works studying both termination and confluence of different systems. While working with a lambda calculus modelling quantum computation, we found a system with probabilistic…
We give the first two algorithms to enumerate all binary words of $\{0,1\}^\ell$ (like Gray codes) while ensuring that the delay and the auxiliary space is independent from $\ell$, i.e., constant time for each word, and constant memory in…
Fox coloring provides a combinatorial framework for studying dihedral representations of the knot group. The less well-known concept of Dehn coloring captures the same data. Recent work of Carter-Silver-Williams clarifies the relationship…
This paper provides the complete table of prime knot projections with their mirror images, without redundancy, up to eight double points systematically thorough a finite procedure by flypes. In this paper, we show how to tabulate the knot…
This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource management is given, and the respective computational properties of each…