activity
20102024
most citedFew smooth d-polytopes with n lattice points

14 citations · 27 across the 8 of their papers we have counts for

collaborators

9 papers

cs.MS2024

Confirmable Workflows in OSCAR

Michael Joswig, Lars Kastner, Benjamin Lorenz

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…

cs.MS2023★ 1 cited

A FAIR File Format for Mathematical Software

Antony Della Vecchia, Michael Joswig, Benjamin Lorenz

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…

math.CO2020

Polymake.jl: A new interface to polymake

Marek Kaluba, Benjamin Lorenz, Sascha Timme

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…

math.HO2019

MatchTheNet -- An Educational Game on 3-Dimensional Polytopes

Michael Joswig, Georg Loho, Benjamin Lorenz +1

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

math.OC2015★ 6 cited

Linear programs and convex hulls over fields of Puiseux fractions

Michael Joswig, Georg Loho, Benjamin Lorenz +1

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…

math.CO2014★ 2 cited

Computing convex hulls and counting integer points with polymake

Benjamin Assarf, Ewgenij Gawrilow, Katrin Herr +4

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 po…