|
Cubical Complex
In mathematics, a cubical complex (also called cubical set and Cartesian complex) is a set composed of points, line segments, squares, cubes, and their ''n''-dimensional counterparts. They are used analogously to simplicial complexes and CW complexes in the computation of the homology of topological spaces. Non-positively curved and CAT(0) cube complexes appear with increasing significance in geometric group theory. Definitions With regular cubes A unit cube (often just called a cube) of dimension n\ge 0 is the metric space obtained as the finite (l^2) cartesian product C_n = I^n of n copies of the unit interval I = , 1/math>. A face of a unit cube is a subset F \subset of the form F = \prod_^n J_i, where for all 1\le i\le n, J_i is either \, \, or , 1/math>. The dimension of the face F is the number of indices i such that J_i = , 1/math>; a face of dimension k, or k-face, is itself naturally a unit elementary cube of dimension k, and is sometimes called a subcube of F. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory (the study of numbers), algebra (the study of formulas and related structures), geometry (the study of shapes and spaces that contain them), Mathematical analysis, analysis (the study of continuous changes), and set theory (presently used as a foundation for all mathematics). Mathematics involves the description and manipulation of mathematical object, abstract objects that consist of either abstraction (mathematics), abstractions from nature orin modern mathematicspurely abstract entities that are stipulated to have certain properties, called axioms. Mathematics uses pure reason to proof (mathematics), prove properties of objects, a ''proof'' consisting of a succession of applications of in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polyhedral Complex
In mathematics, a polyhedral complex is a set of polyhedra in a real vector space that fit together in a specific way. Polyhedral complexes generalize simplicial complexes and arise in various areas of polyhedral geometry, such as tropical geometry, splines and hyperplane arrangements. Definition A polyhedral complex \mathcal is a set of polyhedra that satisfies the following conditions: :1. Every face of a polyhedron from \mathcal is also in \mathcal. :2. The intersection of any two polyhedra \sigma_1, \sigma_2 \in \mathcal is a face of both \sigma_1 and \sigma_2. Note that the empty set is a face of every polyhedron, and so the intersection of two polyhedra in \mathcal may be empty. Examples * Tropical varieties are polyhedral complexes satisfying a certain ''balancing condition''. * Simplicial complexes are polyhedral complexes in which every polyhedron is a simplex. * Voronoi diagrams. * Splines. Fans A fan is a polyhedral complex in which every polyhedron is a cone from ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simplicial Homology
In algebraic topology, simplicial homology is the sequence of homology groups of a simplicial complex. It formalizes the idea of the number of holes of a given dimension in the complex. This generalizes the number of connected component (topology), connected components (the case of dimension 0). Simplicial homology arose as a way to study topological spaces whose building blocks are ''n''-simplices, the ''n''-dimensional analogs of triangles. This includes a point (0-simplex), a line segment (1-simplex), a triangle (2-simplex) and a tetrahedron (3-simplex). By definition, such a space is homeomorphic to a simplicial complex (more precisely, the abstract simplicial complex, geometric realization of an abstract simplicial complex). Such a homeomorphism is referred to as a ''Triangulation (topology), triangulation'' of the given space. Many topological spaces of interest can be triangulated, including every smooth manifold (Cairns and J.H.C. Whitehead, Whitehead). Simplicial homology ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simplicial Complex
In mathematics, a simplicial complex is a structured Set (mathematics), set composed of Point (geometry), points, line segments, triangles, and their ''n''-dimensional counterparts, called Simplex, simplices, such that all the faces and intersections of the elements are also included in the set (see illustration). Simplicial complexes should not be confused with the more abstract notion of a simplicial set appearing in modern simplicial homotopy theory. The purely Combinatorics, combinatorial counterpart to a simplicial complex is an abstract simplicial complex. To distinguish a simplicial complex from an abstract simplicial complex, the former is often called a geometric simplicial complex., Section 4.3 Definitions A simplicial complex \mathcal is a set of Simplex, simplices that satisfies the following conditions: # Every Simplex#Elements, face of a simplex from \mathcal is also in \mathcal. # The non-empty Set intersection, intersection of any two simplices \sigma_1, \sigma_ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometrization Conjecture
In mathematics, Thurston's geometrization conjecture (now a theorem) states that each of certain three-dimensional topological spaces has a unique geometric structure that can be associated with it. It is an analogue of the uniformization theorem for two-dimensional surfaces, which states that every simply connected Riemann surface can be given one of three geometries ( Euclidean, spherical, or hyperbolic). In three dimensions, it is not always possible to assign a single geometry to a whole topological space. Instead, the geometrization conjecture states that every closed 3-manifold can be decomposed in a canonical way into pieces that each have one of eight types of geometric structure. The conjecture was proposed by as part of his 24 questions, and implies several other conjectures, such as the Poincaré conjecture and Thurston's elliptization conjecture. Thurston's hyperbolization theorem implies that Haken manifolds satisfy the geometrization conjecture. Thurston ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Virtually Haken Conjecture
In topology, an area of mathematics, the virtually Haken conjecture states that every compact, orientable, irreducible three-dimensional manifold with infinite fundamental group is ''virtually Haken''. That is, it has a finite cover (a covering space with a finite-to-one covering map) that is a Haken manifold. After the proof of the geometrization conjecture by Perelman, the conjecture was only open for hyperbolic 3-manifolds. The conjecture is usually attributed to Friedhelm Waldhausen in a paper from 1968, although he did not formally state it. This problem is formally stated as Problem 3.2 in Kirby's problem list. A proof of the conjecture was announced on March 12, 2012 by Ian Agol in a seminar lecture he gave at the Institut Henri Poincaré. The proof appeared shortly thereafter in a preprint which was eventually published in Documenta Mathematica. The proof was obtained via a strategy by previous work of Daniel Wise and collaborators, relying on actions of the fun ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bass–Serre Theory
Bass–Serre theory is a part of the mathematical subject of group theory that deals with analyzing the algebraic structure of groups acting by automorphisms on simplicial trees. The theory relates group actions on trees with decomposing groups as iterated applications of the operations of free product with amalgamation and HNN extension, via the notion of the fundamental group of a graph of groups. Bass–Serre theory can be regarded as one-dimensional version of the orbifold theory. History Bass–Serre theory was developed by Jean-Pierre Serre in the 1970s and formalized in ''Trees'', Serre's 1977 monograph (developed in collaboration with Hyman Bass) on the subject. Serre's original motivation was to understand the structure of certain algebraic groups whose Bruhat–Tits buildings are trees. However, the theory quickly became a standard tool of geometric group theory and geometric topology, particularly the study of 3-manifolds. Subsequent work of Bass contributed su ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
CAT(0) Group
In mathematics, a CAT(0) group is a finitely generated group with a group action on a CAT(0) space that is geometrically proper, cocompact, and isometric. They form a possible notion of non-positively curved group in geometric group theory. Definition Let G be a group. Then G is said to be a CAT(0) group if there exists a metric space X and an action of G on X such that: # X is a CAT(0) metric space # The action of G on X is by isometries, i.e. it is a group homomorphism G \longrightarrow \mathrm(X) # The action of G on X is geometrically proper (see below) # The action is cocompact: there exists a compact subset K\subset X whose translates under G together cover X, i.e. X = G\cdot K = \bigcup_ g\cdot K An group action on a metric space satisfying conditions 2 - 4 is sometimes called ''geometric''. This definition is analogous to one of the many possible definitions of a Gromov-hyperbolic group, where the condition that X is CAT(0) is replaced with Gromov-hyperbolicity of X ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computability
Computability is the ability to solve a problem by an effective procedure. It is a key topic of the field of computability theory within mathematical logic and the theory of computation within computer science. The computability of a problem is closely linked to the existence of an algorithm to solve the problem. The most widely studied models of computability are the Turing-computable and μ-recursive functions, and the lambda calculus, all of which have computationally equivalent power. Other forms of computability are studied as well: computability notions weaker than Turing machines are studied in automata theory, while computability notions stronger than Turing machines are studied in the field of hypercomputation. Problems A central idea in computability is that of a (computational) problem, which is a task whose computability can be explored. There are two key types of problems: * A decision problem fixes a set ''S'', which may be a set of strings, natural numbers, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Singular Homology
In algebraic topology, singular homology refers to the study of a certain set of algebraic invariants of a topological space X, the so-called homology groups H_n(X). Intuitively, singular homology counts, for each dimension n, the n-dimensional holes of a space. Singular homology is a particular example of a homology theory, which has now grown to be a rather broad collection of theories. Of the various theories, it is perhaps one of the simpler ones to understand, being built on fairly concrete constructions (see also the related theory simplicial homology). In brief, singular homology is constructed by taking maps of the simplex, standard -simplex to a topological space, and composing them into Free abelian group#Integer functions and formal sums, formal sums, called singular chains. The boundary operation – mapping each n-dimensional simplex to its (n-1)-dimensional boundary operator, boundary – induces the singular chain complex. The singular homology is then ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homeomorphism
In mathematics and more specifically in topology, a homeomorphism ( from Greek roots meaning "similar shape", named by Henri Poincaré), also called topological isomorphism, or bicontinuous function, is a bijective and continuous function between topological spaces that has a continuous inverse function. Homeomorphisms are the isomorphisms in the category of topological spaces—that is, they are the mappings that preserve all the topological properties of a given space. Two spaces with a homeomorphism between them are called homeomorphic, and from a topological viewpoint they are the same. Very roughly speaking, a topological space is a geometric object, and a homeomorphism results from a continuous deformation of the object into a new shape. Thus, a square and a circle are homeomorphic to each other, but a sphere and a torus are not. However, this description can be misleading. Some continuous deformations do not produce homeomorphisms, such as the deformation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete & Computational Geometry
'' Discrete & Computational Geometry'' is a peer-reviewed mathematics journal published quarterly by Springer. Founded in 1986 by Jacob E. Goodman and Richard M. Pollack, the journal publishes articles on discrete geometry and computational geometry. Abstracting and indexing The journal is indexed in: * ''Mathematical Reviews'' * '' Zentralblatt MATH'' * ''Science Citation Index'' * ''Current Contents ''Current Contents'' is a rapid alerting service database from Clarivate, formerly the Institute for Scientific Information and Thomson Reuters. It is published online and in several different printed subject sections. History ''Current Contents ...'' Notable articles Two articles published in ''Discrete & Computational Geometry'', one by Gil Kalai in 1992 with a proof of a subexponential upper bound on the diameter of a polytope and another by Samuel Ferguson in 2006 on the Kepler conjecture on optimal three-dimensional sphere packing, earned their authors the Fulk ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
