Results 41 to 50 of about 34,808 (248)
A graph semigroup refers to a monoid whose defining relations are of the form xixj=xjxi. We describe the centralizer of an arbitrary element of a graph semigroup, show that there exists a unique factorization of any element into commuting parts, and prove related results.
Kim, K.H. +2 more
openaire +3 more sources
Let [Formula: see text] be a finite n-chain [Formula: see text], and let [Formula: see text] be the monoid of full contraction mappings on [Formula: see text].
M. M. Zubairu, A. Umar, A. Jibrin
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 +2 more sources
On topologies on the underlying set of a topological monoid induced by its unitary extensions
Extensions of a given topological monoid where all its unitary Cauchy filters converge, can induce di˙erent topologies on its underlying set. We study properties of these topologies and prove a condition under which the initial topology of this monoid is
Averbukh Boris G.
doaj +1 more source
Monoid varieties with extreme properties
Finite monoids that generate monoid varieties with uncountably many subvarieties seem rare, and surprisingly, no finite monoid is known to generate a monoid variety with countably infinitely many subvarieties.
Jackson, Marcel, Lee, Edmond W. H.
core +1 more source
Noetherianity for infinite-dimensional toric varieties [PDF]
We consider a large class of monomial maps respecting an action of the infinite symmetric group, and prove that the toric ideals arising as their kernels are finitely generated up to symmetry.
Draisma, Jan +3 more
core +2 more sources
SOLVING DIFFERENCE EQUATIONS IN SEQUENCES: UNIVERSALITY AND UNDECIDABILITY
We study solutions of difference equations in the rings of sequences and, more generally, solutions of equations with a monoid action in the ring of sequences indexed by the monoid. This framework includes, for example, difference equations on grids (for
GLEB POGUDIN +2 more
doaj +1 more source
Group Fuzzy Languages and its Generalizations
In fuzzy language theory, every monoid is the syntactic monoid of some fuzzy language. By using this result the properties of fuzzy language can be studied by the algebraic properties of the syntactic monoids. There are so many methods for studying fuzzy
Archana Vasudevan Pillai Prasanna +2 more
doaj +1 more source
Syntactic Monoids in a Category [PDF]
The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids of Rabin and ...
Adamek, Jiri +2 more
core +2 more sources
On unitary extensions and unitary completions of topological monoids
The concept of a unitary Cauchy net in an arbitrary Hausdorff topological monoid generalizes the concept of a fundamental sequence of reals. We construct extensions of this monoid where all its unitary Cauchy nets converge.
Averbukh Boris G.
doaj +1 more source

