Contents Menu Expand Light mode Dark mode Auto light/dark mode
Thematic Tutorials
Light Logo Dark Logo
Sage 9.7 Documentation
  • Home - Thematic Tutorials
  • Thematic tutorial document tree
    • Algebraic Combinatorics in Sage
      • Walks in graphs
      • \(n\)-Cube
      • The Tsetlin library
      • Young’s lattice and the RSK algorithm
    • Abelian Sandpile Model
    • Group Theory and Sage
    • Lie Methods and Related Combinatorics in Sage
      • The Scope of this Document
      • Lie Group Basics
      • The Weyl Character Ring
      • Maximal Subgroups and Branching Rules
      • Weyl Groups, Coxeter Groups and the Bruhat Order
      • Classical Crystals
      • Affine Root System Basics
      • Integrable Highest Weight Representations of Affine Lie algebras
      • Affine Finite Crystals
      • Affine Highest Weight Crystals
      • Elementary crystals
      • Infinity Crystals
      • Iwahori Hecke Algebras
      • Kazhdan-Lusztig Polynomials
      • Bibliography
    • Tutorial: Vector Calculus in Euclidean Spaces
      • How to compute a gradient, a divergence or a curl
      • How to perform vector calculus in curvilinear coordinates
      • How to change coordinates
      • Advanced aspects: the Euclidean space as a Riemannian manifold
      • Vector calculus in the Euclidean plane
    • Linear Programming (Mixed Integer)
    • Number Theory and the RSA Public Key Cryptosystem
    • Coding Theory in Sage
    • How to write your own classes for coding theory
    • Polyhedra
      • A Brief Introduction to Polytopes in Sage
      • A Longer Introduction to Polyhedral Computations in Sage
      • Quick reference for polyhedra in Sage
      • Polyhedra tips and tricks
      • Visualization of polyhedron objects in Sage
      • Draw polytopes in LaTeX using TikZ
    • Steenrod Algebra Modules
    • Tutorial: Programming in Python and Sage
    • Tutorial: Comprehensions, Iterators, and Iterables
    • Tutorial: Objects and Classes in Python and Sage
    • Functional Programming for Mathematicians
    • How to implement new algebraic structures in Sage
    • Tutorial: Implementing Algebraic Structures
    • How to call a C code (or a compiled library) from Sage ?
    • Numerical Computing with Sage
      • Numerical Tools
        • NumPy
        • SciPy
        • Cvxopt
      • Using Compiled Code Interactively
        • f2py
        • More Interesting Examples with f2py
        • Ctypes
        • More complicated ctypes example
        • Comparison to Cython/Pyrex
      • Parallel Computation
        • mpi4py
        • Parallel Laplace Solver
    • Three Lectures about Explicit Methods in Number Theory Using Sage
      • Introduction
      • Number Fields
        • Introduction to Number Fields
        • Number Fields: Galois Groups and Class Groups
        • Orders and Relative Extensions
      • A Bird’s Eye View
        • Integer Factorization
        • Elliptic Curves
        • The Matrix of Frobenius on Hyperelliptic Curves
        • Modular Symbols
        • Enumerating Totally Real Number Fields
        • Bernoulli Numbers
        • Polynomial Arithmetic
      • Modular Forms
        • Modular Forms and Hecke Operators
        • Modular Symbols
        • Method of Graphs
        • Level One Modular Forms
        • Half Integral Weight Forms
        • Generators for Rings of Modular Forms
        • \(L\)-series
        • Modular Abelian Varieties
    • Profiling in Sage
    • Creating a Tutorial from an old Sage Worksheet (.sws)
Back to top

Polyhedra#

Here you can find various documents that explain how to perform polyhedral computations in Sage.

  • A Brief Introduction to Polytopes in Sage
  • A Longer Introduction to Polyhedral Computations in Sage
  • Quick reference for polyhedra in Sage
  • Polyhedra tips and tricks
  • Visualization of polyhedron objects in Sage
  • Draw polytopes in LaTeX using TikZ
Next
A Brief Introduction to Polytopes in Sage
Previous
How to write your own classes for coding theory
Copyright © 2005--2022, The Sage Development Team
Made with Sphinx and @pradyunsg's Furo