Related papers: C-semigroups with its induced order
Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…
Let $S$ be a semigroup (written multiplicatively). Endowed with the operation of setwise multiplication induced by $S$ on its parts, the non-empty subsets of $S$ form themselves a semigroup, denoted by $\mathcal P(S)$. Accordingly, we say…
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…
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…
An ordered semiring is a commutative semiring equipped with a compatible preorder. Ordered semirings generalise both distributive lattices and commutative rings, and provide a convenient framework to unify certain aspects of lattice theory…
Let (G, *) be a semigroup, D subset of G, and n >= 2 be an integer. We say that (D, *) is an n-closed subset of G if a_1* ... *a_n in D for every a_1, ..., a_n in D. Hence every closed set is a 2-closed set. The concept of n-closed sets…
We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient conditions for such a reduction to be unique. These results are then refined in the case of symmetric n-ary…
We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…
For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
We generalize to the super context, the known fact that if an affine algebraic group $G$ over a commutative ring $k$ acts freely (in an appropriate sense) on an affine scheme $X$ over $k$, then the dur sheaf $X\tilde{\tilde{/}}G$ of…
We show that semigroup C*-algebras are groupoid C*-algebras.
We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…
A group $G$ is said to be a $C$-group if every subgroup $H$ has a permutable complement, i.e. if there exists a subgroup $K$ of $G$ such that $G=HK$ and $H \cap K=1$. In this paper, we study the profinite counterpart of this concept. We say…
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…
Motivated by a promotion to increase the number of musical downloads, we introduce the concept of $C$-incentive and show an algorithm that compute the smallest $C$-incentive containing a subset $X \subseteq {\mathbb N}$. On the other hand,…
A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. The size of its complement is called the genus and the largest number in the complement is called its Frobenius number. We consider the set of…
This is the first of a series of papers in which we initiate and develop the theory of reflection monoids, motivated by the theory of reflection groups. The main results identify a number of important inverse semigroups as reflection…
Let $\mathcal C$ be a class of topological semigroups. A semigroup $X$ is called (1) $\mathcal C$-$closed$ if $X$ is closed in every topological semigroup $Y\in\mathcal C$ containing $X$ as a discrete subsemigroup, (2) $ideally$ $\mathcal…
A semigroup $S$ is said to be right pseudo-finite if the universal right congruence can be generated by a finite set $U\subseteq S\times S$, and there is a bound on the length of derivations for an arbitrary pair $(s,t)\in S\times S$ as a…