Examples of simplicial complexes¶
There are two main types: manifolds and examples related to graph theory.
For manifolds, there are functions defining the \(n\)sphere for any \(n\), the torus, \(n\)dimensional real projective space for any \(n\), the complex projective plane, surfaces of arbitrary genus, and some other manifolds, all as simplicial complexes.
Aside from surfaces, this file also provides functions for
constructing some other simplicial complexes: the simplicial complex
of not\(i\)connected graphs on \(n\) vertices, the matching complex on n
vertices, the chessboard complex for an \(n\) by \(i\) chessboard, and
others. These provide examples of large simplicial complexes; for
example, simplicial_complexes.NotIConnectedGraphs(7,2)
has over a
million simplices.
All of these examples are accessible by typing
simplicial_complexes.NAME
, where NAME
is the name of the example.
BarnetteSphere()
BrucknerGrunbaumSphere()
ChessboardComplex()
ComplexProjectivePlane()
DunceHat()
K3Surface()
KleinBottle()
MatchingComplex()
MooreSpace()
NotIConnectedGraphs()
PoincareHomologyThreeSphere()
PseudoQuaternionicProjectivePlane()
RandomComplex()
RandomTwoSphere()
RealProjectivePlane()
RealProjectiveSpace()
RudinBall()
ShiftedComplex()
Simplex()
Sphere()
SumComplex()
SurfaceOfGenus()
Torus()
ZieglerBall()
You can also get a list by typing simplicial_complexes.
and hitting the
TAB key.
EXAMPLES:
sage: S = simplicial_complexes.Sphere(2) # the 2sphere
sage: S.homology()
{0: 0, 1: 0, 2: Z}
sage: simplicial_complexes.SurfaceOfGenus(3)
Triangulation of an orientable surface of genus 3
sage: M4 = simplicial_complexes.MooreSpace(4)
sage: M4.homology()
{0: 0, 1: C4, 2: 0}
sage: simplicial_complexes.MatchingComplex(6).homology()
{0: 0, 1: Z^16, 2: 0}

sage.homology.examples.
BarnetteSphere
()¶ Returns Barnette’s triangulation of the 3sphere.
This is a pure simplicial complex of dimension 3 with 8 vertices and 19 facets, which is a nonpolytopal triangulation of the 3sphere. It was constructed by Barnette in [Bar1970]. The construction here uses the labeling from De Loera, Rambau and Santos [DLRS2010]. Another reference is chapter III.4 of Ewald [Ewa1996].
EXAMPLES:
sage: BS = simplicial_complexes.BarnetteSphere() ; BS Barnette's triangulation of the 3sphere sage: BS.f_vector() [1, 8, 27, 38, 19]

sage.homology.examples.
BrucknerGrunbaumSphere
()¶ Returns Bruckner and Grunbaum’s triangulation of the 3sphere.
This is a pure simplicial complex of dimension 3 with 8 vertices and 20 facets, which is a nonpolytopal triangulation of the 3sphere. It appeared first in [Br1910] and was studied in [GrS1967].
It is defined here as the link of any vertex in the unique minimal triangulation of the complex projective plane, see chapter 4 of [Kuh1995].
EXAMPLES:
sage: BGS = simplicial_complexes.BrucknerGrunbaumSphere() ; BGS Bruckner and Grunbaum's triangulation of the 3sphere sage: BGS.f_vector() [1, 8, 28, 40, 20]

sage.homology.examples.
ChessboardComplex
(n, i)¶ The chessboard complex for an \(n \times i\) chessboard.
Fix integers \(n, i > 0\) and consider sets \(V\) of \(n\) vertices and \(W\) of \(i\) vertices. A ‘partial matching’ between \(V\) and \(W\) is a graph formed by edges \((v,w)\) with \(v \in V\) and \(w \in W\) so that each vertex is in at most one edge. If \(G\) is a partial matching, then so is any graph obtained by deleting edges from \(G\). Thus the set of all partial matchings on \(V\) and \(W\), viewed as a set of subsets of the \(n+i\) choose 2 possible edges, is closed under taking subsets, and thus forms a simplicial complex called the ‘chessboard complex’. This function produces that simplicial complex. (It is called the chessboard complex because such graphs also correspond to ways of placing rooks on an \(n\) by \(i\) chessboard so that none of them are attacking each other.)
INPUT:
n, i
– positive integers.
See Dumas et al. [DHSW2003] for information on computing its homology by computer, and see Wachs [Wac2003] for an expository article about the theory.
EXAMPLES:
sage: C = simplicial_complexes.ChessboardComplex(5,5) sage: C.f_vector() [1, 25, 200, 600, 600, 120] sage: simplicial_complexes.ChessboardComplex(3,3).homology() {0: 0, 1: Z x Z x Z x Z, 2: 0}

