Related papers: Using groups for investigating rewrite systems

The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…

Sorting algorithms are fundamental to computer science, and their correctness criteria are well understood as rearranging elements of a list according to a specified total order on the underlying set of elements. As mathematical functions,…

For a finite group $G$, we introduce a generalization of norm relations in the group algebra $\mathbb Q[G]$. We give necessary and sufficient criteria for the existence of such relations and apply them to obtain relations between the…

We use a labelled deduction system based on the concept of computational paths (sequences of rewrites) as equalities between two terms of the same type. We also define a term rewriting system that is used to make computations between these…

We study groups, exponential groups and ordered groups equipped with valuations. We investigate algebraic and topological features of such valued structures, and apply our findings in order to solve regular equations over groups using…

Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…

The technique known as group averaging provides powerful machinery for the study of constrained systems. However, it is likely to be well defined only in a limited set of cases. Here, we investigate the possibility of using a `renormalized'…

In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced…

We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…

A foundation is investigated for the application of loosely structured data on the Web. This area is often referred to as Linked Data, due to the use of URIs in data to establish links. This work focuses on emerging W3C standards which…

This paper presents a powerfull method to integrate general monomials on the classical groups with respect to their invariant (Haar) measure. The method has first been applied to the orthogonal group in [J. Math. Phys. 43, 3342 (2002)], and…

In this note we survey results in recent research papers on the use of Lie groups in the study of partial differential equations. The focus will be on parabolic equations, and we will show how the problems at hand have solutions that seem…

This thesis studies arithmetic of linear algebraic groups. It involves studying the properties of linear algebraic groups defined over global fields, local fields and finite fields, or more generally the study of the linear algebraic groups…

A transitive permutation group is semiprimitive if each of its normal subgroups is transitive or semiregular. Interest in this class of groups is motivated by two sources: problems arising in universal algebra related to collapsing monoids…

Additive relations are defined over additive monoids and additive operation is introduced over these new relations then we build algebraic system of equations. We can generate profuse equations by additive relations of two variables. To…

We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…

The partial success of the block renormalization group techniques is analysed in terms of a functional operator which formalizes the idea of self-replicability of a system in terms of smaller blocks which are similar to the original. The…

We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether…

With a view on applications in computing, in particular concurrency theory and higher-dimensional rewriting, we develop notions of $n$-fold monoid and comonoid objects in $n$-fold monoidal categories and bicategories. We present a series of…

In this paper we develop a structure called Link Algebra, in which we present a Set with two binary operations and an axiom system developed from the study of graph theory and set/antiset theory, sowing main theorems and definitions. Once…