(semigroup theory)
111Semigroupe — Semi groupe En mathématiques, un semi groupe est une structure algébrique, en quelque sorte intermédiaire entre un magma et un groupe. Pour les besoins de l informatique, les propriétés propres aux semi groupes sont étudiées depuis les années… …
112РЕГУЛЯРНАЯ ПОЛУГРУППА — полугруппа, каждый элемент к рой регулярен. Произвольная Р. п. Sсодержит идемпотенты (см. Регулярный элемент), и строение Sв значительной степени определяется строением и расположением в Sмножества всех ее идемпотентов Е(S). Р. п. с единственным… …
113Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… …
114Semilattice — In mathematics, a join semilattice (or upper semilattice) is a partially ordered set which has a join (a least upper bound) for any nonempty finite subset. Dually, a meet semilattice (or lower semilattice) is a partially ordered set which has a… …
115Group action — This article is about the mathematical concept. For the sociology term, see group action (sociology). Given an equilateral triangle, the counterclockwise rotation by 120° around the center of the triangle acts on the set of vertices of the… …
116Laws of Form — (hereinafter LoF ) is a book by G. Spencer Brown, published in 1969, that straddles the boundary between mathematics and of philosophy. LoF describes three distinct logical systems: * The primary arithmetic (described in Chapter 4), whose models… …
117Modular group — For a group whose lattice of subgroups is modular see Iwasawa group. In mathematics, the modular group Γ is a fundamental object of study in number theory, geometry, algebra, and many other areas of advanced mathematics. The modular group can be… …
118Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… …
119Toric geometry — In mathematics and theoretical physics, toric geometry is a set of methods in algebraic geometry in which certain complex manifolds are visualized as fiber bundles with multi dimensional tori as fibers.For example, the complex projective plane… …
120Commutative property — For other uses, see Commute (disambiguation). In mathematics an operation is commutative if changing the order of the operands does not change the end result. It is a fundamental property of many binary operations, and many mathematical proofs… …
