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. 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.
A collection Δ of non-empty finite subsets of a set S is called a set-family.
A set-family Δ is called an abstract simplicial complex if, for every set X in Δ, and every non-empty subset Y ⊆ X, the set Y also belongs to Δ.
The finite sets that belong to Δ are called faces of the complex, and a face Y is said to belong to another face X if Y ⊆ X, so the definition of an abstract simplicial complex can be restated as saying that every face of a face of a complex Δ is itself a face of Δ. The vertex set of Δ is defined as V(Δ) = ∪Δ, the union of all faces of Δ. The elements of the vertex set are called the vertices of the complex. For every vertex v of Δ, the set {v} is a face of the complex, and every face of the complex is a finite subset of the vertex set.
The maximal faces of Δ (i.e., faces that are not subsets of any other faces) are called facets of the complex. The dimension of a face X in Δ is defined as dim(X) = X − 1: faces consisting of a single element are zero-dimensional, faces consisting of two elements are one-dimensional, etc. The dimension of the complex dim(Δ) is defined as the largest dimension of any of its faces, or infinity if there is no finite bound on the dimension of the faces.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Demonstrates the equivalence between simplicial and singular homology, proving isomorphisms for finite s-complexes and discussing long exact sequences.
In this reading group, we will work together through recent important papers in applied topology.
Participants will take turns presenting articles, then leading a discussion of the contents.
This course will provide an introduction to model category theory, which is an abstract framework for generalizing homotopy theory beyond topological spaces and continuous maps. We will study numerous
Homology is one of the most important tools to study topological spaces and it plays an important role in many fields of mathematics. The aim of this course is to introduce this notion, understand its
In mathematics, a simplicial set is an object composed of simplices in a specific way. Simplicial sets are higher-dimensional generalizations of directed graphs, partially ordered sets and . Formally, a simplicial set may be defined as a contravariant functor from the to the . Simplicial sets were introduced in 1950 by Samuel Eilenberg and Joseph A. Zilber. Every simplicial set gives rise to a "nice" topological space, known as its geometric realization.
In set theory and related branches of mathematics, a collection of subsets of a given set is called a family of subsets of , or a family of sets over More generally, a collection of any sets whatsoever is called a family of sets, set family, or a set system. A family of sets may be defined as a function from a set , known as the index set, to , in which case the sets of the family are indexed by members of .
In combinatorics, a Sperner family (or Sperner system; named in honor of Emanuel Sperner), or clutter, is a family F of subsets of a finite set E in which none of the sets contains another. Equivalently, a Sperner family is an antichain in the inclusion lattice over the power set of E. A Sperner family is also sometimes called an independent system or irredundant set. Sperner families are counted by the Dedekind numbers, and their size is bounded by Sperner's theorem and the Lubell–Yamamoto–Meshalkin inequality.
In this thesis, we apply cochain complexes as an algebraic model of space in a diverse range of mathematical and scientific settings. We begin with an algebraic-discrete Morse theory model of auto-encoding cochain data, connecting the homotopy theory of d ...
Simplicial Kuramoto models have emerged as a diverse and intriguing class of models describing oscillators on simplices rather than nodes. In this paper, we present a unified framework to describe different variants of these models, categorized into three ...
In this paper we fully describe the trajectory of gradient flow over diagonal linear networks in the limit of vanishing initialisation. We show that the limiting flow successively jumps from a saddle of the training loss to another until reaching the minim ...