Terms of Use
By Year
2025
2024
2023
2022
2021
2020
2019
2018
2017
By Software
Bertini
CaDiCaL
CInet::Base
CInet::ManySAT
DifferentialEquations.jl
GANAK
GAP
HomotopyContinuation.jl
Julia
Macaulay2
MAGMA
Maple
Mathematica
MATLAB
nbc_minisat_all
OSCAR
Parallel
Pari/GP
Perl
Polymake
Python
PyTorch
Rust
SageMath
SCIP
sharpSAT-TD
Singular
SoPlex
By Author
By Events
Macaulay2 bootcamp
Exercises
Macaulay2 general
Types and packages
Git and Github
Code transcripts
Session 1
Session 2
BestPackage
Session 4
Meet and greet with OSCAR
Groups in OSCAR
Rosa’s group
(Symmetric and) Permutation groups
Types and methods
Number Theory in OSCAR
Creating number fields
Invariants and elements
Automorphisms and Galois groups
Polytopes in OSCAR
Documentation
Note
Visualization note
Polytopes are the convex hull of finitely many points (V-representation). The minimal set of points = “vertices”
Polytopes are also the intersection of finitely many half-spaces (H-representation). Minimal set of halfspaces = “facets”
Note that we have more properties (fieldnames) on this list than before. Let’s check some of them out!
Rings and ideals in OSCAR
First let’s try things like with Taylor’s presentation: working directly with Singular
Using Oscar: So how is this implemented in Oscar?
Let’s take one such primary component
What else has been written for Oscar ideals?
Computation Day
Problem 1
Solution
Problem 2
Solution
Problem 3
Solution
Problem 4
Solution
Problem 5
Solution
Problem 6
Problem 7
Solution
Problem 8
Solution
Problem 9
Solution
Problem 10
Problem 11
Solution
Problem 12
Solution
Problem 13
Solution
Problem 14
Problem 15
Problem 16
Solution
Problem 17
Solution
Problem 18
Solution
Problem 19
Solution
Problem 20
Solution
Open Problems
Explicitly Stated Open Problems in Articles by Bernd Sturmfels
Comments
Comments by Michael Joswig:
A - Z
MATHREPO
By Events
By Events
Macaulay2 bootcamp
Meet and greet with OSCAR
Computation Day