sage.homology.examples.
ComplexProjectivePlane
()¶ A minimal triangulation of the complex projective plane.
This was constructed by Kühnel and Banchoff [KB1983].
EXAMPLES:
sage: C = simplicial_complexes.ComplexProjectivePlane() sage: C.f_vector() [1, 9, 36, 84, 90, 36] sage: C.homology(2) Z sage: C.homology(4) Z

sage.homology.examples.
DunceHat
()¶ Return the minimal triangulation of the dunce hat given by Hachimori [Hac2016].
This is a standard example of a space that is contractible but not collapsible.
EXAMPLES:
sage: D = simplicial_complexes.DunceHat(); D Minimal triangulation of the dunce hat sage: D.f_vector() [1, 8, 24, 17] sage: D.homology() {0: 0, 1: 0, 2: 0} sage: D.is_cohen_macaulay() True

sage.homology.examples.
K3Surface
()¶ Returns a minimal triangulation of the K3 surface.
This is a pure simplicial complex of dimension 4 with 16 vertices and 288 facets. It was constructed by Casella and Kühnel in [CK2001]. The construction here uses the labeling from Spreer and Kühnel [SK2011].
EXAMPLES:
sage: K3=simplicial_complexes.K3Surface() ; K3 Minimal triangulation of the K3 surface sage: K3.f_vector() [1, 16, 120, 560, 720, 288]
This simplicial complex is implemented just by listing all 288 facets. The list of facets can be computed by the function
facets_for_K3()
, but running the function takes a few seconds.

sage.homology.examples.
KleinBottle
()¶ A minimal triangulation of the Klein bottle, as presented for example in Davide Cervone’s thesis [Cer1994].
EXAMPLES:
sage: simplicial_complexes.KleinBottle() Minimal triangulation of the Klein bottle

sage.homology.examples.
MatchingComplex
(n)¶ The matching complex of graphs on \(n\) vertices.
Fix an integer \(n>0\) and consider a set \(V\) of \(n\) vertices. A ‘partial matching’ on \(V\) is a graph formed by edges so that each vertex is in at most one edge. If \(G\) is a partial matching, then so is any graph obtained by deleting edges from \(G\). Thus the set of all partial matchings on \(n\) vertices, viewed as a set of subsets of the \(n\) choose 2 possible edges, is closed under taking subsets, and thus forms a simplicial complex called the ‘matching complex’. This function produces that simplicial complex.
INPUT:
n
– positive integer.
See Dumas et al. [DHSW2003] for information on computing its homology by computer, and see Wachs [Wac2003] for an expository article about the theory. For example, the homology of these complexes seems to have only mod 3 torsion, and this has been proved for the bottom nonvanishing homology group for the matching complex \(M_n\).
EXAMPLES:
sage: M = simplicial_complexes.MatchingComplex(7) sage: H = M.homology() sage: H {0: 0, 1: C3, 2: Z^20} sage: H[2].ngens() 20 sage: simplicial_complexes.MatchingComplex(8).homology(2) # long time (6s on sage.math, 2012) Z^132

