Results 31 to 40 of about 866 (222)

Cross-connections and variants of the full transformation semigroup [PDF]

open access: yes, 2018
Cross-connection theory propounded by Nambooripad describes the ideal structure of a regular semigroup using the categories of principal left (right) ideals.
P. A. Azeef Muhammed   +2 more
core   +1 more source

Generating the full transformation semigroup using order preserving mappings

open access: yes, 2003
For a linearly ordered set X we consider the relative rank of the semigroup of all order preserving mappings O-X on X modulo the full transformation semigroup Ex. In other words, we ask what is the smallest cardinality of a set A of mappings such that =
Higgins, PM   +2 more
core   +1 more source

On amenable transformation semigroups II

open access: yesKyoto Journal of Mathematics, 1976
[For parts I-IV see J. Math. Kyoto Univ. 16, 555-595 (1976; Zbl 0362.22005); ibid. 16, 597-626 (1976; Zbl 0362.22006); Sci. Rep. Kagoshima Univ. 25, 31-51 (1976; Zbl 0362.22007); and ibid. 31, 1-19 (1982; Zbl 0525.43001)]. In this paper the following problem is considered: if (S,X) is a transformation semigroup and \(Y\subset X\), when does there exist
openaire   +9 more sources

Structure of the (Total) Transformation Monoids Under Rank N Generators [version 1; peer review: 2 approved]

open access: yesF1000Research
Throughout this paper our study focuses on transformation semigroups. These kinds of semigroups are the corner stone of semigroup theory. This is because every semigroup is isomorphic to transformation semigroup.
Asawer Al-Aadhami, Hala M. Sulaiman
doaj   +1 more source

On Some Numerical Semigroup Transforms

open access: yesAlgebra Colloquium, 2022
In this paper we introduce a particular semigroup transform [Formula: see text] that fixes the invariants involved in Wilf's conjecture, except the embedding dimension. It also allows one to arrange the set of non-ordinary and non-irreducible numerical semigroups in a family of rooted trees.
openaire   +2 more sources

Maximal subgroups of free idempotent-generated semigroups over the full transformation monoid

open access: yes, 2011
Let Tn be the full transformation semigroup of all mappings from the set {1, . . . , n} to itself under composition. Let E = E(Tn) denote the set of idempotents of Tn and let e ∈ E be an arbitrary idempotent satisfying |im (e)| = r ≤ n − 2. We prove that
Ruskuc, N.   +3 more
core   +1 more source

Endomorphism monoids of semilattices of semigroups

open access: yesНауковий вісник Ужгородського університету. Серія: Математика і інформатика, 2017
We prove that the endomorphism monoid of a semilattice of semigroups, which are semilattice indecomposable, is isomorphically embedded into the wreath product of a transformation semigroup with a small category.
Ю. В. Жучок
doaj   +1 more source

Some results on semigroups of transformations with restricted range

open access: yesOpen Mathematics, 2021
Let XX be a non-empty set and YY a non-empty subset of XX. Denote the full transformation semigroup on XX by T(X)T\left(X) and write f(X)={f(x)∣x∈X}f\left(X)=\{f\left(x)| x\in X\} for each f∈T(X)f\in T\left(X). It is well known that T(X,Y)={f∈T(X)∣f(X)⊆Y}
Yan Qingfu, Wang Shoufeng
doaj   +1 more source

Every group is a maximal subgroup of the free idempotent generated semigroup over a band

open access: yes, 2013
Given an arbitrary group G we construct a semigroup of idempotents (band) BG with the property that the free idempotent generated semigroup over BG has a maximal subgroup isomorphic to G. If G is finitely presented then BG is finite. This answers several
Ruskuc, Nik   +3 more
core   +1 more source

On the maximum transform and semigroups of transformations [PDF]

open access: yesBulletin of the American Mathematical Society, 1962
Abstract : Part of the Project RAND research program consists of basic supporting studies in mathematics. A problem frequently occurring in applications is that of determining the maximum or minimum value of a function subject to prescribed constraints.
Bellman, Richard, Karush, William
openaire   +2 more sources

Home - About - Disclaimer - Privacy