Related papers: Using groups for investigating rewrite systems
We describe affine monoids whose group of invertible elements is an active semidirect product of a unipotent group and a torus, in terms of comultiplications on the algebra of regular functions. We introduce the notion of a root monoid,…
Based on our studies done on two-dimensional autonomous systems, forced non-autonomous systems and time-delayed systems, we propose a unified methodology - that uses renormalization group theory - for finding out existence of periodic…
We present some fundamental results on (possibly nonlinear) algebraic semigroups and monoids. These include a version of Chevalley's structure theorem for irreducible algebraic monoids, and the description of all algebraic semigroup…
We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…
Term rewriting is a Turing complete model of computation. When taught to students of computer science, key properties of computation as well as techniques to analyze programs on an abstract level are conveyed. This paper gives a swift…
Termination is an important property of programs; notably required for programs formulated in proof assistants. It is a very active subject of research in the Turing-complete formalism of term rewriting systems, where many methods and tools…
We introduce partial group algebras with relations in a purely algebraic framework. Given a group and a set of relations, we define an algebraic partial action and prove that the resulting partial skew group ring is isomorphic to the…
A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…
We present a type system for strategy languages that express program transformations as compositions of rewrite rules. Our row-polymorphic type system assists compiler engineers to write correct strategies by statically rejecting non…
We describe a new approach to the Word Problem for Artin-Tits groups and, more generally, for the enveloping group U(M) of a monoid M in which any two elements admit a greatest common divisor. The method relies on a rewrite system R(M) that…
We study the geometry of algebraic monoids. We prove that the group of invertible elements of an irreducible algebraic monoid is an algebraic group, open in the monoid. Moreover, if this group is reductive, then the monoid is affine. We…
We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its…
We develop a rewriting theory suitable for diagrammatic algebras and lay down the foundations of a systematic study of their higher structures. In this paper, we focus on the question of finding bases. As an application, we give the first…
We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…
In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…
This paper proposes a modal typing system that enables us to handle self-referential formulae, including ones with negative self-references, which on one hand, would introduce a logical contradiction, namely Russell's paradox, in the…
We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…
Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…
A magmoid is a non-empty set with a partial binary operation; group-like magmoids generalize group-like magmas such as semigroups, monoids and groups. In this article, we first consider the many ways in which the notions of associative…
We present a complete rewriting system for twisted right-angled Artin groups. Utilizing the normal form coming from the rewriting system, we provide applications that illustrate differences and similarities with right-angled Artin groups,…