Results 71 to 80 of about 31,145 (240)
Free Monoid in Monoidal Abelian Categories [PDF]
Final version, to appear in Applied Categorical Structures. [17 pages]
openaire +2 more sources
A semigroup $S$ is called $F-monoid$ if $S$ has an identity and if there exists a group congruence $\rho$ on $S$ such that each $\rho$-class of $S$ contains a greatest element with respect to the natural partial order of $S$ (see Mitsch, 1986). Generalizing results given in Giraldes et al. (2004) and specializing some of Giraldes et al. (Submitted) five
Giraldes, E. +2 more
openaire +3 more sources
Power monoids and finiteJ-trivial monoids
A variety of finite monoids is a class of finite monoids closed under taking submonoids, quotients and \textit{finite} direct products. If M is a monoid, let \(P_ 1(M)\) denote the monoid of all subsets of M containing 1. If V is a variety, \(P_ 1V\) denotes the variety generated by the monoids \(P_ 1(M)\), \(M\in V\). Let J denote the variety of all J-
Pin, J.E., Margolis, S.
openaire +2 more sources
On locally compact shift-continuous topologies on the α-bicyclic monoid
A topology τ on a monoid S is called shift-continuous if for every a, b ∈ S the two-sided shift S → S, x ↦ axb, is continuous. For every ordinal α ≤ ω, we describe all shift-continuous locally compact Hausdorff topologies on the α-bicyclic monoid Bα ...
Bardyla Serhii
doaj +1 more source
Endomorphisms and anti-endomorphisms of some finite groupoids
In this paper, we study anti-endomorphisms of some finite groupoids. Previously, special groupoids $S(k, q)$ of order $k(1+k)$ with a generating set of $k$ elements were introduced.
Litavrin Andrey V.
doaj +1 more source
Realizable sets of catenary degrees of numerical monoids
The catenary degree is an invariant that measures the distance between factorizations of elements within an atomic monoid. In this paper, we classify which finite subsets of $\mathbb Z_{\ge 0}$ occur as the set of catenary degrees of a numerical monoid ...
O'Neill, Christopher, Pelayo, Roberto
core +1 more source
Résumé: Cet article présente une étude combinatoire du monoïde Chinois, un monoïde ternaire proche du monoïde plaxique, fondé sur le schéma cba≡bca≡cab. Un algorithme proche de l'algorithme de Schensted nous permet de caractériser les classes d'équivalence et d'exhiber une section du monoïde.
Cassaigne, Julien +4 more
openaire +4 more sources
Aggregation and the Structure of Value
ABSTRACT Roughly, the view I call “Additivism” sums up value across time and people. Given some standard assumptions, I show that Additivism follows from two principles. The first says that how lives align in time cannot, in itself, matter. The second says, roughly, that a world cannot be better unless it is better within some period or another.
Weng Kin San
wiley +1 more source
The representation theory of the monoid of all partial functions on a set and related monoids as EI-category algebras [PDF]
The (ordinary) quiver of an algebra $A$ is a graph that contains information about the algebra's representations. We give a description of the quiver of $\mathbb{C}PT_{n}$, the algebra of the monoid of all partial functions on $n$ elements.
Itamar Stein
semanticscholar +1 more source
On residually finite semigroups of cellullar automata [PDF]
We prove that if M is a monoid and A a finite set with more than one element, then the residual finiteness of M is equivalent to that of the monoid consisting of all cellular automata over M with alphabet A .
Tullio Ceccherini-Silberstein +1 more
doaj

