partial isomorphism
101Singular homology — In algebraic topology, a branch of mathematics, singular homology refers to the study of a certain set of topological invariants of a topological space X , the so called homology groups H n(X). Singular homology is a particular example of a… …
102Supermanifold — In physics and mathematics, supermanifolds are generalizations of the manifold concept based on ideas coming from supersymmetry. Several definitions are in use, some of which are described below. Physics In physics, a supermanifold is a manifold… …
103Mock modular form — In mathematics, a mock modular form is the holomorphic part of a harmonic weak Maass form, and a mock theta function is essentially a mock modular form of weight 1/2. The first examples of mock theta functions were described by Srinivasa… …
104automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… …
105Lie group — Lie groups …
106Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 …
107Inverse function theorem — In mathematics, specifically differential calculus, the inverse function theorem gives sufficient conditions for a function to be invertible in a neighborhood of a point in its domain. The theorem also gives a formula for the derivative of the… …
108Löwenheim–Skolem theorem — In mathematical logic, the Löwenheim–Skolem theorem, named for Leopold Löwenheim and Thoralf Skolem, states that if a countable first order theory has an infinite model, then for every infinite cardinal number κ it has a model of size κ. The… …
109Fundamental class — For the fundamental class in class field theory see class formation. In mathematics, the fundamental class is a homology class [M] associated to an oriented manifold M, which corresponds to the whole manifold , and pairing with which corresponds… …
110Graph rewriting — In graph theory, graph rewriting is a system of rewriting for graphs, i.e. a set of graph rewrite rules of the form p: L ightarrow R, with L being called pattern graph (or left hand side) and R being called replacement graph (or right hand side… …
