Regular polytopeIn mathematics, a regular polytope is a polytope whose symmetry group acts transitively on its flags, thus giving it the highest degree of symmetry. All its elements or j-faces (for all 0 ≤ j ≤ n, where n is the dimension of the polytope) — cells, faces and so on — are also transitive on the symmetries of the polytope, and are regular polytopes of dimension ≤ n. Regular polytopes are the generalized analog in any number of dimensions of regular polygons (for example, the square or the regular pentagon) and regular polyhedra (for example, the cube).
SimplexIn geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. For example, a 0-dimensional simplex is a point, a 1-dimensional simplex is a line segment, a 2-dimensional simplex is a triangle, a 3-dimensional simplex is a tetrahedron, and a 4-dimensional simplex is a 5-cell. Specifically, a k-simplex is a k-dimensional polytope which is the convex hull of its k + 1 vertices.
TesseractIn geometry, a tesseract is the four-dimensional analogue of the cube; the tesseract is to the cube as the cube is to the square. Just as the surface of the cube consists of six square faces, the hypersurface of the tesseract consists of eight cubical cells. The tesseract is one of the six convex regular 4-polytopes. The tesseract is also called an 8-cell, C8, (regular) octachoron, octahedroid, cubic prism, and tetracube. It is the four-dimensional hypercube, or 4-cube as a member of the dimensional family of hypercubes or measure polytopes.
Vertex configurationIn geometry, a vertex configuration is a shorthand notation for representing the vertex figure of a polyhedron or tiling as the sequence of faces around a vertex. For uniform polyhedra there is only one vertex type and therefore the vertex configuration fully defines the polyhedron. (Chiral polyhedra exist in mirror-image pairs with the same vertex configuration.) A vertex configuration is given as a sequence of numbers representing the number of sides of the faces going around the vertex. The notation "a.
Vertex coverIn graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices that includes at least one endpoint of every edge of the graph. In computer science, the problem of finding a minimum vertex cover is a classical optimization problem. It is NP-hard, so it cannot be solved by a polynomial-time algorithm if P ≠ NP. Moreover, it is hard to approximate – it cannot be approximated up to a factor smaller than 2 if the unique games conjecture is true. On the other hand, it has several simple 2-factor approximations.
Schläfli orthoschemeIn geometry, a Schläfli orthoscheme is a type of simplex. The orthoscheme is the generalization of the right triangle to simplex figures of any number of dimensions. Orthoschemes are defined by a sequence of edges that are mutually orthogonal. They were introduced by Ludwig Schläfli, who called them orthoschemes and studied their volume in Euclidean, hyperbolic, and spherical geometries. H. S. M. Coxeter later named them after Schläfli.
Pentagonal polytopeIn geometry, a pentagonal polytope is a regular polytope in n dimensions constructed from the Hn Coxeter group. The family was named by H. S. M. Coxeter, because the two-dimensional pentagonal polytope is a pentagon. It can be named by its Schläfli symbol as {5, 3n − 2} (dodecahedral) or {3n − 2, 5} (icosahedral). The family starts as 1-polytopes and ends with n = 5 as infinite tessellations of 4-dimensional hyperbolic space. There are two types of pentagonal polytopes; they may be termed the dodecahedral and icosahedral types, by their three-dimensional members.
HypercubeIn geometry, a hypercube is an n-dimensional analogue of a square (n = 2) and a cube (n = 3). It is a closed, compact, convex figure whose 1-skeleton consists of groups of opposite parallel line segments aligned in each of the space's dimensions, perpendicular to each other and of the same length. A unit hypercube's longest diagonal in n dimensions is equal to . An n-dimensional hypercube is more commonly referred to as an n-cube or sometimes as an n-dimensional cube.
Simple polytopeIn geometry, a d-dimensional simple polytope is a d-dimensional polytope each of whose vertices are adjacent to exactly d edges (also d facets). The vertex figure of a simple d-polytope is a (d – 1)-simplex. Simple polytopes are topologically dual to simplicial polytopes. The family of polytopes which are both simple and simplicial are simplices or two-dimensional polygons. A simple polyhedron is a three-dimensional polyhedron whose vertices are adjacent to three edges and three faces.
Point-finite collectionIn mathematics, a collection or family of subsets of a topological space is said to be point-finite if every point of lies in only finitely many members of A metacompact space is a topological space in which every open cover admits a point-finite open refinement. Every locally finite collection of subsets of a topological space is also point-finite. A topological space in which every open cover admits a locally finite open refinement is called a paracompact space. Every paracompact space is therefore metacompact.
Triangulation (topology)In mathematics, triangulation describes the replacement of topological spaces by piecewise linear spaces, i.e. the choice of a homeomorphism in a suitable simplicial complex. Spaces being homeomorphic to a simplicial complex are called triangulable. Triangulation has various uses in different branches of mathematics, for instance in algebraic topology, in complex analysis or in modeling.
Neighbourhood (graph theory)In graph theory, an adjacent vertex of a vertex v in a graph is a vertex that is connected to v by an edge. The neighbourhood of a vertex v in a graph G is the subgraph of G induced by all vertices adjacent to v, i.e., the graph composed of the vertices adjacent to v and all edges connecting vertices adjacent to v. The neighbourhood is often denoted N_G (v) or (when the graph is unambiguous) N(v). The same neighbourhood notation may also be used to refer to sets of adjacent vertices rather than the corresponding induced subgraphs.
Graph coloringIn graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices are of the same color; this is called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two adjacent edges are of the same color, and a face coloring of a planar graph assigns a color to each face or region so that no two faces that share a boundary have the same color.
Locally finite collectionA collection of subsets of a topological space is said to be locally finite if each point in the space has a neighbourhood that intersects only finitely many of the sets in the collection. In the mathematical field of topology, local finiteness is a property of collections of subsets of a topological space. It is fundamental in the study of paracompactness and topological dimension. Note that the term locally finite has different meanings in other mathematical fields. A finite collection of subsets of a topological space is locally finite.
Conway polyhedron notationIn geometry, Conway polyhedron notation, invented by John Horton Conway and promoted by George W. Hart, is used to describe polyhedra based on a seed polyhedron modified by various prefix operations. Conway and Hart extended the idea of using operators, like truncation as defined by Kepler, to build related polyhedra of the same symmetry. For example, tC represents a truncated cube, and taC, parsed as t(aC), is (topologically) a truncated cuboctahedron. The simplest operator dual swaps vertex and face elements; e.
Finite topological spaceIn mathematics, a finite topological space is a topological space for which the underlying point set is finite. That is, it is a topological space which has only finitely many elements. Finite topological spaces are often used to provide examples of interesting phenomena or counterexamples to plausible sounding conjectures. William Thurston has called the study of finite topologies in this sense "an oddball topic that can lend good insight to a variety of questions". Let be a finite set.
Edge coloringIn graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color. For example, the figure to the right shows an edge coloring of a graph by the colors red, blue, and green. Edge colorings are one of several different types of graph coloring. The edge-coloring problem asks whether it is possible to color the edges of a given graph using at most k different colors, for a given value of k, or with the fewest possible colors.
Causal dynamical triangulationCausal dynamical triangulation (abbreviated as CDT), theorized by Renate Loll, Jan Ambjørn and Jerzy Jurkiewicz, is an approach to quantum gravity that, like loop quantum gravity, is background independent. This means that it does not assume any pre-existing arena (dimensional space) but, rather, attempts to show how the spacetime fabric itself evolves. There is evidence that, at large scales, CDT approximates the familiar 4-dimensional spacetime but shows spacetime to be 2-dimensional near the Planck scale, and reveals a fractal structure on slices of constant time.
Particular point topologyIn mathematics, the particular point topology (or included point topology) is a topology where a set is open if it contains a particular point of the topological space. Formally, let X be any non-empty set and p ∈ X. The collection of subsets of X is the particular point topology on X. There are a variety of cases that are individually named: If X has two points, the particular point topology on X is the Sierpiński space. If X is finite (with at least 3 points), the topology on X is called the finite particular point topology.
Maximal independent setIn graph theory, a maximal independent set (MIS) or maximal stable set is an independent set that is not a subset of any other independent set. In other words, there is no vertex outside the independent set that may join it because it is maximal with respect to the independent set property. For example, in the graph P_3, a path with three vertices a, b, and c, and two edges and , the sets {b} and {a, c} are both maximally independent. The set {a} is independent, but is not maximal independent, because it is a subset of the larger independent set {a, c}.