sage.homology.examples.
MooreSpace
(q)¶ Triangulation of the mod \(q\) Moore space.
INPUT:
q
0 integer, at least 2
This is a simplicial complex with simplices of dimension 0, 1, and 2, such that its reduced homology is isomorphic to \(\ZZ/q\ZZ\) in dimension 1, zero otherwise.
If \(q=2\), this is the real projective plane. If \(q>2\), then construct it as follows: start with a triangle with vertices 1, 2, 3. We take a \(3q\)gon forming a \(q\)fold cover of the triangle, and we form the resulting complex as an identification space of the \(3q\)gon. To triangulate this identification space, put \(q\) vertices \(A_0\), …, \(A_{q1}\), in the interior, each of which is connected to 1, 2, 3 (two facets each: \([1, 2, A_i]\), \([2, 3, A_i]\)). Put \(q\) more vertices in the interior: \(B_0\), …, \(B_{q1}\), with facets \([3, 1, B_i]\), \([3, B_i, A_i]\), \([1, B_i, A_{i+1}]\), \([B_i, A_i, A_{i+1}]\). Then triangulate the interior polygon with vertices \(A_0\), \(A_1\), …, \(A_{q1}\).
EXAMPLES:
sage: simplicial_complexes.MooreSpace(2) Minimal triangulation of the real projective plane sage: simplicial_complexes.MooreSpace(3).homology()[1] C3 sage: simplicial_complexes.MooreSpace(4).suspension().homology()[2] C4 sage: simplicial_complexes.MooreSpace(8) Triangulation of the mod 8 Moore space

sage.homology.examples.
NotIConnectedGraphs
(n, i)¶ The simplicial complex of all graphs on \(n\) vertices which are not \(i\)connected.
Fix an integer \(n>0\) and consider the set of graphs on \(n\) vertices. View each graph as its set of edges, so it is a subset of a set of size \(n\) choose 2. A graph is \(i\)connected if, for any \(j<i\), if any \(j\) vertices are removed along with the edges emanating from them, then the graph remains connected. Now fix \(i\): it is clear that if \(G\) is not \(i\)connected, then the same is true for any graph obtained from \(G\) by deleting edges. Thus the set of all graphs which are not \(i\)connected, viewed as a set of subsets of the \(n\) choose 2 possible edges, is closed under taking subsets, and thus forms a simplicial complex. This function produces that simplicial complex.
INPUT:
n
,i
– nonnegative integers with \(i\) at most \(n\)
See Dumas et al. [DHSW2003] for information on computing its homology by computer, and see Babson et al. [BBLSW1999] for theory. For example, Babson et al. show that when \(i=2\), the reduced homology of this complex is nonzero only in dimension \(2n5\), where it is free abelian of rank \((n2)!\).
EXAMPLES:
sage: simplicial_complexes.NotIConnectedGraphs(5,2).f_vector() [1, 10, 45, 120, 210, 240, 140, 20] sage: simplicial_complexes.NotIConnectedGraphs(5,2).homology(5).ngens() 6

sage.homology.examples.
PoincareHomologyThreeSphere
()¶ A triangulation of the Poincaré homology 3sphere.
This is a manifold whose integral homology is identical to the ordinary 3sphere, but it is not simply connected. In particular, its fundamental group is the binary icosahedral group, which has order 120. The triangulation given here has 16 vertices and is due to Björner and Lutz [BL2000].
EXAMPLES:
sage: S3 = simplicial_complexes.Sphere(3) sage: Sigma3 = simplicial_complexes.PoincareHomologyThreeSphere() sage: S3.homology() == Sigma3.homology() True sage: Sigma3.fundamental_group().cardinality() # long time 120

sage.homology.examples.
ProjectivePlane
()¶ A minimal triangulation of the real projective plane.
EXAMPLES:
sage: P = simplicial_complexes.RealProjectivePlane() sage: Q = simplicial_complexes.ProjectivePlane() sage: P == Q True sage: P.cohomology(1) 0 sage: P.cohomology(2) C2 sage: P.cohomology(1, base_ring=GF(2)) Vector space of dimension 1 over Finite Field of size 2 sage: P.cohomology(2, base_ring=GF(2)) Vector space of dimension 1 over Finite Field of size 2

