相关论文: The loop problem for monoids and semigroups
This is an expository paper which provides a quick introduction to Boolean inverse semigroups and their type monoids, with the emphasis on techniques and insights of the theory, and also treats the connection of the type monoid…
It is shown that the category of \emph{semi-biproducts} of monoids is equivalent to the category of \emph{pseudo-actions}. A semi-biproduct of monoids is a new notion, obtained through generalizing a biproduct of commutative monoids. By…
In this short survey we describe recent advances on word equations with non-rational constraints in groups and monoids, highlighting the important role that formal languages play in this area.
We establish analogues in the context of group actions or group representations of some classical problems and results in additive combinatorics of groups. We also study the notion of left invariant submodular function defined on power sets…
Using a basic idea of Sullivan's rational homotopy theory, one can see a Lie groupoid as the fundamental groupoid of its Lie algebroid. This paper studies analogues of Lie algebroids with non-trivial higher homotopy. Using various homotopy…
We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…
We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…
Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered…
We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…
A rewriting system is a set of equations over a given set of terms called rules that characterize a system of computation and is a powerful general method for providing decision procedures of equational theories, based upon the principle of…
Dictionaries are inherently circular in nature. A given word is linked to a set of alternative words (the definition) which in turn point to further descendants. Iterating through definitions in this way, one typically finds that…
We establish a new sufficient condition under which a monoid is non-finitely based and apply this condition to Lee monoids $L_\ell^1$, obtained by adjoining an identity element to the semigroup generated by two idempotents $a$ and $b$…
The study of word hyperbolic groups is a prominent topic in geometric group theory; however word hyperbolic groups are defined by a geometric condition which does not extend naturally to semigroups. We propose a linguistic definition.…
We study congruences on the partial automorphism monoid of a finite rank free group action. We give a decomposition of a congruence on this monoid into a Rees congruence, a congruence on a Brandt semigroup and an idempotent separating…
We show that all of the Sch\"{u}tzenberger complexes of an Adian inverse semigroup are finite if the Sch\"{u}tzenberger complex of every positive word is finite. This enables us to solve the word problem for certain classes of Adian inverse…
We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying…
In this article, we study word equations in free semigroups and the conjecture that the existence of infinitely many solutions entails the existence of solutions with arbitrarily large exponent of periodicity. We examine this question in…
We prove the well-posedness of a linear closed-loop system with an explicit (already known) feedback leading to arbitrarily large decay rates. We define a mild solution of the closed-loop problem using a dual equation and we prove that the…
We formulate some problems and conjectures about semigroups of rational functions under composition. The considered problems arise in different contexts, but most of them are united by a certain relationship to the concept of amenability.
We present a method for proving that a semigroup is finitely based and find some new sufficient conditions under which a monoid is finitely based. As an application, we find a class of finite monoids where the finite basis property behaves…