Results 111 to 120 of about 532 (202)
Totally Ordered Commutative Monoids
, 1999 A totally ordered monoid---or tomonoid , for short---is a commutative semigroup with identity S equipped with a total order S that is translation invariant, i.e., that satisfies: 8x; y; z 2 S x S y ) x + z S y + z: We call a tomonoid that is a ...
Michael Konikoff +4 more
core
Ordered groupoids and the holomorph of an inverse semigroup
, 2015 We present a construction for the holomorph of an inverse semigroup, derived from the cartesian closed structure of the category of ordered groupoids.
N. D. Gilbert +3 more
core +1 more source
On a Class of Lattice Ordered Inverse Semigroups
, 2000 It is well known that the free group on a non-empty set can be totally ordered and, further, that each compatible latttice ordering on a free group is a total ordering.
Giraldes, Emilia +2 more
core +1 more source
Ordered Monoids: Languages and Relations
, 2017 We give a finite axiomatization for the variety generated by relational, integral ordered monoids. As a corollary we get a finite axiomatization for the language interpretation as well.
openaire +2 more sources
On Gröbner Bases in Monoid and Group Rings
, 1993 Following Buchberger’s approach to computing a Gröbner basis of a polynomial ideal in polynomial rings, a completion procedure for finitely generated right ideals in Z[H] is given, where H is an ordered monoid presented by a finite, convergent semi-Thue ...
Madlener, Klaus, Reinert, Birgit
core +1 more source
Autometrized Lattice Ordered Monoids
In this paper, we introduce the notion of Autometrized lattice ordered monoids (for short,AL-monoids) as a generalization to DRl-semi groups. We obtain the basic properties of AL-monoids. Also, we prove that Autometrized lattice ordered monoids are equationally definable. Furthermore, we show that AL-monoids are an optimal common abstraction of Boolean
Ashale, Tekalign Regasa +2 more
openaire +2 more sources
Topology and monoid representations I: Foundations
This paper aims to use topological methods to compute $\mathrm{Ext}$ between an irreducible representation of a finite monoid inflated from its group completion and one inflated from its group of units, or more generally coinduced from a maximal subgroup,
Steinberg, Benjamin
core
On Gröbner Bases in Monoid and Group Rings [PDF]
, 1999 Following Buchberger's approach to computing a Gröbner basis of a poly-nomial ideal in polynomial rings, a completion procedure for finitely generatedright ideals in Z[H] is given, where H is an ordered monoid presented by a finite,convergent semi - Thue
Madlener, Klaus, Reinert, Birgit
core
Groups of Symmetries of the Two Classes of Synthetases in the Four-Dimensional Hypercubes of the Extended Code Type II. [PDF]
Life (Basel), 2023 José MV, Morgado ER, Bobadilla JR.
europepmc +1 more source
On a complete lattice of retracts of a free monoid generated by three elements
Tyt. z nagł.References p. 127.Dostępny również w formie drukowanej.ABSTRACT: We prove that the family of retracts of a free monoid generated by three elements, partially ordered with respect to the inclusion, is a complete lattice. KEYWORDS: free monoid,
Foryś, Wit Jan
core