|
Subdivision (simplicial Complex)
A subdivision (also called refinement) of a simplicial complex is another simplicial complex in which, intuitively, one or more simplices of the original complex have been partitioned into smaller simplices. The most commonly used subdivision is the barycentric subdivision, but the term is more general. The subdivision is defined in slightly different ways in different contexts. In geometric simplicial complexes Let ''K'' be a geometric simplicial complex (GSC). A subdivision of ''K'' is a GSC ''L'' such that: * , ''K'', = , ''L'', , that is, the union of simplices in ''K'' equals the union of simplices in ''L'' (they cover the same region in space). * each simplex of ''L'' is contained in some simplex of ''K''. As an example, let ''K'' be a GSC containing a single triangle (with all its faces and vertices). Let ''D'' be a point on the face AB. Let ''L'' be the complex containing the two triangles and (with all their faces and vertices). Then ''L'' is a subdivision of ''K ... [...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] |
Barycentric Subdivision
In mathematics, the barycentric subdivision is a standard way to subdivide a given simplex into smaller ones. Its extension to simplicial complexes is a canonical method to refining them. Therefore, the barycentric subdivision is an important tool in algebraic topology. Motivation The barycentric subdivision is an operation on simplicial complexes. In algebraic topology it is sometimes useful to replace the original spaces with simplicial complexes via triangulations: This substitution allows one to assign combinatorial invariants such as the Euler characteristic to the spaces. One can ask whether there is an analogous way to replace the continuous functions defined on the topological spaces with functions that are linear on the simplices and homotopic to the original maps (see also simplicial approximation). In general, such an assignment requires a refinement of the given complex, meaning that one replaces larger simplices with a union of smaller simplices. A standard way to c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometric Simplicial Complex
In mathematics, a simplicial complex is a structured set composed of points, line segments, triangles, and their ''n''-dimensional counterparts, called 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 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 simplices that satisfies the following conditions: # Every face of a simplex from \mathcal is also in \mathcal. # The non-empty intersection of any two simplices \sigma_1, \sigma_2 \in \mathcal is a face of both \sigma_1 and \sigma_2. See also the definition of an abstract simplicia ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Join (topology)
In topology, a field of mathematics, the join of two topological spaces A and B, often denoted by A\ast B or A\star B, is a topological space formed by taking the disjoint union of the two spaces, and attaching line segments joining every point in A to every point in B. The join of a space A with itself is denoted by A^ := A\star A. The join is defined in slightly different ways in different contexts Geometric sets If A and B are subsets of the Euclidean space \mathbb^n, then: A\star B\ :=\ \,that is, the set of all line-segments between a point in A and a point in B. Some authors restrict the definition to subsets that are ''joinable'': any two different line-segments, connecting a point of A to a point of B, meet in at most a common endpoint (that is, they do not intersect in their interior). Every two subsets can be made "joinable". For example, if A is in \mathbb^n and B is in \mathbb^m, then A\times\\times\ and \\times B\times\ are joinable in \mathbb^. The figure above show ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Barycenter
In astronomy, the barycenter (or barycentre; ) is the center of mass of two or more bodies that orbit one another and is the point about which the bodies orbit. A barycenter is a dynamical point, not a physical object. It is an important concept in fields such as astronomy and astrophysics. The distance from a body's center of mass to the barycenter can be calculated as a two-body problem. If one of the two orbiting bodies is much more massive than the other and the bodies are relatively close to one another, the barycenter will typically be located within the more massive object. In this case, rather than the two bodies appearing to orbit a point between them, the less massive body will appear to orbit about the more massive body, while the more massive body might be observed to wobble slightly. This is the case for the Earth–Moon system, whose barycenter is located on average from Earth's center, which is 74% of Earth's radius of . When the two bodies are of similar m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polyhedron
In geometry, a polyhedron (: polyhedra or polyhedrons; ) is a three-dimensional figure with flat polygonal Face (geometry), faces, straight Edge (geometry), edges and sharp corners or Vertex (geometry), vertices. The term "polyhedron" may refer either to a solid figure or to its boundary surface (mathematics), surface. The terms solid polyhedron and polyhedral surface are commonly used to distinguish the two concepts. Also, the term ''polyhedron'' is often used to refer implicitly to the whole structure (mathematics), structure formed by a solid polyhedron, its polyhedral surface, its faces, its edges, and its vertices. There are many definitions of polyhedron. Nevertheless, the polyhedron is typically understood as a generalization of a two-dimensional polygon and a three-dimensional specialization of a polytope, a more general concept in any number of dimensions. Polyhedra have several general characteristics that include the number of faces, topological classification by Eule ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Abstract Simplicial Complex
In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family. It is a purely combinatorial description of the geometric notion of a simplicial complex. Lee, John M., Introduction to Topological Manifolds, Springer 2011, , p153 For example, in a 2-dimensional simplicial complex, the sets in the family are the triangles (sets of size 3), their edges (sets of size 2), and their vertices (sets of size 1). In the context of matroids and greedoids, abstract simplicial complexes are also called independence systems. An abstract simplex can be studied algebraically by forming its Stanley–Reisner ring; this sets up a powerful relation between combinatorics and commutative algebra. Definitions A collection of non-empty finite subsets of a set ''S'' is called a set-family. A set-family is called an abstract simplicial ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Poset
In mathematics, especially order theory, a partial order on a Set (mathematics), set is an arrangement such that, for certain pairs of elements, one precedes the other. The word ''partial'' is used to indicate that not every pair of elements needs to be comparable; that is, there may be pairs for which neither element precedes the other. Partial orders thus generalize total orders, in which every pair is comparable. Formally, a partial order is a homogeneous binary relation that is Reflexive relation, reflexive, antisymmetric relation, antisymmetric, and Transitive relation, transitive. A partially ordered set (poset for short) is an ordered pair P=(X,\leq) consisting of a set X (called the ''ground set'' of P) and a partial order \leq on X. When the meaning is clear from context and there is no ambiguity about the partial order, the set X itself is sometimes called a poset. Partial order relations The term ''partial order'' usually refers to the reflexive partial order relatio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simplicial Sets
In 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 (mathematics), 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 Four-dimensional space, 4-dimensional simplex is a 5-cell. Specifically, a -simplex is a -dimensional polytope that is the convex hull of its Vertex (geometry), vertices. More formally, suppose the points u_0, \dots, u_k are affinely independent, which means that the vectors u_1 - u_0,\dots, u_k-u_0 are linearly independent. Then, the simplex determined by them is the set of points C = \left\. A regular simplex is a simplex that is also a regular polytope. A regular -simplex may be constructed from a regular -simplex by connecti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
