Related papers: Forbidden configurations for coherency
A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show…
Every $F$-inverse monoid can be equipped with the unary operation which maps each element to the maximum element of its $\sigma$-class. In this enriched signature, the class of all $F$-inverse monoids forms a variety of algebraic…
Using automata-theoretic approach, Giambruno and Restivo have investigated on the intersection of two finitely generated submonoids of the free monoid over a finite alphabet. In particular, they have obtained Hanna Neumann property for a…
We give an example of a monoid with finitely many left and right ideals, all of whose Schutzenberger groups are presentable by finite complete rewriting systems, and so each have finite derivation type, but such that the monoid itself does…
For a groupoid $S$ with elements $a$ and $b$, if $ba = a$, then $b$ is a left identity of $a$ and $a$ is a right zero of $b$. We define the left identity set of $a$ to be the set of all left identities of $a$ in $S$, and similarly for the…
We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to characterize posets in which some of these mappings coincide. We define special mappings determined…
Certain aspects of Street's formal theory of monads in 2-categories are extended to multimonoidal monads in symmetric strict monoidal 2-categories. Namely, any symmetric strict monoidal 2-category $\mathcal M$ admits a symmetric strict…
We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids…
This paper deals with the algebraic structure of the sequence of harmonics when combined with equal temperaments. Fractals and the golden ratio appear surprisingly on the way. The sequence of physical harmonics is an increasingly enumerable…
For a commutative cancellative monoid $M$, we introduce the notion of the length density of both a nonunit $x\in M$, denoted $\mathrm{LD}(x)$, and the entire monoid $M$, denoted $\mathrm{LD}(M)$. This invariant is related to three widely…
A regular left-order on finitely generated group $G$ is a total, left-multiplication invariant order on $G$ whose corresponding positive cone is the image of a regular language over the generating set of the group under the evaluation map.…
A subsemigroup S of a semigroup Q is a left order in Q and Q is a semigroup of left quotients of S if every element of Q can be expressed as a# b where a and b are elements of S and if, in addition, every element of S that is square…
Recently, in weighted automata theory the weight structure of strong bimonoids has found much interest; they form a generalization of semirings and are closely related to near-semirings studied in algebra. Here, we define polynomials over a…
Let $M$ be a positive homogeneously presented monoid ${\langle L \mid R\,\rangle}_{mo}$. If $M$ satisfies the cancellation condition and carries certain particular elements similar to the \emph{fundamental elements} in Artin monoids, then…
Let G be a group and H be a subgroup of G. We say that H is left relatively convex in G if the left G-set G/H has at least one G-invariant order; when G is left orderable, this holds if and only if H is convex in G under some left ordering…
Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to…
Monoidal functors U:C --> M with left adjoints determine, in a universal way, monoids T in the category of oplax monoidal endofunctors on M. Such monads will be called bimonads. Treating bimonads as abstract "quantum groupoids" we derive…
In order to study graded left hereditary and left semihereditary rings graded by a cancelation monoid in terms of their modules, we need to revisit graded free, projective, injective, and flat modules and provide graded versions of specific…
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,…
We study the semigroup extension $\mathscr{I}_\lambda^n(S)$ of a semigroup $S$ by symmetric inverse semigroups of a bounded finite rank. We describe idempotents and regular elements of the semigroups $\mathscr{I}_\lambda^n(S)$ and…