Related papers: Rewriting Systems in Alternating Knot groups with …
We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In a previous…
Proof terms in term rewriting are a representation means for reduction sequences, and more in general for contraction activity, allowing to distinguish e.g simultaneous from sequential reduction. Proof terms for finitary, first-order,…
An ideal triangulation $\mathcal{T}$ of a hyperbolic 3-manifold $M$ with one cusp is non-peripheral if no edge of $\mathcal{T}$ is homotopic to a curve in the boundary torus of $M$. For such a triangulation, the gluing and completeness…
In this paper we provide an alternative solution to a result by Juh\'{a}sz that the twisted conjugacy problem for odd dihedral Artin groups is solvable, that is, groups with presentation $G(m) = \langle a,b \; | \; _{m}(a,b) = {}_{m}(b,a)…
We show that any exceptional non-trivial Dehn surgery on a twist knot, except the trefoil, yields a 3-manifold whose fundamental group is left-orderable. This is a generalization of a result of Clay, Lidman and Watson, and also gives a new…
Unifying various constructions of quandles including Coxeter quandles, free quandles, knot quandles of prime knots and Dehn quandles of orientable surfaces, we introduce Dehn quandles of groups with respect to their subsets. It turns out…
The paper gives two approaches to write explicit presentations for the class of Dehn quandles using presentations of their underlying groups. The first approach gives finite presentations for Dehn quandles of a class of Garside groups and…
Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages,…
We introduce a new symbolic representation based on an original generalization of counter abstraction. Unlike classical counter abstraction (used in the analysis of parameterized systems with unordered or unstructured topologies) the new…
We propose a generic termination proof method for rewriting under strategies, based on an explicit induction on the termination property. Rewriting trees on ground terms are modeled by proof trees, generated by alternatively applying…
This paper is devoted to prove the existence of $q$-periodic alternating projections of prime alternating $q$-periodic knots. The main tool is the Menasco-Thistlethwaite's Flyping theorem. Let $K$ be an oriented prime alternating knot that…
This article is devoted to the study of prime alternating +achiral knots. In the case of arborescent knots, we prove in +AAA Visibility Theorem 5.1, that the symmetry is visible on a certain projection (not necessarily minimal) and that it…
This paper is an extended abstract of an analysis of term rewriting where the terms in the rewrite rules as well as the term to be rewritten are compressed by a singleton tree grammar (STG). This form of compression is more general than…
Over the recent years, the theory of rewriting has been used and extended in order to provide systematic techniques to show coherence results for strict higher categories. Here, we investigate a further generalization to Gray categories,…
Dependency pairs are a key concept at the core of modern automated termination provers for first-order term rewriting systems. In this paper, we introduce an extension of this technique for a large class of dependently-typed higher-order…
We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite…
Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…
This is the third paper in a series devoted to enumerating the prime alternating knots and links. This paper establishes a method for enumerating the prime alternating links. It is shown that one may choose any prime alternating link…
We introduce a combinatorial property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a canonical finite presentation. We also define…
We present an enhanced prime decomposition theorem for knots that gives the isotopy classes of composite knots that can be constructed from a given list of prime factors (allowing for the mirroring and orientation reversing for each…