Bicyclic semigroupIn mathematics, the bicyclic semigroup is an algebraic object important for the structure theory of semigroups. Although it is in fact a monoid, it is usually referred to as simply a semigroup. It is perhaps most easily understood as the syntactic monoid describing the Dyck language of balanced pairs of parentheses. Thus, it finds common applications in combinatorics, such as describing binary trees and associative algebras. The first published description of this object was given by Evgenii Lyapin in 1953.
Inverse semigroupIn group theory, an inverse semigroup (occasionally called an inversion semigroup) S is a semigroup in which every element x in S has a unique inverse y in S in the sense that x = xyx and y = yxy, i.e. a regular semigroup in which every element has a unique inverse. Inverse semigroups appear in a range of contexts; for example, they can be employed in the study of partial symmetries. (The convention followed in this article will be that of writing a function on the right of its argument, e.g.
Monogenic semigroupIn mathematics, a monogenic semigroup is a semigroup generated by a single element. Monogenic semigroups are also called cyclic semigroups. The monogenic semigroup generated by the singleton set {a} is denoted by . The set of elements of is {a, a2, a3, ...}. There are two possibilities for the monogenic semigroup : am = an ⇒ m = n. There exist m ≠ n such that am = an. In the former case is isomorphic to the semigroup ({1, 2, ...}, +) of natural numbers under addition.
Semigroup with involutionIn mathematics, particularly in abstract algebra, a semigroup with involution or a *-semigroup is a semigroup equipped with an involutive anti-automorphism, which—roughly speaking—brings it closer to a group because this involution, considered as unary operator, exhibits certain fundamental properties of the operation of taking the inverse in a group: uniqueness, double application "cancelling itself out", and the same interaction law with the binary operation as in the case of the group inverse.
Band (algebra)In mathematics, a band (also called idempotent semigroup) is a semigroup in which every element is idempotent (in other words equal to its own square). Bands were first studied and named by . The lattice of varieties of bands was described independently in the early 1970s by Biryukov, Fennemore and Gerhard. Semilattices, left-zero bands, right-zero bands, rectangular bands, normal bands, left-regular bands, right-regular bands and regular bands are specific subclasses of bands that lie near the bottom of this lattice and which are of particular interest; they are briefly described below.
SemigroupIn mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it. The binary operation of a semigroup is most often denoted multiplicatively (just notation, not necessarily the elementary arithmetic multiplication): x·y, or simply xy, denotes the result of applying the semigroup operation to the ordered pair (x, y). Associativity is formally expressed as that (x·y)·z = x·(y·z) for all x, y and z in the semigroup.
Cancellative semigroupIn mathematics, a cancellative semigroup (also called a cancellation semigroup) is a semigroup having the cancellation property. In intuitive terms, the cancellation property asserts that from an equality of the form a·b = a·c, where · is a binary operation, one can cancel the element a and deduce the equality b = c. In this case the element being cancelled out is appearing as the left factors of a·b and a·c and hence it is a case of the left cancellation property. The right cancellation property can be defined analogously.
Syntactic monoidIn mathematics and computer science, the syntactic monoid of a formal language is the smallest monoid that recognizes the language . The free monoid on a given set is the monoid whose elements are all the strings of zero or more elements from that set, with string concatenation as the monoid operation and the empty string as the identity element. Given a subset of a free monoid , one may define sets that consist of formal left or right inverses of elements in .
Green's relationsIn mathematics, Green's relations are five equivalence relations that characterise the elements of a semigroup in terms of the principal ideals they generate. The relations are named for James Alexander Green, who introduced them in a paper of 1951. John Mackintosh Howie, a prominent semigroup theorist, described this work as "so all-pervading that, on encountering a new semigroup, almost the first question one asks is 'What are the Green relations like?'" (Howie 2002).
Semigroup with two elementsIn mathematics, a semigroup with two elements is a semigroup for which the cardinality of the underlying set is two. There are exactly five nonisomorphic semigroups having two elements: O2, the null semigroup of order two, LO2, the left zero semigroup of order two, RO2, the right zero semigroup of order two, ({0,1}, ∧) (where "∧" is the logical connective "and"), or equivalently the set {0,1} under multiplication: the only semilattice with two elements and the only non-null semigroup with zero of order two, also a monoid, and ultimately the two-element Boolean algebra, (Z2, +2) (where Z2 = {0,1} and "+2" is "addition modulo 2"), or equivalently ({0,1}, ⊕) (where "⊕" is the logical connective "xor"), or equivalently the set {−1,1} under multiplication: the only group of order two.