In this paper we consider the submonoids $\mathcal{OPDI}_n$, $\mathcal{MDI}_n$ and $\mathcal{ODI}_n$ of the dihedral inverse monoid $\mathcal{DI}_n$ of all orientation-preserving, monotone and order-preserving transformations, respectively. Our goal is to exhibit presentations for each of these three monoids.
Formal power series come up in several areas such as formal language theory , algebraic and enumerative combinatorics, semigroup theory, number theory etc. This paper focuses on the set x R[[x]] consisting of formal power series with zero constant term. This subset forms a monoid with the composition operation on series. We classify the sets T of strictly positive integers for which the set of formal power series, R[[x^T]]={all formal power series consisting of terms whose power is from T}, forms a monoid with composition as the operation. We prove that in order for R[[x^T]] to be a monoid, T …
This work aims at further investigations on the work of Giambruno and Restivo to find the rank of the intersection of two finitely generated submonoids of a free monoid. In this connection, we obtain the rank of a finitely generated submonoid of a free monoid that is accepted by semi-flower automaton with two bpi's. Further, when the product automaton of two deterministic semi-flower automata with a unique bpi is semi-flower with two bpi's, we obtain a sufficient condition on the product automaton in order to satisfy the Hanna Neumann property.
Necessary and sufficient conditions are given for a prime Noetherian algebra K[S] of a submonoid S of a polycyclic-by-finite group G to be a maximal order. These conditions are entirely in terms of the monoid S. This extends earlier results of Brown concerned with the group ring case and of the authors for the case where K[S] satisfies a polynomial identity.
In this paper we give presentations for the monoid $\mathcal{DP}_n$ of all partial isometries on $\{1,\ldots,n\}$ and for its submonoid $\mathcal{ODP}_n$ of all order-preserving partial isometries.
In this note we consider the monoid $\mathcal{PODI}_n$ of all monotone partial permutations on $\{1,\ldots,n\}$ and its submonoids $\mathcal{DP}_n$, $\mathcal{POI}_n$ and $\mathcal{ODP}_n$ of all partial isometries, of all order-preserving partial permutations and of all order-preserving partial isometries, respectively. We prove that both the monoids $\mathcal{POI}_n$ and $\mathcal{ODP}_n$ are quotients of bilateral semidirect products of two of their remarkable submonoids, namely of extensive and of co-extensive transformations. Moreover, we show that $\mathcal{PODI}_n$ is a quotient of a se…
This article concerns Ehresmann structures in the partition monoid $P_X$. Since $P_X$ contains the symmetric and dual symmetric inverse monoids on the same base set $X$, it naturally contains the semilattices of idempotents of both submonoids. We show that one of these semilattices leads to an Ehresmann structure on $P_X$ while the other does not. We explore some consequences of this (structural/combinatorial and representation theoretic), and in particular characterise the largest left-, right- and two-sided restriction submonoids. The new results are contrasted with known results concerning …
We show that the submonoid of all nxn triangular tropical matrices satisfies a nontrivial semigroup identity and provide a generic construction for classes of such identities. The utilization of the Fibonacci number formula gives us an upper bound on the length of these 2-variable semigroup identities.
In this paper we study the cyclic inverse monoid $\CI_n$ on a set $Ω_n$ with $n$ elements, i.e. the inverse submonoid of the symmetric inverse monoid on $Ω_n$ consisting of all restrictions of the elements of a cyclic subgroup of order $n$ acting cyclically on $Ω_n$. We show that $\CI_n$ has rank $2$ (for $n\geqslant2$) and $n2^n-n+1$ elements. Moreover, we give presentations of $\CI_n$ on $n+1$ generators and $\frac{1}{2}(n^2+3n+4)$ relations and on $2$ generators and $\frac{1}{2}(n^2-n+6)$ relations. We also consider the remarkable inverse submonoid $\OCI_n$ of $\CI_n$ constituted by all its…
In this paper we consider endomorphisms of a finite directed path from monoid generators perspective. Our main aim is to determine the rank of the monoid $\wEnd\vec{P}_n$ of all weak endomorphisms of a directed path with $n$ vertices, which is a submonoid of the widely studied monoid $\On$ of all order-preserving transformations of a $n$-chain. Also, we describe the regular elements of $\wEnd\vec{P}_n$ and calculate its size and number of idempotents.
For a monoid $M$, we denote by $\mathbb G(M)$ the group of units, $\mathbb E(M)$ the submonoid generated by the idempotents, and $\mathbb G_L(M)$ and $\mathbb G_R(M)$ the submonoids consisting of all left or right units. Writing $\mathcal M$ for the (monoidal) category of monoids, $\mathbb G$, $\mathbb E$, $\mathbb G_L$ and $\mathbb G_R$ are all (monoidal) functors $\mathcal M\to\mathcal M$. There are other natural functors associated to submonoids generated by combinations of idempotents and one- or two-sided units. The above functors generate a monoid with composition as its operation. We sh…
In this paper we consider the monoid $\DPC_n$ of all partial isometries of a $n$-cycle graph $C_n$. We show that $\DPC_n$ is the submonoid of the monoid of all oriented partial permutations on a $n$-chain whose elements are precisely all restrictions of the dihedral group of order $2n$. Our main aim is to exhibit a presentation of $\DPC_n$. We also describe Green's relations of $\DPC_n$ and calculate its cardinal and rank.
We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, on some cardinals as large as the whole clone lattice. Moreover we find that, with one exception, even the cardinalities of the intervals between the monoid of all permutations and the maximal submonoids of the full transformation monoid are as large. Whether or not the only exception is of the same cardinality as the other intervals depends on additional axioms of set theory.
A transformation monoid on a set Omega is called synchronizing if it contains an element of rank 1 (that is, mapping the whole of Omega to a single point). In this paper, I tackle the question: given n and k, what is the probability that the submonoid of the full transformation monoid T_n generated by k random transformations is synchronizing? This question is analogous to Dixon's Theorem that two random permutations generate the symmetric or alternating group with high probability. Following the technique of Dixon's theorem, we need to analyse the maximal non-synchronizing submonoids of T_n. …
A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act is finitely presented. The corresponding notion for a ring $R$ states that every finitely generated submodule of every finitely presented right $R$-module is finitely presented. For monoids (and rings) right coherency is a finitary property which determines the existence of a model companion of the class of right $S$-acts (right $R$-modules) and hence that the class of existentially closed right $S$-acts (right $R$-modules) is axiomatisable. Choo, Lam and Luft have shown that free rings …
We study unary parts of centraliser clones on the set $\{0,1,2,3\}$, so-called centralising monoids. We describe and count all centralising monoids on the set $\{0,1,2,3\}$ having majority operations as witnesses, and we list the inclusion maximal proper submonoids of the full transformation monoid among them. This extends previous work by Goldstern, Machida and Rosenberg.
