Results 121 to 130 of about 31,145 (240)
The number of unary clones containing the permutations on an infinite set [PDF]
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.
Pinsker, Michael
core
Growth problems in diagram categories
Abstract In the semisimple case, we derive (asymptotic) formulas for the growth rate of the number of summands in tensor powers of the generating object in diagram/interpolation categories.
Jonathan Gruber, Daniel Tubbenhauer
wiley +1 more source
The set of Set(n)'s for natural numbers n is constructed. For this set it is proved that it is a commutative semi-group. The conditions for which it is a monoid are given.
Krassimir T. Atanassov
doaj +1 more source
On Endomorphism Universality of Sparse Graph Classes
ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source
On cofree S-spaces and cofree S-flows
Let S-Tych be the category of Tychonoff S-spaces for a topological monoid S. We study the cofree S-spaces and cofree S-flows over topological spaces and we prove that for any topological space X and a topological monoid S, the function space C(S,X) with ...
Behnam Khosravi
doaj +1 more source
On Almost Everywhere K-Additive Set-Valued Maps
Let X be an Abelian group, Y be a commutative monoid, K ⊂Y be a submonoid and F : X → 2Y \ {∅} be a set-valued map. Under some additional assumptions on ideals ℐ1 in X and ℐ2 in X2, we prove that if F is ℐ2-almost everywhere K-additive, then there ...
Jabłońska Eliza
doaj +1 more source
The join of split graphs whose completely regular endomorphisms form a monoid
In this paper, completely regular endomorphisms of the join of split graphs are investigated. We give conditions under which all completely regular endomorphisms of the join of two split graphs form a monoid.
Hou Hailong, Song Yanhua, Gu Rui
doaj +1 more source
Endomorphism monoids of acts over monoids
In this paper we investigate under which conditions a monoid R is defined by the endomorphism monoid of an act over R. More precisely, we ask when an isomorphism between two such endomorphism monoids over monoids R1 and R2 is induced by a semilinear isomorphism. The question is considered also for ordered and for topological monoids.
Knauer, U., Mikhalev, A.V.
openaire +1 more source
A Variant of Jensen’s Functional Equation on Semigroups
We determine the solutions f : S → H of the following functional ...
Fadli Brahim +2 more
doaj +1 more source
Factorizable inverse monoids [PDF]
An inverse monoid \(S\) is called `factorizable' provided that it decomposes into a product \(UE\) of its group \(U\) of units and its semi-lattice \(E\) of idempotents. The paper under review is a survey of the algebraic theory of factorizable inverse monoids. The paper starts with a short historical overview. This goes over to the structure theory of
openaire +2 more sources

