set of invariants
51Character variety — In the mathematics of moduli theory, given an algebraic, reductive, Lie group G and a finitely generated group π, the G character variety of π is a space of equivalence classes of group homomorphisms More precisely, G acts on by conjugation and… …
52Class (computer programming) — In object oriented programming, a class is a construct that is used as a blueprint to create instances of itself – referred to as class instances, class objects, instance objects or simply objects. A class defines constituent members which enable …
53Image moment — In image processing, computer vision and related fields, an image moment is a certain particular weighted average (moment) of the image pixels intensities, or a function of such moments, usually chosen to have some attractive property or… …
54Algebraic curve — In algebraic geometry, an algebraic curve is an algebraic variety of dimension one. The theory of these curves in general was quite fully developed in the nineteenth century, after many particular examples had been considered, starting with… …
55Systolic geometry — In mathematics, systolic geometry is the study of systolic invariants of manifolds and polyhedra, as initially conceived by Charles Loewner, and developed by Mikhail Gromov and others, in its arithmetic, ergodic, and topological manifestations.… …
56Eiffel (programming language) — Infobox programming language name = Eiffel paradigm = object oriented year = 1986 designer = Bertrand Meyer developer = Bertrand Meyer Eiffel Software latest release version = 4.2 latest release date = Feb 6, 1998 typing = static typing, strong… …
57Cardinal function — In mathematics, a cardinal function (or cardinal invariant) is a function that returns cardinal numbers. Contents 1 Cardinal functions in set theory 2 Cardinal functions in topology 2.1 Basic inequalities …
58Matroid — In combinatorics, a branch of mathematics, a matroid (  /ˈmeɪ …
59Michael Atiyah — Sir Michael Atiyah Born 22 April 1929 (1929 04 22) (age 82) …
60Robertson–Seymour theorem — In graph theory, the Robertson–Seymour theorem (also called the graph minor theorem[1]) states that the undirected graphs, partially ordered by the graph minor relationship, form a well quasi ordering.[2] Equivalently, every family of graphs that …
