Triangulations of the Sphere
Abstract: Thurston gave a simple way to construct all triangulations of the sphere for which 5 or 6 triangles meet at each vertex, using the Eisenstein integers $\mathbb{E}$. While such triangulations can be defined purely combinatorially, Thurston noticed that given such a triangulation, one can make all the triangles into flat equilateral triangles with the same edge length, and this gives the 2-sphere a flat Riemannian metric except at 12 cone points with angle deficit $π/3$. He showed that up to rescaling, all such Riemannian metrics arise from his procedure. He studied the moduli space $\mathcal{M}$ of all such metrics modulo rescaling, and showed that $\mathcal{M}$ is open and dense in an orbifold $\overline{\mathcal{M}} = \mathbb{PC}{10}_+/Γ,$ where $\mathbb{C}{10}_+ = { v \in \mathbb{C}{10} \vert \; Q(v) > 0}$ for some quadratic form $Q$ on $\mathbb{C}{10}$, $\mathbb{PC}{10}_+$ is its projectivization, and $Γ$ is a certain discrete group of linear transformations of $\mathbb{C}{10}$ preserving both $Q$ and the lattice $\mathbb{E}{10} \subset \mathbb{C}{10}$. He also showed that $\overline{\mathcal{M}}$ is the moduli space of flat Riemannian metrics on the sphere with at most $12$ cone points and angle deficits that are nonnegative multiples of $π/3$. Here we briefly outline the basic ideas behind this work, and illustrate them with examples.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Explain it Like I'm 14
Plain-English Guide to “Triangulations of the Sphere”
What is this paper about?
This paper explains a beautiful way to build and study shapes made of small equilateral triangles that wrap around like the surface of a sphere (think of a ball). It shows how to create these shapes from a special star-shaped cut-out, how this relates to famous polyhedra like the icosahedron, and how surprisingly deep math (including 10-dimensional geometry!) helps organize all these shapes.
1) Big Picture: The main topic and purpose
The paper explores:
- How to make “triangulations of the sphere,” meaning ways to cover a sphere with small triangles that fit together without gaps or overlaps.
- A special class where at each corner (vertex), exactly 5 or 6 triangles meet.
- A method, invented by William Thurston, to build all such triangulations from a star-shaped piece of paper cut from a triangular grid.
- How these constructions connect to a neat mathematical “space of shapes,” where each point represents one of these triangle-covered spheres.
2) Simple goals and questions
In everyday terms, the paper asks:
- How can we build sphere-like surfaces out of flat, equal-sized equilateral triangles?
- What kinds of “corners” can appear on such a sphere? (Do 5 triangles meet there, or 6?)
- Can we get every possible triangle pattern on a sphere of this type from one simple construction?
- How can we label or “encode” each pattern with numbers so we can study them all at once?
- What does the full collection (the “moduli space”) of these triangle-covered spheres look like?
3) How the construction works (methods, with simple analogies)
Here are the key ideas, explained with everyday pictures:
- Start with a triangular grid: Imagine an endless sheet of regular, tiny equilateral triangles. Mathematicians call the special grid points “Eisenstein integers,” but you can think of them just as the corners of the triangular graph paper.
- Draw an 11-sided polygon on that grid: Pick a nice 11-sided shape whose corners sit on grid points.
- Add inward-pointing equilateral triangles along each edge: Along every edge of your polygon, draw a small equilateral triangle pointing into the polygon. Make sure these small “spikes” touch only at their tips.
- Cut out the star: If you remove those small triangles, what remains is a spiky, 11-pointed star.
- Fold it up: Surprisingly, you can fold this star so that all the spikes meet at a single point, making a convex polyhedron (a 3D shape with flat faces). Its surface is tiled by the tiny equilateral triangles from the grid. This surface is topologically a sphere.
- What happens at the corners?
- Where 6 triangles meet, the surface is flat (no bending).
- Where 5 triangles meet, the surface has a little “missing angle,” like making a paper cone by cutting out a slice and taping the edges together. That missing slice is called an angle deficit.
A few helpful definitions:
- Triangulation: Covering a surface with triangles that fit perfectly.
- Cone point: A point on the surface that’s like the tip of a cone because a “slice of angle” is missing.
- Angle deficit: How big that missing slice is. For equilateral triangles, each corner angle is 60°. If only 5 triangles meet around a point, the full circle (360°) is short by 60°.
- A counting fact (discrete Gauss–Bonnet): On a sphere built this way, the total missing angle must add up to 720°. Since each cone point contributes 60°, there must be exactly 12 cone points where 5 triangles meet.
- The famous example: The regular icosahedron has exactly 12 such points (its 12 vertices), with 5 triangles meeting at each one.
- Encoding the shape with numbers:
- Walk around the edges of your 11-sided polygon and record the step you take each time as an arrow on the grid. The 11 arrows add up to zero (you returned to the start).
- This information can be packed into 10 complex numbers (think: 10 coordinates), which act like a “barcode” for your shape.
- There’s a special formula (a quadratic form) that takes these 10 numbers and tells you how many small triangles are on your sphere. Roughly, it’s like “add a square, subtract some squares,” similar in spirit to formulas used in physics.
- A space of all shapes:
- If you don’t care about overall size (big or small), only about shape, you “rescale” to ignore size. Mathematicians handle this by looking at lines through the origin in that 10-dimensional setup (this is called projectivization).
- The collection of all such shapes forms a 9-dimensional “space of shapes.” Most points in this space come from triangulations with exactly 12 separate cone points. Points on the “boundary” correspond to situations where cone points have collided (for example, where 4 or 3 triangles meet at a vertex).
4) Main findings and why they matter
- Every sphere triangulation with only 5 or 6 triangles at each vertex comes from the star construction. This is a powerful “if and only if” result: the method produces all such patterns, not just a few examples.
- There are always exactly 12 cone points with 60° angle deficit. This neat, fixed number is a deep fact about how flat pieces can wrap around a sphere.
- The icosahedron fits perfectly into this story. It’s the flagship example: 5 triangles meet at each of its 12 vertices.
- Each triangulation can be encoded by 10 complex numbers that satisfy a specific formula. From this encoding:
- A quadratic formula computes the number of small triangles.
- The underlying math looks like a 10D version of a “one-time, nine-space” setup (familiar in physics), which hints at surprising connections.
- The moduli space picture:
- The set of all such flat-sphere-with-cone-points shapes forms a nicely behaved space (a complex 9-dimensional manifold) when the 12 cone points are distinct.
- When cone points collide, you land on a larger, slightly singular “orbifold” space. Every point there can be realized as some convex polyhedron, uniquely determined up to congruence (same shape and size after rigid motions).
- Counting actual triangulations:
- The triangulations themselves correspond to certain “lattice points” (grid-like points) in the 10-dimensional setup, up to symmetries.
- The number of triangles in the tiling equals the value of the quadratic formula at that point.
Why this matters:
- It gives a complete, constructive way to understand a big family of sphere tilings.
- It links geometry you can draw and fold (stars and polyhedra) to high-dimensional algebra and elegant counting formulas.
- It organizes many shapes (like the icosahedron) into one unified picture.
5) What does this mean going forward? (Implications and impact)
- A bridge between hands-on geometry and advanced math: You can literally cut, fold, and build these shapes, yet their full story lives in a sophisticated 10-dimensional framework. This helps mathematicians classify and count such shapes and study how they change.
- A map of all possible shapes: By understanding the moduli space (the “space of shapes”), mathematicians can see which shapes are typical, which lie on boundaries, how shapes can “collide” or morph, and how to move around the space.
- Connections to physics and other fields: The appearance of a “one minus nine” signature (like time vs. space) is a curious echo of ideas in physics, hinting that similar mathematical structures appear in different sciences.
- Clear examples and tests: Famous polyhedra (icosahedron, octahedron, tetrahedron) serve as checkpoints. The icosahedron sits inside the main space; the octahedron and tetrahedron show up on the boundary where cone points merge.
In short, the paper shows how a playful folding trick leads to a deep, precise way to understand and classify triangle tilings of the sphere—connecting artful geometry, number patterns on a triangular grid, and high-dimensional mathematics.
Knowledge Gaps
Knowledge gaps, limitations, and open questions
The paper leaves the following points unresolved:
- Explicit description of the group Γ: give generators/relations, decide arithmeticity, determine whether Γ is a lattice in PU(1,9), compute covolume, cusp structure, and whether Γ is reflective; find an explicit fundamental domain.
- Geometry of the ambient space: make precise the identification of the projectivized positive cone with complex hyperbolic 9–space (metric, curvature normalization), and clarify in what sense inherits a complex hyperbolic orbifold structure.
- Conceptual origin of the signature (1,9): provide a structural explanation for why the hermitian form on has signature (beyond “area is quadratic”), and whether the “10-dimensional Minkowski” analogy encodes deeper geometry (e.g., a period-domain or Hodge-theoretic reason).
- Relationship to Deligne–Mostow/Thurston hypergeometric monodromy: determine whether Γ is (commensurable with) a known Deligne–Mostow lattice; identify the precise hypergeometric data, if any, underlying these cone metrics.
- Compactness and metric completion: prove whether has finite complex hyperbolic volume; identify the metric completion of and whether it coincides with ; describe the nature of cusps and their cross-sections.
- Boundary stratification: classify and parameterize the strata of by collision patterns of the 12 cone points (partitions of 12), determine their dimensions, local orbifold structure, and adjacency relations.
- Holonomy classification: compute the possible holonomy subgroups for these flat cone metrics (generated by rotations of multiples of ), and characterize which holonomy types occur in versus on the boundary.
- Lattice-point counting/asymptotics: obtain precise asymptotics (and secondary terms) for the number of oriented convex triangulations with at most N triangles, i.e., the growth of |{[v] ∈ : Q(v) ≤ N}|, including constants in terms of complex hyperbolic volumes.
- Symmetry-weighted enumeration: count triangulations weighted by 1/|Aut(T)|; classify stabilizers in Γ, and determine the distribution of symmetry types among triangulations of a given size.
- Effectivity and algorithms: give a polynomial-time algorithm to:
- decide whether a given combinatorial triangulation (all degrees 5 or 6) is realizable (Thurston says “all,” but an explicit, checkable realization procedure is missing);
- reconstruct v ∈ (and P) from a triangulation;
- fold the star to the convex polyhedron and compute its 3D embedding (vertices/dihedral angles) from v.
- Admissible 11-gons P: provide necessary and sufficient combinatorial/metric conditions on Eisenstein 11-gons ensuring the inward equilateral “yellow” triangles meet only at corners; classify such polygons up to lattice symmetries.
- Face structure of the convex realization: characterize, from v or P, which small equilateral triangles coplanarly merge into faces of the convex polyhedron (i.e., when the realization is a deltahedron versus having larger polygonal faces).
- Isotropic cone and degenerations: interpret vectors with Q(v) = 0 and the behavior as Q(v) → 0; identify corresponding geometric degenerations (cusps) and their moduli.
- Alternative coordinates: develop intrinsic “period” or holonomy/developing-map coordinates on (beyond the Eisenstein 10-tuple), and relate them explicitly to v and to the hermitian form H.
- Generalizations:
- to other angle deficits and lattices (e.g., Gaussian integers for square tilings, other root lattices), including mixed tilings beyond Engel–Smillie’s cases;
- to other topologies (tori and higher genus surfaces) with prescribed cone deficits divisible by ;
- to non-convex or non-embedded realizations and their moduli.
- Uniqueness and orientation issues: clarify precisely how “oriented convex triangulations” are identified under Γ, how orientation reversal acts, and whether different 11-gons P can yield the same triangulation class.
- Quantitative geometry: obtain explicit formulae relating Q(v) to geometric invariants (area, diameter, systole) of the cone metric; study extremal problems (e.g., maximize/minimize number of triangles at fixed geometric constraints).
- Visualization and constructive recipes: provide a general, verifiable construction (beyond the icosahedral example) to draw P for any target triangulation or symmetry type, including robust numerical methods.
Practical Applications
Practical Applications of “Triangulations of the Sphere” (Baez, 2024)
The paper gives a constructive, parameterized description of all convex triangulations of the 2‑sphere in which only 5 or 6 equilateral triangles meet at a vertex, together with a moduli-space picture (complex 9‑dimensional) and a lattice/Hermitian-form encoding with signature (1,9). Below are concrete applications derived from these constructions, the moduli-space viewpoint, and Alexandrov’s uniqueness.
Immediate Applications
- Sphere remeshing and mesh design with controlled valence 5/6 nodes (Software/CG, CAD/CAE)
- What: Generate high‑quality triangulated sphere meshes with exactly twelve 5‑valent vertices and all others 6‑valent (icosahedral‑type meshes), directly from Eisenstein‑lattice stars or from lattice vectors v ∈ Λ10 with Q(v)>0.
- How (from paper): Thurston’s construction and the bijection (Λ10_+ ∩ Λ10)/Γ → oriented convex triangulations; Q(v) gives triangle count.
- Tools/products/workflows: Blender/Grasshopper/Rhino plugins to (i) choose an Eisenstein 11‑gon P or a lattice vector v, (ii) compute Q(v) and the triangulation, (iii) export to standard mesh formats.
- Assumptions/dependencies: Requires handling Γ‑equivalence to avoid duplicates; for physical folding the paper triangles may flex, but Alexandrov’s theorem guarantees an equivalent convex polyhedron with planar faces exists.
- Geodesic domes and panelization with 5/6‑valent hubs (Architecture/Construction)
- What: Design geodesic shells with predetermined locations of 5‑valent “defect” hubs (twelve required) and mostly 6‑valent hubs, using equilateral panelization.
- How: Use the Eisenstein‑lattice star method to place the twelve cone points; Alexandrov guarantees a unique convex realization (up to congruence).
- Tools/products/workflows: CAD scripts that map a chosen P or v to hub layout, panel geometry, cut lists, and BOM; compatibility check with stock triangle sizes.
- Assumptions/dependencies: Material thickness and jointing constraints; may require minor panel planarization or small tolerances.
- Kirigami for programmed curvature (Materials, Soft Robotics, Product Design)
- What: Cut patterns on hexagonal (Eisenstein) lattices to realize spherical or near‑spherical shells via twelve π/3 disclinations—fast path to dome‑like, deployable skins.
- How: The “star” removal encodes the twelve cone points (angle deficit π/3) mandated by discrete Gauss–Bonnet.
- Tools/products/workflows: Pattern generator that outputs laser‑/die‑cut layouts on films/foils; hinge/crease assignment; FEM validation for actuation.
- Assumptions/dependencies: Elasticity and thickness effects; required crease design for controlled folding; triangles may bend slightly in purely kirigami builds.
- Fullerene and viral capsid scaffolds (Chemistry, Biophysics)
- What: Systematic generation/parameterization of spherical networks dual to the triangulations—3‑valent polyhedra with twelve pentagons (defects) and otherwise hexagons (fullerene‑like), and icosahedral capsid lattices (Caspar–Klug T numbers).
- How: Dual of a 5/6‑valent equilateral triangulation yields the canonical “12 pentagons + hexagons” rule; Q(v) serves as a size proxy (triangle count).
- Tools/products/workflows: Enumeration software mod Γ to build candidate fullerene/capsid nets; filtering by symmetry/strain before DFT/MD screening.
- Assumptions/dependencies: Chemical/biophysical feasibility depends on energetics and symmetry; not every combinatorial net corresponds to a low‑energy structure.
- Spherical CNN sampling grids and geospatial discretizations (AI/ML, Geospatial)
- What: Alternative to standard icosahedral/HEALPix grids: place the twelve 5‑valent singularities where distortion is acceptable (e.g., over oceans), with mostly uniform 6‑valent sampling elsewhere.
- How: Pick v (or P) to control cone‑point placement; use the induced triangulation for convolution/pooling on the sphere.
- Tools/products/workflows: Mesh generator + discrete differential operators (Laplace–Beltrami, gradient) on these triangulations; integration with PyTorch/TF.
- Assumptions/dependencies: Need numerically stable operators on irregular 5‑valent nodes; reproducible node ordering/orientation.
- Texture mapping and cartography with cone singularities (Computer Graphics, GIS)
- What: UV parametrizations of the sphere concentrating distortion at twelve controlled locations (cone points), improving texture quality elsewhere.
- How: Use the flat‑with‑cone metric from the triangulation; place cone points away from salient texture regions.
- Tools/products/workflows: UV tools that import P or v and compute a cone‑metric map; exporters to DCC applications.
- Assumptions/dependencies: Requires robust cone‑metric solvers; careful seam placement.
- Inverse reconstruction from metric data (Computational Geometry, Metrology)
- What: Reconstruct convex polyhedra from measured flat‑with‑cone metrics (edge lengths/deficits), for QC/inspection or shape recovery from geodesic data.
- How: Alexandrov’s uniqueness ensures a unique convex realization; practical algorithms (e.g., Alexandrov/Bobenko–Izmestiev solvers) can be applied.
- Tools/products/workflows: Pipeline from distance scans → metric fitting → convex realization → comparison to CAD nominal.
- Assumptions/dependencies: Needs accurate metric extraction; sensitivity to noise and incomplete coverage.
- Teaching kits and outreach (Education/Outreach, Maker)
- What: Hands‑on kits showing discrete Gauss–Bonnet, cone angles, and constructions of icosahedra and related triangulations by folding stars.
- How: Directly from the star construction over the Eisenstein lattice.
- Tools/products/workflows: Printable templates, interactive web apps (choose P, preview fold), classroom activities.
- Assumptions/dependencies: None beyond classroom resources.
Long‑Term Applications
- Design optimization in complex‑hyperbolic moduli space (Software/Optimization)
- What: Treat M ≃ P10_+/Γ as a design space for spherical triangulations; do geodesic exploration/optimization (e.g., minimize panel variation, stress).
- How: The Hermitian form H of signature (1,9) defines the positive cone; projectivization gives a complex‑hyperbolic structure for principled navigation.
- Tools/products/workflows: Optimizers working on quotient spaces; Γ‑aware sampling; surrogate models for structural metrics.
- Assumptions/dependencies: Requires robust charts, Γ‑reduction, and numerics on singular orbifolds; tooling not off‑the‑shelf.
- Adaptive spherical grids for climate/Earth‑system models (Energy/Climate, Policy)
- What: Tailor 5‑valent node locations to reduce numerical artifacts or concentrate resolution in regions of interest, generalizing icosahedral grids.
- How: Use the family of triangulations in M and its boundary (coalesced cone points) to engineer grid anisotropy/topology consciously.
- Tools/products/workflows: Grid generators outputting MPAS/DYNAMICO‑compatible meshes; PDE operators respecting local valence changes.
- Assumptions/dependencies: Stability/accuracy analysis for dynamical cores on nonstandard triangulations; community validation/standards.
- Deployable spherical mechanisms and space structures (Aerospace, Robotics)
- What: Flat‑packed skins that deploy into near‑spherical shells with prescribed nodes (e.g., antennas, sensor shields), guided by the star construction.
- How: The twelve π/3 disclinations encode necessary curvature; hinge/strut designs realize the Alexandrov polyhedron.
- Tools/products/workflows: Mech design kits mapping (P or v) → hinge layout → deployment simulation → qualification tests.
- Assumptions/dependencies: Rigid‑foldability is not guaranteed; requires bespoke hinge kinematics and thickness compensation.
- Programmable self‑assembly of curved shells (Nanotech, Biomedicine)
- What: Use patchy particles or DNA/protein tiles that tile as equilateral triangles with twelve disclinations to assemble closed shells of target size Q(v).
- How: Leverage the universal “twelve-cone” rule; choose v to target size and defect placement; enforce local rules for valence 5/6.
- Tools/products/workflows: Inverse design (v → interaction rules), kinetic simulations, experimental synthesis.
- Assumptions/dependencies: Significant chemical control and error correction needed; thermodynamic/kinetic constraints.
- Codes/crypto and lattices over Eisenstein integers (Software/Security)
- What: Explore Γ‑invariant structures in Λ10 with Hermitian form (1,9) for constructing structured error‑correcting codes or lattice‑based crypto primitives.
- How: The Eisenstein lattice and unitary group symmetries may yield algebraic structure beneficial for coding.
- Tools/products/workflows: Prototype code families; performance/security analyses.
- Assumptions/dependencies: Highly exploratory; no direct security/performance guarantees from the geometry alone.
- Manufacturing standards for triangulated shells (Policy/Standards, AEC/CAD)
- What: Interchange formats and specifications that encode triangulations by (Q(v), Γ‑class) for interoperable CAD/CAM, procurement, and QC.
- How: The lattice/Hermitian encoding provides canonical identifiers; Alexandrov uniqueness anchors geometry definitions.
- Tools/products/workflows: Schema extensions for IFC/STEP; certification protocols for hub valence and panel geometry.
- Assumptions/dependencies: Industry consortium buy‑in; mapping to existing standards.
- SLAM/inspection on curved interiors via metric inversion (Robotics, NDT)
- What: Robots infer shell geometry from on‑surface path/angle measurements and reconstruct via Alexandrov‑type solvers.
- How: Treat measured surface as a flat‑with‑cone metric on S2; invert to a convex polyhedron.
- Tools/products/workflows: Sensor fusion → metric fitting → convex realization → defect detection.
- Assumptions/dependencies: Requires reliable geodesic/angle sensing and robust solvers in noisy settings.
- Theoretical physics crossovers (HET/Quantum Gravity)
- What: Use the (1,9) Hermitian structure and complex‑hyperbolic orbifolds as toy models for discrete geometry moduli (e.g., Regge calculus on S2).
- How: The positive cone/projectivization structure parallels indefinite signatures familiar in physics.
- Tools/products/workflows: Analytical studies; numerical experiments on discrete curvature flows in M.
- Assumptions/dependencies: Speculative; requires substantial theoretical development to impact physics.
Notes on feasibility across items:
- All constructions presume triangulations with only 5/6 valence; other valences correspond to boundary points of the compactification (cone collisions).
- Convex realization is mathematically guaranteed (Alexandrov), but engineering realizations must handle material thickness and joint design.
- The group Γ and the lattice Λ10 are key to avoiding duplicates and to effective enumeration; practical software must implement Γ‑actions.
- Where symmetry (e.g., icosahedral) is desired (capsids, domes), additional constraints must be imposed on P or v beyond positivity of Q(v).
Glossary
- Alexandrov's uniqueness theorem: A result stating that a convex polyhedron with a given intrinsic metric of nonnegative curvature is unique up to congruence. "By Alexandrov's uniqueness theorem \cite{Alexandrov}, any element of \overline{} can be realized as a convex polyhedron, unique up to congruence."
- angle deficit: The amount by which the total angle around a point in a surface falls short of 2π; for k equilateral triangles meeting, the deficit is (6−k)π/3. "These points are called
cone points', and we say they have anangle deficit' of ." - complex dimension: The dimension of a complex vector space or complex manifold counted over the complex numbers (half the corresponding real dimension). "Since has complex dimension $10$, its projectivization has complex dimension $9$, and so does \mathbb{C}^n is a complex manifold, but is a more singular space, called an `orbifold'."
- cone point: A singular point in a flat surface where the total angle is less than 2π, locally resembling a Euclidean cone. "These points are called `cone points'"
- congruence: Equivalence under Euclidean isometries (rigid motions) such as translations and rotations. "unique up to congruence."
- discrete group: A group endowed with the discrete topology; here, a group acting by linear transformations with isolated elements. "and is a certain discrete group of linear transformations of preserving both and the lattice ."
- Eisenstein integers: Complex numbers of the form a + bω with a,b in Z and ω = exp(2πi/3); they form a hexagonal lattice in the plane. "first draw the lattice of {Eisenstein integers} in the complex plane:"
- Gauss--Bonnet theorem: A theorem linking total curvature to topology; in the discrete setting on a sphere, the sum of angle deficits equals 4π. "By a discrete version of the Gauss--Bonnet theorem, the total angle deficit must be , so there must be 12 such cone points."
- hermitian form: A complex sesquilinear form H that is conjugate symmetric; it generalizes inner products and can be indefinite. "By a general result in linear algebra, there is a unique hermitian form on such that ."
- homeomorphic: Topologically equivalent via a continuous bijection with continuous inverse. "This polyhedron is homeomorphic to a sphere, so you have constructed a triangulation of the sphere for which 5 or 6 triangles meet at each vertex."
- isometric: Related by a distance-preserving map; two metrics are isometric if there is a bijection preserving all distances. "where two such metrics count as the same if they are isometric up to rescaling."
- lattice: A discrete additive subgroup of a vector space that spans it; e.g., integer combinations of basis vectors in or . "preserving both and the lattice ."
- Minkowski spacetime: The flat spacetime of special relativity with metric signature (1,n). "This is reminiscent of 10-dimensional Minkowski spacetime, beloved by string theorists:"
- moduli space: A parameter space whose points represent isomorphism classes of geometric structures. "Thurston also studied the larger space , and showed it is the moduli space of flat Riemannian metrics on the sphere with at most $12$ cone points and angle deficits that are nonnegative multiples of ."
- orbifold: A generalization of a manifold allowing certain types of quotient singularities from group actions. " is a more singular space, called an `orbifold'."
- projectivization: The operation of passing from a vector space to its projective space of lines through the origin (identifying vectors up to nonzero scalar multiples). " is its projectivization (the space of complex lines through the origin in on which is positive)"
- quadratic form: A homogeneous degree-2 function Q(v) on a vector space, often represented by a symmetric/Hermitian matrix. "there is a real-valued quadratic form on such that the number of triangles in the triangulation equals ."
- Riemannian metric: A smoothly varying inner product on tangent spaces of a manifold, defining lengths, angles, and curvature; flat means zero curvature. "To be precise, this gives it a flat Riemannian metric except at the points where exactly 5 triangles meet at a vertex."
- signature: The pair (p,q) giving the counts of positive and negative squares in a diagonalized quadratic or Hermitian form. "It has signature , meaning that we can find some complex coordinates on such that"
Collections
Sign up for free to add this paper to one or more collections.