sage.homology.examples.
PseudoQuaternionicProjectivePlane
()¶ Returns a pure simplicial complex of dimension 8 with 490 facets.
Warning
This is expected to be a triangulation of the projective plane \(HP^2\) over the ring of quaternions, but this has not been proved yet.
This simplicial complex has the same homology as \(HP^2\). Its automorphism group is isomorphic to the alternating group \(A_5\) and acts transitively on vertices.
This is defined here using the description in [BK1992]. This article deals with three different triangulations. This procedure returns the only one which has a transitive group of automorphisms.
EXAMPLES:
sage: HP2 = simplicial_complexes.PseudoQuaternionicProjectivePlane() ; HP2 Simplicial complex with 15 vertices and 490 facets sage: HP2.f_vector() [1, 15, 105, 455, 1365, 3003, 4515, 4230, 2205, 490]
Checking its automorphism group:
sage: HP2.automorphism_group().is_isomorphic(AlternatingGroup(5)) True

sage.homology.examples.
RandomComplex
(n, d, p=0.5)¶ A random
d
dimensional simplicial complex onn
vertices.INPUT:
n
– number of verticesd
– dimension of the complexp
– floating point number between 0 and 1 (optional, default 0.5)
A random \(d\)dimensional simplicial complex on \(n\) vertices, as defined for example by Meshulam and Wallach [MW2009], is constructed as follows: take \(n\) vertices and include all of the simplices of dimension strictly less than \(d\), and then for each possible simplex of dimension \(d\), include it with probability \(p\).
EXAMPLES:
sage: X = simplicial_complexes.RandomComplex(6, 2); X Random 2dimensional simplicial complex on 6 vertices sage: len(list(X.vertices())) 6
If \(d\) is too large (if \(d+1 > n\), so that there are no \(d\)dimensional simplices), then return the simplicial complex with a single \((n+1)\)dimensional simplex:
sage: simplicial_complexes.RandomComplex(6, 12) The 5simplex

sage.homology.examples.
RandomTwoSphere
(n)¶ Return a random triangulation of the 2dimensional sphere with \(n\) vertices.
INPUT:
\(n\) – an integer
OUTPUT:
A random triangulation of the sphere chosen uniformly among the rooted triangulations on \(n\) vertices. Because some triangulations have nontrivial automorphism groups, this may not be equal to the uniform distribution among unrooted triangulations.
ALGORITHM:
The algorithm is taken from [PS2006], section 2.1.
Starting from a planar tree (represented by its contour as a sequence of vertices), one first performs local closures, until no one is possible. A local closure amounts to replace in the cyclic contour word a sequence
in1,in2,in3,lf,in3
byin1,in3
. After all local closures are done, one has reached the partial closure, as in [PS2006], figure 5 (a).Then one has to perform complete closure by adding two more vertices, in order to reach the situation of [PS2006], figure 5 (b). For this, it is necessary to find inside the final contour one of the two subsequences
lf,in,lf
.At every step of the algorithm, newly created triangles are added in a simplicial complex.
This algorithm is implemented in
RandomTriangulation()
, which creates an embedded graph. The triangles of the simplicial complex are recovered from this embedded graph.EXAMPLES:
sage: G = simplicial_complexes.RandomTwoSphere(6); G Simplicial complex with vertex set (0, 1, 2, 3, 4, 5) and 8 facets sage: G.homology() {0: 0, 1: 0, 2: Z} sage: G.is_pure() True sage: fg = G.flip_graph(); fg Graph on 8 vertices sage: fg.is_planar() and fg.is_regular(3) True

sage.homology.examples.
RealProjectivePlane
()¶ A minimal triangulation of the real projective plane.
EXAMPLES:
sage: P = simplicial_complexes.RealProjectivePlane() sage: Q = simplicial_complexes.ProjectivePlane() sage: P == Q True sage: P.cohomology(1) 0 sage: P.cohomology(2) C2 sage: P.cohomology(1, base_ring=GF(2)) Vector space of dimension 1 over Finite Field of size 2 sage: P.cohomology(2, base_ring=GF(2)) Vector space of dimension 1 over Finite Field of size 2

