Published April 12, 2026 | Version v2
Dataset Open

Dataset of Kantorovich-Rubinstein-Wasserstein Polytopes of Metric Spaces on up to 6 Points

  • 1. ROR icon University of Applied Sciences and Arts of Southern Switzerland
  • 2. ROR icon Bielefeld University
  • 3. ROR icon University of Kassel
  • 4. ROR icon University of Bayreuth

Description

We present a complete list of all combinatorial types of generic Kantorovich-Rubinstein-Wasserstein (KRW) polytopes associated with metric spaces on up to 6 points that are generic in the sense of Gordon and Petrov. These polytopes and their properties are described in detail in the preprint "Combinatorial invariants of finite metric spaces and the Wasserstein arrangement".

The catalog of KRW polytopes was computed using certain regular triangulations of the full root polytope. These regular triangulations were enumerated up to symmetry by Jörg Rambau using the new topcom package.

The provided data consists of:

  • The files ending in ".result" contain the original topcom output including the specific regular triangulations of the root polytope.
  •  julia files that contain these triangulations ("triangulations_x.jl"), one triangulation per line.
  • An OSCAR script ("read_triangulations.jl") that reads these triangulations and produces sample metrics associated with each of these triangulations.
  • A Jupyter notebook ("wasserstein_arrangement_code.ipynb") with OSCAR code to compute KRW polytopes as well as code to determine the representatives for the combinatorial types. For convenience, we also included the notebook as a julia script as well as a pdf of the notebook. 
  • JSON files saved as .mrdi containing the collection of all KRW polytopes of strict and generic metrics for $n=5$ and all generic metrics for $n=6$ together with their corresponding metrics (one per combinatorial type). These files can be loaded in OSCAR via 
    load("Polytopes_generic_metrics_5.mrdi")

We used julia Version 1.12.6 with these packages:

  • OSCAR v1.7.2
  • CountingChambers v0.2.3
  • Graphs v1.14.0

Files

Polytopes_strict_metrics_6.mrdi.zip

Files (67.6 MB)

Name Size Download all
md5:6634536a2895875fe3a428b06935319a
69.8 kB Download
md5:50e08cde7336a4282dc3390a91799078
1.0 MB Download
md5:152b799e8ad8646879c4366ef3969ce4
59.5 MB Preview Download
md5:051b2d1a8e2a907fbdb270cadb5fac3f
5.6 kB Download
md5:4940720d4f51d8a67d82810a9ff95276
6.7 kB Download
md5:ea2520f9024c31610f5cc9606ed62dd1
20.0 kB Download
md5:e62437264037c3123c6b00bc91387cda
3.9 MB Preview Download
md5:012b4acba50d2a58e151e370ccacd354
230 Bytes Download
md5:e59c6423cf424f028666c3e93dbbb63e
12.6 kB Download
md5:f342d1decca987e02ff42ac8d595cfd1
2.8 MB Preview Download
md5:0344d4033c95c1ff4b49dd1d778d8a70
68.6 kB Preview Download
md5:04b5d891f9275249aebfb0af29e3e32c
9.5 kB Download
md5:e6c1f84a3f3ddc0aa154f7094b1fed42
90.9 kB Preview Download

Additional details

Funding

Deutsche Forschungsgemeinschaft
CRC 358 Integral Structures in Geometry and Representation Theory 491392403 – TRR 358
Deutsche Forschungsgemeinschaft
SPP 2458 Combinatorial Synergies SPP 2458 -- 539866293

Dates

Updated
2026-04-12
Added code to generate data of all generic KRW polytopes for n=5

Software

Programming language
Julia
Development Status
Active

References

  • E. Delucchi, L. Kühne, and L. Mühlherr: Combinatorial invariants of finite metric spaces and the Wasserstein arrangement, 2026, https://arxiv.org/abs/2408.15584.
  • OSCAR - Open Source Computer Algebra Research system, Version 1.7.2, The OSCAR Team, 2026. (https://www.oscar-system.org)
  • W. Decker, C. Eder, C. Fieker, M. Horn, M. Joswig, eds. The Computer Algebra System OSCAR: Algorithms and Examples, Algorithms and Computation in Mathematics, Springer, 2025. (https://link.springer.com/book/9783031621260)
  • J. Rambau: Symmetric lexicographic subset reverse search for the enumeration of circuits, cocircuits, and triangulations up to symmetry, 2023, https://www.wm.uni-bayreuth.de/de/team/rambau_joerg/TOPCOM/SymLexSubsetRS-2.pdf
  • E. Gawrilow and M. Joswig. polymake: a framework for analyzing convex polytopes. Polytopes—combinatorics and computation (Oberwolfach, 1997), 43–73, DMV Sem., 29, Birkhäuser, Basel, 2000.
  • J. Gordon and F. Petrov: Combinatorics of the Lipschitz polytope, 2017,  Arnold Math. J. 3.2.