nonregular
Look at other dictionaries:
Dodecahedron — Regular Dodecahedron (Click here for rotating model) Type Platonic solid Elements F = 12, E = 30 V = 20 (χ = 2) Faces by sides 12{5} … Wikipedia
Octahedron — For the album by The Mars Volta, see Octahedron (album). Regular Octahedron (Click here for rotating model) Type Platonic solid Elements F = 8, E = 12 V = 6 (χ = 2) Faces by sides … Wikipedia
Regular space — In topology and related fields of mathematics, regular spaces and T3 spaces are particularly convenient kinds of topological spaces.Both conditions are examples of separation axioms. Definitions Suppose that X is a topological space. X is a… … Wikipedia
English plural — English grammar series English grammar Contraction Disputes in English grammar English compound English honorifics English personal pronouns English plural English relative clauses English verbs English irregular verbs En … Wikipedia
Hexagonal tiling — In geometry, the hexagonal tiling is a regular tiling of the Euclidean plane. It has Schläfli symbol of {6,3} or t{3,6} (as a truncated triangular tiling).Conway calls it a hextille.The internal angle of the hexagon is 120 degrees so three… … Wikipedia
Nonconvex uniform polyhedron — In geometry, a nonconvex uniform polyhedron, or uniform star polyhedron, is a self intersecting uniform polyhedron. Each can contain either star polygon faces, star polygon vertex figures or both.The complete set of 57 nonprismatic uniform star… … Wikipedia
Menachem Magidor — Professor Menachem Magidor in Jerusalem, December 2006 Born January 24, 1946 … Wikipedia
Uniform star polyhedron — A display of uniform polyhedra at the Science Museum in London … Wikipedia
Hausdorff space — In topology and related branches of mathematics, a Hausdorff space, separated space or T2 space is a topological space in which distinct points have disjoint neighbourhoods. Of the many separation axioms that can be imposed on a topological space … Wikipedia
Pumping lemma — In the theory of formal languages in computability theory, a pumping lemma states that any infinite language of a given class can be pumped and still belong to that class. A language can be pumped if any sufficiently long string in the language… … Wikipedia
