Results 71 to 80 of about 366 (139)
Semigroups of order-decreasing transformations
, 2012 Let X be a totally ordered set and consider the semigroups of orderdecreasing (increasing) full (partial, partial one-to-one) transformations of X. In this Thesis the study of order-increasing full (partial, partial one-to-one) transformations has been
Umar, Abdullahi
core
The multiplicative semigroup of a Dedekind domain
, 2023 In 1995 Grillet defined the concept of a stratified semigroup and a stratified semigroup with zero. The present authors extended that idea to include semigroups with a more general base and proved, amongst other things, that finite semigroups in which ...
Renshaw, James, Warhurst, William
core
Inclusive varieties of Clifford semigroups
Semigroup ForumAbstract The class of identical inclusions was defined by E. S. Lyapin. This class of nonelementary universal formulas is situated strictly between identities and universal positive formulas. These formulas can be written as identical equalities of subsets of a free algebra, in particular, of
S. Bratchikov, G. Mashevitzky
openaire +1 more source
The Clifford semiring congruences on an additive regular semiring
, 2014 A congruence ρ on a semiring S is called a (generalized)Clifford semiring congruence if S/ρ is a (generalized)Clifford semiring. Here we characterize the (generalized)Clifford congruences on a semiring whose additive reduct is a regular semigroup.
Bhuniya, A.
core +1 more source
On inner amenability of Clifford semigroups
Proceedings of the Japan Academy, Series A, Mathematical Sciences, 1994 The notion of inner amenability (well known for groups) is introduced for Clifford semigroups. Each element \(s\) of such a semigroup \(S\) defines an inner endomorphism \(c(s)\) on \(S\), which in turn induces an operator \(c(s)\) on the space \(B(S)\) of all bounded functions on \(S\).
openaire +3 more sources
The Clifford defect of a numerical semigroup
The Clifford defect is a rational number associated to the Weierstrass semigroup at a given point of an algebraic curve. It describes the error-correcting capability of the so-called Modified Algorithm for decoding the corresponding one-point codes defined at the point. This defect also finds applications in other contexts involving one-point codes. We
Camps-Moreno, Eduardo +3 more
openaire +2 more sources
Set-theoretical solutions of the pentagon equation on Clifford semigroups
Given a set-theoretical solution of the pentagon equation s : S × S → S × S on a set S and writing s(a,b) = (a · b, θa(b)), with · a binary operation on S and θa a map from S into itself, for every a ∈ S, one naturally obtains that (S, ·) is a semigroup.
Pérez Calabuig, Vicent +2 more
core +1 more source
Clifford congruences on generalized quasi-orthodox GV-semigroups
, 2013 A semigroup S is said to be completely π-regular if for any a ∈ S there exists a positive integer n such that aⁿ is completely regular. A completely π-regular semigroup S is said to be a GV-semigroup if all the regular elements of S are completely ...
Maity, Sunil
core +1 more source
Automatic presentations and semigroup constructions
, 2010 An automatic presentation for a relational structure is, informally, an abstract representation of the elements of that structure by means of a regular language such that the relations can all be recognized by finite automata.
Oliver, Graham +3 more
core +1 more source
Structure of Clifford Semigroups of Matrices
, 2010 In this paper, we characterize completely the structure of Clifford semigroups of matrices over an arbitrary field. It is shown that a semigroups of matrices of finite order is a Clifford semigroup if and only if it is isomorphic to a subdirect product of some linear (0-)groups.
openaire +2 more sources