Database of zero-sum sequence factorization over $C_3 \oplus C_3 \oplus C_3$
Authors/Creators
Description
Companion databases, generating programs and verification programs for the article: A. Geroldinger, B. Hackl, Q. Zhong, The system of length sets of transfer Krull monoids over $C_3 \oplus C_3 \oplus C_3$.
The record contains the twelve databases (gzip-compressed JSON Lines) behind the computational results in Section 4 of the article. They include the catalogue of all 27911 minimal zero-sum sequences over $C_3 \oplus C_3 \oplus C_3$, the length sets of products of two atoms, and the enumerations used in the proofs of Lemmas 4.1 to 4.11. Each database comes with the Python program that generates it, and regenerating them reproduces the files byte for byte.
Two independent checks are included. A Jupyter notebook, which otherwise needs only the Python standard library, multiplies out every stored factorization and compares the stored counts and length sets with the article. A separate verifier re-derives the databases of Lemmas 4.7 to 4.11 without using the code of the generators.
README.md explains how to check and regenerate the databases, and computations/DATABASES.md describes every file and field. The code is under the MIT licence; the databases are dedicated to the public domain under CC0 1.0.
Files
README.md
Additional details
Related works
- Is supplement to
- Preprint: arXiv:2611.21699 (arXiv)
- Requires
- Software: https://github.com/behackl/zero-sum-sequences/releases/tag/v0.3.1 (URL)
Software
- Programming language
- Python