weak isomorphism
71Group representation — In the mathematical field of representation theory, group representations describe abstract groups in terms of linear transformations of vector spaces; in particular, they can be used to represent group elements as matrices so that the group… …
72Semigroup — This article is about the algebraic structure. For applications to differential equations, see C0 semigroup. In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup… …
73Algebraic topology — is a branch of mathematics which uses tools from abstract algebra to study topological spaces. The basic goal is to find algebraic invariants that classify topological spaces up to homeomorphism. In many situations this is too much to hope for… …
74Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… …
75Quaternion — Quaternions, in mathematics, are a non commutative extension of complex numbers. They were first described by the Irish mathematician Sir William Rowan Hamilton in 1843 and applied to mechanics in three dimensional space. They find uses in both… …
76Direct sum of groups — In mathematics, a group G is called the direct sum of a set of subgroups {Hi} if each Hi is a normal subgroup of G each distinct pair of subgroups has trivial intersection, and G = <{Hi}>; in other words, G is generated by the subgroups… …
77Faltings' theorem — In number theory, the Mordell conjecture is the conjecture made by Mordell (1922) that a curve of genus greater than 1 over the field Q of rational numbers has only finitely many rational points. The conjecture was later generalized by replacing… …
78Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …
79Hardy space — In complex analysis, the Hardy spaces (or Hardy classes) Hp are certain spaces of holomorphic functions on the unit disk or upper half plane. They were introduced by Frigyes Riesz (Riesz 1923), who named them after G. H. Hardy, because of the… …
80List of order topics — This is a list of order topics, by Wikipedia page.An alphabetical list of many notions of order theory can be found in the order theory glossary. See also inequality, extreme value, optimization (mathematics), domain theory.Basic… …
