Related papers: Some ordered matrix semigroups

We introduce the notion of numerical semigroups generated by concatenation of arithmetic sequences and show that this class of numerical semigroups exhibit multiple interesting behaviours.

Here we introduce the notion of (left, right) $\pi$-$t$-simple, right $\pi$-inverse ordered semigroups and discuss characterizations and relationships concerning them. Semilattice decomposition of left $\pi$-$t$-simple ordered semigroups…

In this article we analyze the structure of the semigroup of inner perturbations in noncommutative geometry. This perturbation semigroup is associated to a unital associative *-algebra and extends the group of unitary elements of this…

Let $[n]=\{1,\ldots,n\}$ be the $n$-chain. We give presentations for the following transformation semigroups: the semigroup of full order-decreasing mappings of $[n]$, the semigroup of partial one-to-one order-decreasing mappings of $[n]$,…

Let A be a singular matrix of M_n(K), where K is an arbitrary field. Using canonical forms, we give a new proof that the sub-semigroup of (M_n(K),x) generated by the similarity class of A is the set of matrices of M_n(K) with a rank lesser…

Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…

We characterise the respective semigroups of mappings that preserve, or that preserve or reverse orientation of a finite cycle, in terms of their actions on oriented triples and oriented quadruples. This leads to a proof that the latter…

We continue our studies on semilattice ordered algebras. This time we accept constants in the type of algebras. We investigate identities satisfied by such algebras and describe the free objects in varieties of semilattice ordered algebras…

Let $\mathcal{CP}_n$ be the semigroup of partial contraction mappings on $[n]=\{1,2,\ldots,n\}$ and let $\mathcal{OCP}_n$ and $\mathcal{ORCP}_n$ be its subsemigroups consisting of all order-preserving and of all order-preserving or…

This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…

Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…

Abelian groups having partial orderings compatible with their binary operations have long been studied in the literature. In particular, lattice-ordered abelian groups constitute a universal-algebraic variety, and thus form a category which…

Our aim in this paper is to initiate the study of exponent semigroups for rational matrices. We prove that every numerical semigroup is the exponent semigroup of some rational matrix. We also obtain lower bounds on the size of such matrices…

We introduce a preorder on an inverse semigroup $S$ associated to any normal inverse subsemigroup $N$, that lies between the natural partial order and Green's ${\mathscr J}$-relation. The corresponding equivalence relation $\simeq_N$ is not…

We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…

There are many examples of `binary' partial groups in the literature: sets equipped an identity and a partially-defined binary operation, such that each element admits an inverse. We show that many of these may be regarded as partial groups…

We study the structure of nilpotent subsemigroups in the semigroup $M(n,\mathbb{F})$ of all $n\times n$ matrices over a field, $\mathbb{F}$, with respect to the operation of the usual matrix multiplication. We describe the maximal…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

We survey structures endowed with natural partial orderings and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism order…

Let $R$ be a finite commutative ring with unity $1_R$ and $k \in R$. Properties of one-sided $k$-orthogonal $n \times n$ matrices over $R$ are presented. When $k$ is idempotent, these matrices form a semigroup structure. Consequently new…