enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Abstract simplicial complex - Wikipedia

    en.wikipedia.org/wiki/Abstract_simplicial_complex

    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. [2]

  3. Alexander duality - Wikipedia

    en.wikipedia.org/wiki/Alexander_duality

    That is, the correct answer in honest Betti numbers is 2, 0, 0. Once more, it is the reduced Betti numbers that work out. With those, we begin with 0, 1, 0. to finish with 1, 0, 0. From these two examples, therefore, Alexander's formulation can be inferred: reduced Betti numbers ~ are related in complements by

  4. Hypergraph - Wikipedia

    en.wikipedia.org/wiki/Hypergraph

    A downward-closed hypergraph is usually called an abstract simplicial complex. It is generally not reduced, unless all hyperedges have cardinality 1. An abstract simplicial complex with the augmentation property is called a matroid. Laminar: for any two hyperedges, either they are disjoint, or one is included in the other.

  5. h-vector - Wikipedia

    en.wikipedia.org/wiki/H-vector

    Let Δ be an abstract simplicial complex of dimension d − 1 with f i i-dimensional faces and f −1 = 1. These numbers are arranged into the f-vector of Δ, = (,, …,).An important special case occurs when Δ is the boundary of a d-dimensional convex polytope.

  6. Simplicial complex - Wikipedia

    en.wikipedia.org/wiki/Simplicial_complex

    A simplicial 3-complex. In mathematics, a simplicial complex is a set composed of points, line segments, triangles, and their n-dimensional counterparts (see illustration). Simplicial complexes should not be confused with the more abstract notion of a simplicial set appearing in modern simplicial homotopy theory.

  7. Kruskal–Katona theorem - Wikipedia

    en.wikipedia.org/wiki/Kruskal–Katona_theorem

    In algebraic combinatorics, the Kruskal–Katona theorem gives a complete characterization of the f-vectors of abstract simplicial complexes.It includes as a special case the ErdÅ‘s–Ko–Rado theorem and can be restated in terms of uniform hypergraphs.

  8. Poset topology - Wikipedia

    en.wikipedia.org/wiki/Poset_topology

    The order complex associated to a poset (S, ≤) has the set S as vertices, and the finite chains of (S, ≤) as faces. The poset topology associated to a poset ( S , ≤) is then the Alexandrov topology on the order complex associated to ( S , ≤).

  9. Family of sets - Wikipedia

    en.wikipedia.org/wiki/Family_of_sets

    An abstract simplicial complex is a set family (consisting of finite sets) that is downward closed; that is, every subset of a set in is also in . A matroid is an abstract simplicial complex with an additional property called the augmentation property. Every filter is a family of sets.