Related papers: The monoid of queue actions
The cyclic shift graph of a monoid is the graph whose vertices are the elements of the monoid and whose edges connect elements that are cyclic shift related. The Patience Sorting algorithm admits two generalizations to words, from which two…
In this work we consider monoids as algebras with an associative binary operation and the nullary operation that fixes the identity element. We found an example of two varieties of monoids with finite subvariety lattices such that their…
Every Krull monoid has a transfer homomorphism onto a monoid of zero-sum sequences over a subset of its class group. This transfer homomorphism is a crucial tool for studying the arithmetic of Krull monoids. In the present paper, we…
In this paper, we study the atomic structure of the family of Puiseux monoids. Puiseux monoids are a natural generalization of numerical semigroups, which have been actively studied since mid-nineteenth century. Unlike numerical semigroups,…
A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…
We present an algebraic characterization of the complexity classes Logspace and Nlogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is rooted in proof theory…
This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…
Let \(A=(A,\star)\) be a finite binary algebra, not necessarily associative. For each \(n\geq 1\), every full binary bracketing on \(x_1,\dots,x_n\) determines an \(n\)-ary term operation on \(A\), and hence an evaluation word obtained by…
Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…
We study classes of proper restriction semigroups determined by properties of partial actions underlying them. These properties include strongness, antistrongness, being defined by a homomorphism, being an action etc. Of particular interest…
Our earlier work titled: "Win-move is Coordination-Free (Sometimes)" has shown that the classes of queries that can be distributedly computed in a coordination-free manner form a strict hierarchy depending on the assumptions of the model…
In this paper we provide an account of the Todd-Coxeter algorithm for computing congruences on semigroups and monoids. We also give a novel description of an analogue for semigroups of the so-called Felsch strategy from the Todd-Coxeter…
A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation). In analogy to…
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 our earlier article~\cite{CanSakran} we initiated a study of the complement-finite submonoids of the group of integer points of a unipotent linear algebraic group. In the present article, we continue to develop tools and techniques for…
We begin the process of classifying all supersymmetric theories with quantum modified moduli. We determine all theories based on a single SU or Sp gauge group with quantum modified moduli. By flowing among theories we have calculated the…
Let H be an algebraic group scheme over a field k acting on a commutative k-algebra A which is a unique factorisation domain. We show that, under certain mild assumptions, the monoid of nonzero H-stable principal ideals in A is free…
Informally, a homotopy monoid is a monoid-like structure in which properties such as associativity only hold `up to homotopy' in some consistent way. This short paper comprises a rigorous definition of homotopy monoid and a brief analysis…
This work is a contribution to the study of set of the representations of integers in a rational base number system. This prefix-closed subset of the free monoid is naturally represented as a highly non regular tree whose nodes are the…
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,…