sage.homology.examples.
RealProjectiveSpace
(n)¶ A triangulation of \(\Bold{R}P^n\) for any \(n \geq 0\).
INPUT:
n
– integer, the dimension of the real projective space to construct
The first few cases are pretty trivial:
 \(\Bold{R}P^0\) is a point.
 \(\Bold{R}P^1\) is a circle, triangulated as the boundary of a single 2simplex.
 \(\Bold{R}P^2\) is the real projective plane, here given its minimal triangulation with 6 vertices, 15 edges, and 10 triangles.
 \(\Bold{R}P^3\): any triangulation has at least 11 vertices by a result of Walkup [Wal1970]; this function returns a triangulation with 11 vertices, as given by Lutz [Lut2005].
 \(\Bold{R}P^4\): any triangulation has at least 16 vertices by a result of Walkup; this function returns a triangulation with 16 vertices as given by Lutz; see also Datta [Dat2007], Example 3.12.
 \(\Bold{R}P^n\): Lutz has found a triangulation of \(\Bold{R}P^5\) with 24 vertices, but it does not seem to have been published. Kühnel [Kuh1987] has described a triangulation of \(\Bold{R}P^n\), in general, with \(2^{n+1}1\) vertices; see also Datta, Example 3.21. This triangulation is presumably not minimal, but it seems to be the best in the published literature as of this writing. So this function returns it when \(n > 4\).
ALGORITHM: For \(n < 4\), these are constructed explicitly by listing the facets. For \(n = 4\), this is constructed by specifying 16 vertices, two facets, and a certain subgroup \(G\) of the symmetric group \(S_{16}\). Then the set of all facets is the \(G\)orbit of the two given facets. This is implemented here by explicitly listing all of the facets; the facets can be computed by the function
facets_for_RP4()
, but running the function takes a few seconds.For \(n > 4\), the construction is as follows: let \(S\) denote the simplicial complex structure on the \(n\)sphere given by the first barycentric subdivision of the boundary of an \((n+1)\)simplex. This has a simplicial antipodal action: if \(V\) denotes the vertices in the boundary of the simplex, then the vertices in its barycentric subdivision \(S\) correspond to nonempty proper subsets \(U\) of \(V\), and the antipodal action sends any subset \(U\) to its complement. One can show that modding out by this action results in a triangulation for \(\Bold{R}P^n\). To find the facets in this triangulation, find the facets in \(S\). These are identified in pairs to form \(\Bold{R}P^n\), so choose a representative from each pair: for each facet in \(S\), replace any vertex in \(S\) containing 0 with its complement.
Of course these complexes increase in size pretty quickly as \(n\) increases.
EXAMPLES:
sage: P3 = simplicial_complexes.RealProjectiveSpace(3) sage: P3.f_vector() [1, 11, 51, 80, 40] sage: P3.homology() {0: 0, 1: C2, 2: 0, 3: Z} sage: P4 = simplicial_complexes.RealProjectiveSpace(4) sage: P4.f_vector() [1, 16, 120, 330, 375, 150] sage: P4.homology() # long time {0: 0, 1: C2, 2: 0, 3: C2, 4: 0} sage: P5 = simplicial_complexes.RealProjectiveSpace(5) # long time (44s on sage.math, 2012) sage: P5.f_vector() # long time [1, 63, 903, 4200, 8400, 7560, 2520]
The following computation can take a long time – over half an hour – with Sage’s default computation of homology groups, but if you have CHomP installed, Sage will use that and the computation should only take a second or two. (You can download CHomP from http://chomp.rutgers.edu/, or you can install it as a Sage package using
sage i chomp
).sage: P5.homology() # long time # optional  CHomP {0: 0, 1: C2, 2: 0, 3: C2, 4: 0, 5: Z} sage: simplicial_complexes.RealProjectiveSpace(2).dimension() 2 sage: P3.dimension() 3 sage: P4.dimension() # long time 4 sage: P5.dimension() # long time 5

sage.homology.examples.
RudinBall
()¶ Return the nonshellable ball constructed by Rudin.
This complex is a nonshellable triangulation of the 3ball with 14 vertices and 41 facets, constructed by Rudin in [Rud1958].
EXAMPLES:
sage: R = simplicial_complexes.RudinBall(); R Rudin ball sage: R.f_vector() [1, 14, 66, 94, 41] sage: R.homology() {0: 0, 1: 0, 2: 0, 3: 0} sage: R.is_cohen_macaulay() True

