|
CW Complex
A CW complex (also called cellular complex or cell complex) is a kind of a topological space that is particularly important in algebraic topology. It was introduced by J. H. C. Whitehead (open access) to meet the needs of homotopy theory. This class of spaces is broader and has some better categorical properties than simplicial complexes, but still retains a combinatorial nature that allows for computation (often with a much smaller complex). The ''C'' stands for "closure-finite", and the ''W'' for "weak" topology. Definition CW complex A CW complex is constructed by taking the union of a sequence of topological spaces\emptyset = X_ \subset X_0 \subset X_1 \subset \cdotssuch that each X_k is obtained from X_ by gluing copies of k-cells (e^k_\alpha)_\alpha, each homeomorphic to D^k, to X_ by continuous gluing maps g^k_\alpha: \partial e^k_\alpha \to X_. The maps are also called attaching maps. Each X_k is called the k-skeleton of the complex. The topology of X = \cup_ X_ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topological Space
In mathematics, a topological space is, roughly speaking, a geometrical space in which closeness is defined but cannot necessarily be measured by a numeric distance. More specifically, a topological space is a set whose elements are called points, along with an additional structure called a topology, which can be defined as a set of neighbourhoods for each point that satisfy some axioms formalizing the concept of closeness. There are several equivalent definitions of a topology, the most commonly used of which is the definition through open sets, which is easier than the others to manipulate. A topological space is the most general type of a mathematical space that allows for the definition of limits, continuity, and connectedness. Common types of topological spaces include Euclidean spaces, metric spaces and manifolds. Although very general, the concept of topological spaces is fundamental, and used in virtually every branch of modern mathematics. The study of topological spac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gluing (topology)
In topology and related areas of mathematics, the quotient space of a topological space under a given equivalence relation is a new topological space constructed by endowing the quotient set of the original topological space with the quotient topology, that is, with the finest topology that makes continuous the canonical projection map (the function that maps points to their equivalence classes). In other words, a subset of a quotient space is open if and only if its preimage under the canonical projection map is open in the original topological space. Intuitively speaking, the points of each equivalence class are or "glued together" for forming a new topological space. For example, identifying the points of a sphere that belong to the same diameter produces the projective plane as a quotient space. Definition Let \left(X, \tau_X\right) be a topological space, and let \,\sim\, be an equivalence relation on X. The quotient set, Y = X / \sim\, is the set of equivalence classes o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Two-point Space
In topology In mathematics, topology (from the Greek words , and ) is concerned with the properties of a geometric object that are preserved under continuous deformations, such as stretching, twisting, crumpling, and bending; that is, without closing ..., a branch of mathematics, a discrete two-point space is the simplest example of a totally disconnected discrete space. The points can be denoted by the symbols 0 and 1. Properties Any disconnected space has a continuous function (topology), continuous mapping which is not constant onto the discrete two-point space. Conversely if a nonconstant continuous mapping to the discrete two-point space exists from a topological space, the space is disconnected. See also * List of topologies References {{Reflist Topological spaces ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generic Property
In mathematics, properties that hold for "typical" examples are called generic properties. For instance, a generic property of a class of functions is one that is true of "almost all" of those functions, as in the statements, "A generic polynomial does not have a root at zero," or "A generic square matrix is invertible." As another example, a generic property of a space is a property that holds at "almost all" points of the space, as in the statement, "If is a smooth function between smooth manifolds, then a generic point of is not a critical value of ." (This is by Sard's theorem.) There are many different notions of "generic" (what is meant by "almost all") in mathematics, with corresponding dual notions of "almost none" (negligible set); the two main classes are: * In measure theory, a generic property is one that holds almost everywhere, with the dual concept being null set, meaning "with probability 0". * In topology and algebraic geometry, a generic property is one th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trivalent Graph
In the mathematical field of graph theory, a cubic graph is a graph in which all vertices have degree three. In other words, a cubic graph is a 3-regular graph. Cubic graphs are also called trivalent graphs. A bicubic graph is a cubic bipartite graph. Symmetry In 1932, Ronald M. Foster began collecting examples of cubic symmetric graphs, forming the start of the Foster census.. Many well-known individual graphs are cubic and symmetric, including the utility graph, the Petersen graph, the Heawood graph, the Möbius–Kantor graph, the Pappus graph, the Desargues graph, the Nauru graph, the Coxeter graph, the Tutte–Coxeter graph, the Dyck graph, the Foster graph and the Biggs–Smith graph. W. T. Tutte classified the symmetric cubic graphs by the smallest integer number ''s'' such that each two oriented paths of length ''s'' can be mapped to each other by exactly one symmetry of the graph. He showed that ''s'' is at most 5, and provided examples of graphs with each possible ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph (discrete Mathematics)
In discrete mathematics, and more specifically in graph theory, a graph is a structure amounting to a Set (mathematics), set of objects in which some pairs of the objects are in some sense "related". The objects correspond to mathematical abstractions called ''Vertex (graph theory), vertices'' (also called ''nodes'' or ''points'') and each of the related pairs of vertices is called an ''edge'' (also called ''link'' or ''line''). Typically, a graph is depicted in diagrammatic form as a set of dots or circles for the vertices, joined by lines or curves for the edges. Graphs are one of the objects of study in discrete mathematics. The edges may be directed or undirected. For example, if the vertices represent people at a party, and there is an edge between two people if they shake hands, then this graph is undirected because any person ''A'' can shake hands with a person ''B'' only if ''B'' also shakes hands with ''A''. In contrast, if an edge from a person ''A'' to a person ''B'' m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
3-sphere
In mathematics, a 3-sphere is a higher-dimensional analogue of a sphere. It may be embedded in 4-dimensional Euclidean space as the set of points equidistant from a fixed central point. Analogous to how the boundary of a ball in three dimensions is an ordinary sphere (or 2-sphere, a two-dimensional surface), the boundary of a ball in four dimensions is a 3-sphere (an object with three dimensions). A 3-sphere is an example of a 3-manifold and an ''n''-sphere. Definition In coordinates, a 3-sphere with center and radius is the set of all points in real, 4-dimensional space () such that :\sum_^3(x_i - C_i)^2 = ( x_0 - C_0 )^2 + ( x_1 - C_1 )^2 + ( x_2 - C_2 )^2+ ( x_3 - C_3 )^2 = r^2. The 3-sphere centered at the origin with radius 1 is called the unit 3-sphere and is usually denoted : :S^3 = \left\. It is often convenient to regard as the space with 2 complex dimensions () or the quaternions (). The unit 3-sphere is then given by :S^3 = \left\ or :S^3 = \left\. This ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
K-vertex-connected Graph
In graph theory, a connected graph is said to be -vertex-connected (or -connected) if it has more than vertices and remains connected whenever fewer than vertices are removed. The vertex-connectivity, or just connectivity, of a graph is the largest for which the graph is -vertex-connected. Definitions A graph (other than a complete graph) has connectivity ''k'' if ''k'' is the size of the smallest subset of vertices such that the graph becomes disconnected if you delete them. Complete graphs are not included in this version of the definition since they cannot be disconnected by deleting vertices. The complete graph with ''n'' vertices has connectivity ''n'' − 1, as implied by the first definition. An equivalent definition is that a graph with at least two vertices is ''k''-connected if, for every pair of its vertices, it is possible to find ''k'' vertex-independent paths connecting these vertices; see Menger's theorem . This definition produces the same ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Surface
A surface, as the term is most generally used, is the outermost or uppermost layer of a physical object or space. It is the portion or region of the object that can first be perceived by an observer using the senses of sight and touch, and is the portion with which other materials first interact. The surface of an object is more than "a mere geometric solid", but is "filled with, spread over by, or suffused with perceivable qualities such as color and warmth". The concept of surface has been abstracted and formalized in mathematics, specifically in geometry. Depending on the properties on which the emphasis is given, there are several non equivalent such formalizations, that are all called ''surface'', sometimes with some qualifier, such as algebraic surface, smooth surface or fractal surface. The concept of surface and its mathematical abstraction are both widely used in physics, engineering, computer graphics, and many other disciplines, primarily in representing the surfaces ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Embedding
In topological graph theory, an embedding (also spelled imbedding) of a Graph (discrete mathematics), graph G on a surface (mathematics), surface \Sigma is a representation of G on \Sigma in which points of \Sigma are associated with graph theory, vertices and simple arcs (Homeomorphism, homeomorphic images of [0,1]) are associated with graph theory, edges in such a way that: * the endpoints of the arc associated with an edge e are the points associated with the end vertices of e, * no arcs include points associated with other vertices, * two arcs never intersect at a point which is interior to either of the arcs. Here a surface is a compact space, compact, connected space, connected 2-manifold. Informally, an embedding of a graph into a surface is a drawing of the graph on the surface in such a way that its edges may intersect only at their endpoints. It is well known that any finite graph can be embedded in 3-dimensional Euclidean space \mathbb^3.. A planar graph is one that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Loop (graph Theory)
In graph theory, a loop (also called a self-loop or a ''buckle'') is an edge that connects a vertex to itself. A simple graph contains no loops. Depending on the context, a graph or a multigraph may be defined so as to either allow or disallow the presence of loops (often in concert with allowing or disallowing multiple edges between the same vertices): * Where graphs are defined so as to ''allow'' loops and multiple edges, a graph without loops or multiple edges is often distinguished from other graphs by calling it a ''simple graph''. * Where graphs are defined so as to ''disallow'' loops and multiple edges, a graph that does have loops or multiple edges is often distinguished from the graphs that satisfy these constraints by calling it a ''multigraph'' or ''pseudograph''. In a graph with one vertex, all edges must be loops. Such a graph is called a bouquet. Degree For an undirected graph, the degree of a vertex is equal to the number of adjacent vertices. A special case i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quotient Topology
In topology and related areas of mathematics, the quotient space of a topological space under a given equivalence relation is a new topological space constructed by endowing the quotient set of the original topological space with the quotient topology, that is, with the finest topology that makes continuous the canonical projection map (the function that maps points to their equivalence classes). In other words, a subset of a quotient space is open if and only if its preimage under the canonical projection map is open in the original topological space. Intuitively speaking, the points of each equivalence class are or "glued together" for forming a new topological space. For example, identifying the points of a sphere that belong to the same diameter produces the projective plane as a quotient space. Definition Let \left(X, \tau_X\right) be a topological space, and let \,\sim\, be an equivalence relation on X. The quotient set, Y = X / \sim\, is the set of equivalence clas ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
