Wolfram Language
Paclet Repository
Community-contributed installable additions to the Wolfram Language
Primary Navigation
Categories
Cloud & Deployment
Core Language & Structure
Data Manipulation & Analysis
Engineering Data & Computation
External Interfaces & Connections
Financial Data & Computation
Geographic Data & Computation
Geometry
Graphs & Networks
Higher Mathematical Computation
Images
Knowledge Representation & Natural Language
Machine Learning
Notebook Documents & Presentation
Scientific and Medical Data & Computation
Social, Cultural & Linguistic Data
Strings & Text
Symbolic & Numeric Computation
System Operation & Setup
Time-Related Computation
User Interface Construction
Visualization & Graphics
Random Paclet
Alphabetical List
Using Paclets
Create a Paclet
Get Started
Download Definition Notebook
Learn More about
Wolfram Language
SimplicialHomology
Guides
SimplicialHomology
Symbols
BettiNumber
HomologyGroup
SimplicialAutomorphismGroup
SimplicialComplex
SimplicialCone
SimplicialIsomorphicQ
SimplicialJoin
SimplicialLink
SimplicialProduct
SimplicialStar
SimplicialSuspension
SubComplexQ
Taggar`SimplicialHomology`
S
u
b
C
o
m
p
l
e
x
Q
S
u
b
C
o
m
p
l
e
x
Q
[
s
c
1
,
s
c
2
]
c
h
e
c
k
s
i
f
s
c
2
i
s
a
s
u
b
c
o
m
p
l
e
x
o
f
s
c
1
.
D
e
t
a
i
l
s
a
n
d
O
p
t
i
o
n
s
▪
Both
k
1
and
k
2
must be
S
i
m
p
l
i
c
i
a
l
C
o
m
p
l
e
x
es.
Examples
(
3
)
Basic Examples
(
3
)
Check that a simplicial complex is subcomplex of the other:
I
n
[
1
]
:
=
S
u
b
C
o
m
p
l
e
x
Q
S
i
m
p
l
i
c
i
a
l
C
o
m
p
l
e
x
[
"
L
i
n
e
"
]
,
S
i
m
p
l
i
c
i
a
l
C
o
m
p
l
e
x
[
"
P
o
i
n
t
"
]
O
u
t
[
1
]
=
T
r
u
e
I
n
[
2
]
:
=
S
u
b
C
o
m
p
l
e
x
Q
S
i
m
p
l
i
c
i
a
l
C
o
m
p
l
e
x
[
"
S
p
h
e
r
e
"
]
,
S
i
m
p
l
i
c
i
a
l
C
o
m
p
l
e
x
[
"
C
i
r
c
l
e
"
]
O
u
t
[
2
]
=
T
r
u
e
Check that a simplicial complex is not a subcomplex of the other:
I
n
[
1
]
:
=
S
u
b
C
o
m
p
l
e
x
Q
S
i
m
p
l
i
c
i
a
l
C
o
m
p
l
e
x
[
"
T
r
i
a
n
g
l
e
"
]
,
S
i
m
p
l
i
c
i
a
l
C
o
m
p
l
e
x
[
"
T
o
r
u
s
"
]
O
u
t
[
1
]
=
F
a
l
s
e
A simplicial complex is always its own subcomplex:
I
n
[
1
]
:
=
S
u
b
C
o
m
p
l
e
x
Q
S
i
m
p
l
i
c
i
a
l
C
o
m
p
l
e
x
[
{
{
1
,
2
}
,
{
2
,
4
,
5
}
}
]
,
S
i
m
p
l
i
c
i
a
l
C
o
m
p
l
e
x
[
{
{
1
,
2
}
,
{
2
,
4
,
5
}
}
]
O
u
t
[
1
]
=
T
r
u
e
S
e
e
A
l
s
o
S
i
m
p
l
i
c
i
a
l
C
o
m
p
l
e
x
R
e
l
a
t
e
d
G
u
i
d
e
s
▪
S
i
m
p
l
i
c
i
a
l
H
o
m
o
l
o
g
y
"
"