simplicial

Then the Möbius function on P calculates the (reduced) Euler characteristic of that simplicial complex as µ(0, 1)=\Chi.

Now, the problem about real-world data is that it does not come in the form of a simplicial complex.

The Regge action on a simplicial complex, varied with the Schläfli identity, gives exact discrete field equations.

You can assign a simplicial complex to a partial order P with a max and a min element (0 and 1).

A breakfast buffet is a larger, possibly disconnected simplicial complex spanning multiple ingredient families.

(Apparently, being homeomorphic to a simplicial complex doesn't mean admitting a PL structure!

Also simplicial complexes (that are used in homological algebra and algebraic topology) can also come from triangulating high-dimensional point sets (for example from big data).

Loop quantum gravity, simplicial quantum gravity, and causal sets etc.

The ideas involved in it form the basis for the theory of simplicial homology, which in turn will lead you to general homology and cohomology theories.

This also generalizes from graphs to simplicial complexes (triangles, tetrahedra).

A simplicial complex is a sort of generalized graph.

The full state space is a simplicial complex.

Topologists like simplicial homology because it "only" requires that your input data is given in the form of a simplicial complex.

Their calculation is usually done by something that is called "simplicial homology" in algebraic topology.

"Now, the problem about real-world data is that it does not come in the form of a simplicial complex." Not really true.

"Modeling the Spread of Misfolded Proteins in #Alzheimer’s Disease using Higher-Order Simplicial Complex Contagion", big shout to Marcin, @iacopoiacopini, @lordgrilo & V.

Simplicial calculations for projective planes are not simple.

Simplicial complexes are useful UI primitives.