sage.homology.examples.
ShiftedComplex
(generators)¶ Return the smallest shifted simplicial complex containing
generators
as faces.Let \(V\) be a set of vertices equipped with a total order. The ‘componentwise partial ordering’ on ksubsets of \(V\) is defined as follows: if \(A = \{a_1 < \cdots < a_k\}\) and \(B = \{b_1 < \cdots < b_k\}\), then \(A \leq_C B\) iff \(a_i \leq b_i\) for all \(i\). A simplicial complex \(X\) on vertex set \([n]\) is shifted if its faces form an order ideal under the componentwise partial ordering, i.e., if \(B \in X\) and \(A \leq_C B\) then \(A \in X\). Shifted complexes of dimension 1 are also known as threshold graphs.
Note
This method assumes that \(V\) consists of positive integers with the natural ordering.
INPUT:
generators
– a list of generators of the order ideal, which may be lists, tuples or simplices
EXAMPLES:
sage: X = simplicial_complexes.ShiftedComplex([ Simplex([1,6]), (2,4), [8] ]) sage: sorted(X.facets()) [(1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (2, 3), (2, 4), (7,), (8,)] sage: X = simplicial_complexes.ShiftedComplex([ [2,3,5] ]) sage: sorted(X.facets()) [(1, 2, 3), (1, 2, 4), (1, 2, 5), (1, 3, 4), (1, 3, 5), (2, 3, 4), (2, 3, 5)] sage: X = simplicial_complexes.ShiftedComplex([ [1,3,5], [2,6] ]) sage: sorted(X.facets()) [(1, 2, 3), (1, 2, 4), (1, 2, 5), (1, 3, 4), (1, 3, 5), (1, 6), (2, 6)]

sage.homology.examples.
Simplex
(n)¶ An \(n\)dimensional simplex, as a simplicial complex.
INPUT:
n
– a nonnegative integer
OUTPUT: the simplicial complex consisting of the \(n\)simplex on vertices \((0, 1, ..., n)\) and all of its faces.
EXAMPLES:
sage: simplicial_complexes.Simplex(3) The 3simplex sage: simplicial_complexes.Simplex(5).euler_characteristic() 1

sage.homology.examples.
Sphere
(n)¶ A minimal triangulation of the \(n\)dimensional sphere.
INPUT:
n
– positive integer
EXAMPLES:
sage: simplicial_complexes.Sphere(2) Minimal triangulation of the 2sphere sage: simplicial_complexes.Sphere(5).homology() {0: 0, 1: 0, 2: 0, 3: 0, 4: 0, 5: Z} sage: [simplicial_complexes.Sphere(n).euler_characteristic() for n in range(6)] [2, 0, 2, 0, 2, 0] sage: [simplicial_complexes.Sphere(n).f_vector() for n in range(6)] [[1, 2], [1, 3, 3], [1, 4, 6, 4], [1, 5, 10, 10, 5], [1, 6, 15, 20, 15, 6], [1, 7, 21, 35, 35, 21, 7]]

sage.homology.examples.
SumComplex
(n, A)¶ The sum complexes of Linial, Meshulam, and Rosenthal [LMR2010].
If \(k+1\) is the cardinality of \(A\), then this returns a \(k\)dimensional simplicial complex \(X_A\) with vertices \(\ZZ/(n)\), and facets given by all \(k+1\)tuples \((x_0, x_1, ..., x_k)\) such that the sum \(\sum x_i\) is in \(A\). See the paper by Linial, Meshulam, and Rosenthal [LMR2010], in which they prove various results about these complexes; for example, if \(n\) is prime, then \(X_A\) is rationally acyclic, and if in addition \(A\) forms an arithmetic progression in \(\ZZ/(n)\), then \(X_A\) is \(\ZZ\)acyclic. Throughout their paper, they assume that \(n\) and \(k\) are relatively prime, but the construction makes sense in general.
In addition to the results from the cited paper, these complexes can have large torsion, given the number of vertices; for example, if \(n=10\), and \(A=\{0,1,2,3,6\}\), then \(H_3(X_A)\) is cyclic of order 2728, and there is a 4dimensional complex on 13 vertices with \(H_3\) having a cyclic summand of order
\[706565607945 = 3 \cdot 5 \cdot 53 \cdot 79 \cdot 131 \cdot 157 \cdot 547.\]See the examples.
INPUT:
n
– a positive integerA
– a subset of \(\ZZ/(n)\)
EXAMPLES:
sage: S = simplicial_complexes.SumComplex(10, [0,1,2,3,6]); S Sum complex on vertices Z/10Z associated to {0, 1, 2, 3, 6} sage: S.homology() {0: 0, 1: 0, 2: 0, 3: C2728, 4: 0} sage: factor(2728) 2^3 * 11 * 31 sage: S = simplicial_complexes.SumComplex(11, [0, 1, 3]); S Sum complex on vertices Z/11Z associated to {0, 1, 3} sage: S.homology(1) C23 sage: S = simplicial_complexes.SumComplex(11, [0,1,2,3,4,7]); S Sum complex on vertices Z/11Z associated to {0, 1, 2, 3, 4, 7} sage: S.homology(algorithm='no_chomp') # long time {0: 0, 1: 0, 2: 0, 3: 0, 4: C645679, 5: 0} sage: factor(645679) 23 * 67 * 419 sage: S = simplicial_complexes.SumComplex(13, [0, 1, 3]); S Sum complex on vertices Z/13Z associated to {0, 1, 3} sage: S.homology(1) C159 sage: factor(159) 3 * 53 sage: S = simplicial_complexes.SumComplex(13, [0,1,2,5]); S Sum complex on vertices Z/13Z associated to {0, 1, 2, 5} sage: S.homology(algorithm='no_chomp') # long time {0: 0, 1: 0, 2: C146989209, 3: 0} sage: factor(1648910295) 3^2 * 5 * 53 * 521 * 1327 sage: S = simplicial_complexes.SumComplex(13, [0,1,2,3,5]); S Sum complex on vertices Z/13Z associated to {0, 1, 2, 3, 5} sage: S.homology(algorithm='no_chomp') # long time {0: 0, 1: 0, 2: 0, 3: C3 x C237 x C706565607945, 4: 0} sage: factor(706565607945) 3 * 5 * 53 * 79 * 131 * 157 * 547 sage: S = simplicial_complexes.SumComplex(17, [0, 1, 4]); S Sum complex on vertices Z/17Z associated to {0, 1, 4} sage: S.homology(1, algorithm='no_chomp') C140183 sage: factor(140183) 103 * 1361 sage: S = simplicial_complexes.SumComplex(19, [0, 1, 4]); S Sum complex on vertices Z/19Z associated to {0, 1, 4} sage: S.homology(1,algorithm='no_chomp') C5670599 sage: factor(5670599) 11 * 191 * 2699 sage: S = simplicial_complexes.SumComplex(31, [0, 1, 4]); S Sum complex on vertices Z/31Z associated to {0, 1, 4} sage: S.homology(1,algorithm='no_chomp') # long time C5 x C5 x C5 x C5 x C26951480558170926865 sage: factor(26951480558170926865) 5 * 311 * 683 * 1117 * 11657 * 1948909

sage.homology.examples.
SurfaceOfGenus
(g, orientable=True)¶ A surface of genus \(g\).
INPUT:
g
– a nonnegative integer. The desired genusorientable
– boolean (optional, defaultTrue
). IfTrue
, return an orientable surface, and ifFalse
, return a nonorientable surface.
In the orientable case, return a sphere if \(g\) is zero, and otherwise return a \(g\)fold connected sum of a torus with itself.
In the nonorientable case, raise an error if \(g\) is zero. If \(g\) is positive, return a \(g\)fold connected sum of a real projective plane with itself.
EXAMPLES:
sage: simplicial_complexes.SurfaceOfGenus(2) Triangulation of an orientable surface of genus 2 sage: simplicial_complexes.SurfaceOfGenus(1, orientable=False) Triangulation of a nonorientable surface of genus 1

sage.homology.examples.
Torus
()¶ A minimal triangulation of the torus.
This is a simplicial complex with 7 vertices, 21 edges and 14 faces. It is the unique triangulation of the torus with 7 vertices, and has been found by Möbius in 1861.
This is also the combinatorial structure of the Császár polyhedron (see Wikipedia article Császár_polyhedron).
EXAMPLES:
sage: T = simplicial_complexes.Torus(); T.homology(1) Z x Z sage: T.f_vector() [1, 7, 21, 14]
REFERENCES:

class
sage.homology.examples.
UniqueSimplicialComplex
(maximal_faces=None, name=None, **kwds)¶ Bases:
sage.homology.simplicial_complex.SimplicialComplex
,sage.structure.unique_representation.UniqueRepresentation
This combines
SimplicialComplex
andUniqueRepresentation
. It is intended to be used to make standard examples of simplicial complexes unique. See trac ticket #13566.INPUT:
 the inputs are the same as for a
SimplicialComplex
, with one addition and two exceptions. The exceptions are thatis_mutable
andis_immutable
are ignored: all instances of this class are immutable. The addition: name
– string (optional), the string representation for this complex.
EXAMPLES:
sage: from sage.homology.examples import UniqueSimplicialComplex sage: SimplicialComplex([[0,1]]) is SimplicialComplex([[0,1]]) False sage: UniqueSimplicialComplex([[0,1]]) is UniqueSimplicialComplex([[0,1]]) True sage: UniqueSimplicialComplex([[0,1]]) Simplicial complex with vertex set (0, 1) and facets {(0, 1)} sage: UniqueSimplicialComplex([[0,1]], name='The 1simplex') The 1simplex
 the inputs are the same as for a

sage.homology.examples.
ZieglerBall
()¶ Return the nonshellable ball constructed by Ziegler.
This complex is a nonshellable triangulation of the 3ball with 10 vertices and 21 facets, constructed by Ziegler in [Zie1998] and the smallest such complex known.
EXAMPLES:
sage: Z = simplicial_complexes.ZieglerBall(); Z Ziegler ball sage: Z.f_vector() [1, 10, 38, 50, 21] sage: Z.homology() {0: 0, 1: 0, 2: 0, 3: 0} sage: Z.is_cohen_macaulay() True

sage.homology.examples.
facets_for_K3
()¶ Returns the facets for a minimal triangulation of the K3 surface.
This is a pure simplicial complex of dimension 4 with 16 vertices and 288 facets. The facets are obtained by constructing a few facets and a permutation group \(G\), and then computing the \(G\)orbit of those facets.
See Casella and Kühnel in [CK2001] and Spreer and Kühnel [SK2011]; the construction here uses the labeling from Spreer and Kühnel.
EXAMPLES:
sage: from sage.homology.examples import facets_for_K3 sage: A = facets_for_K3() # long time (a few seconds) sage: SimplicialComplex(A) == simplicial_complexes.K3Surface() # long time True

sage.homology.examples.
facets_for_RP4
()¶ Return the list of facets for a minimal triangulation of 4dimensional real projective space.
We use vertices numbered 1 through 16, define two facets, and define a certain subgroup \(G\) of the symmetric group \(S_{16}\). Then the set of all facets is the \(G\)orbit of the two given facets.
See the description in Example 3.12 in Datta [Dat2007].
EXAMPLES:
sage: from sage.homology.examples import facets_for_RP4 sage: A = facets_for_RP4() # long time (1 or 2 seconds) sage: SimplicialComplex(A) == simplicial_complexes.RealProjectiveSpace(4) # long time True

sage.homology.examples.
matching
(A, B)¶ List of maximal matchings between the sets
A
andB
.A matching is a set of pairs \((a,b) \in A \times B\) where each \(a\) and \(b\) appears in at most one pair. A maximal matching is one which is maximal with respect to inclusion of subsets of \(A \times B\).
INPUT:
A
,B
– list, tuple, or indeed anything which can be converted to a set.
EXAMPLES:
sage: from sage.homology.examples import matching sage: matching([1,2], [3,4]) [{(1, 3), (2, 4)}, {(1, 4), (2, 3)}] sage: matching([0,2], [0]) [{(0, 0)}, {(2, 0)}]