top of page
Some additional material to research papers and lectures
 Our algorithm to compute polystar approximations, in Python. |  Our algorithm to compute the weighted number of bicolored graphs. |  Our algorithm for linear causal disentanglement using higher-order cumulants, in Python. |
|---|---|---|
 Computing the algebraic degree of the Wasserstein distance, and the invariant Birkhoff polytope, in Julia. |  Computing the best slice of a polytope, in SageMath. |  Toric geometry exercises, in Oscar.jl. |
 Computing the intersection body of a polytope, in SageMath and Oscar.jl. |  Computing the fiber body of a zonotope, in SageMath and Oscar.jl. |
bottom of page