Skip to search formSkip to main contentSkip to account menu

Simplicial complex

Known as: Underlying Space, The Simplicial complex, Pure simplicial complex 
In mathematics, a simplicial complex is a topological space of a certain kind, constructed by the union of points, line segments, triangles, and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

32 relations
Alpha shapeBarycentric subdivisionBetti numberCircle packing theorem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2020
Highly Cited
2020
Simplicial complexes: higher-order spectral dimension and dynamics
Simplicial complexes constitute the underlying topology of interacting complex systems including among the others brain and… 
Highly Cited
2018
Highly Cited
2018
Simplicial complexes and complex systems
We provide a short introduction to the field of topological data analysis (TDA) and discuss its possible relevance for the study… 
Highly Cited
2017
Highly Cited
2017
Extraction and characterization of sodium alginate from Moroccan Laminaria digitata brown seaweed
Highly Cited
2014
Highly Cited
2014
Random Simplicial Complexes
In this paper we propose a model of random simplicial complexes with randomness in all dimensions. We start with a set of n… 
Highly Cited
2007
Highly Cited
2007
The polyhedral product functor: a method of computation for moment-angle complexes, arrangements and related spaces
Highly Cited
2003
Highly Cited
2003
Antenna selection for multiple-antenna transmission systems: performance analysis and code construction
Multiantenna systems employing space-time coding over quasistatic Rayleigh fading channels is considered. We prove that by… 
Highly Cited
1994
Highly Cited
1994
ZCS: A Zeroth Level Classifier System
A basic classifier system, ZCS, is presented that keeps much of Holland's original framework but simplifies it to increase… 
Highly Cited
1991
Highly Cited
1991
P.L. Homeomorphic Manifolds are Equivalent by Elementary 5hellingst
  • U. Pachner
  • European journal of combinatorics (Print)
  • 1991
  • Corpus ID: 41983257
Highly Cited
1983
Highly Cited
1983
A fast encoding method for lattice codes and quantizers
In an earlier paper the authors described a very fast method which, for the root lattices A_{n}, D_{n}, E_{n} , their duals and… 
Highly Cited
1980
Highly Cited
1980
Combinatorial Connectivities in Social Systems: An Application of Simplicial Complex Structures to the Study of Large Organizations
This book is a presentation of my recent research work into the theory and applications of mathematical relations between finite… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)