We describe a generic JSON based file format which is suitable for computations in computer algebra. This is implemented in the computer algebra system OSCAR, but we also indicate how it can be used in a different context.

We discuss what is special about the reproducibility of workflows in computer algebra. It is emphasized how the programming language Julia and the new computer algebra system OSCAR support such a reproducibility, and how users can benefit for their own work.

We present the Julia interface Polymake.jl to polymake, a software for research in polyhedral geometry. We describe the technical design and how the integration into Julia makes it possible to combine polymake with state-of-the-art numerical software.

We give an overview of the application 'fulton' for toric geometry of the software framework polymake. Using two-dimensional cyclic quotient singularities as our main example, we will show how to create toric varieties and divisors on these. The Singular interface of polymake allows one to go back to the algebraic side in case there is no combinatorial algorithm known yet, in order to develop new conjectures and algorithms.

We present an interactive game which challenges a single player to match 3-dimensional polytopes to their planar nets. It is open source, and it runs in standard web browsers.

The main purpose of this paper is to report on the state of the art of computing integer hulls and their facets as well as counting lattice points in convex polytopes. Using the polymake system we explore various algorithms and implementations. Our experience in this area is summarized in ten “rules of thumb”.

We describe the implementation of a subfield of the field of formal Puiseux series in polymake. This is employed for solving linear programs and computing convex hulls depending on a real parameter. Moreover, this approach is also useful for computations in tropical geometry.

A Gorenstein polytope of index r is a lattice polytope whose r-th dilate is a reflexive polytope. These objects are of interest in combinatorial commutative algebra and enumerative combinatorics, and play a crucial role in Batyrev's and Borisov's computation of Hodge numbers of mirror-symmetric generic Calabi-Yau complete intersections. In this paper, we report on what is known about smooth Gorenstein polytopes, i.e., Gorenstein polytopes whose normal fan is unimodular. We classify d-dimensional smooth Gorenstein polytopes with index larger than (d+3)/3. Moreover, we use a modification of Oebro's algorithm to achieve classification results for smooth Gorenstein polytopes in low dimensions. The first application of these results is a database of all toric Fano d-folds whose anticanonical divisor is divisible by an integer r larger than d-8. As a second application we verify that there are only finitely many families of Calabi-Yau complete intersections of fixed dimension that are associated to a smooth Gorenstein polytope via the Batyrev-Borisov construction.

We describe the implementation of a subfield of the field of formal Puiseux series in polymake. This is employed for solving linear programs and computing convex hulls depending on a real parameter. Moreover, this approach is also useful for computations in tropical geometry.

We prove that for fixed n there are only finitely many embeddings of ℚ-factorial toric varieties X into ℙ n that are induced by a complete linear system. The proof is based on a combinatorial result that implies that for fixed nonnegative integers d and n, there are only finitely many smooth d-polytopes with n lattice points. We also enumerate all smooth 3-polytopes with ≤ 12 lattice points.

The main purpose of this paper is to report on the state of the art of computing integer hulls and their facets as well as counting lattice points in convex polytopes. Using the polymake system we explore various algorithms and implementations. Our experience in this area is summarized in ten rules of thumb.

We prove that, for fixed n there exist only finitely many embeddings of Q-factorial toric varieties X into P^n that are induced by a complete linear system. The proof is based on a combinatorial result that for fixed nonnegative integers d and n, there are only finitely many smooth d-polytopes with n lattice points. We also enumerate all smooth 3-polytopes with at most 12 lattice points. In fact, it is sufficient to bound the singularities and the number of lattice points on edges to prove finiteness.

After giving a short introduction on smooth lattice polytopes, I will present a proof for the finiteness of smooth lattice polytopes with few lattice points. The argument is then turned into an algorithm for the classification of smooth lattice polytopes in fixed dimension with an upper bound on the number of lattice points. Additionally I have implemented this algorithm for dimension two and three and used it, together with a classification of smooth minimal fans by Tadao Oda, to create lists of all smooth 2-polytopes and 3-polytopes with at most 12 lattice points.

A lattice polytope P is the convex hull of finitely many lattice points in ℤ d . It is smooth if each cone in the normal fan is unimodular. It has recently been shown that in fixed dimension the number of lattice equivalence classes of smooth lattice polytopes in dimension d with at most N lattice points is finite. We describe an algorithm to compute a representative in each equivalence class, and report on results in dimension 2 and 3 for N ≤ 12. Our algorithm is implemented as an extension to the software system polymake.