Explicit constructions of large 3-zero-sum-free subsets in (Z/4Z)^n. Baseline size 176, refined 512 for n=5. Code and data for additive combinatorics.
-
Updated
Aug 29, 2025 - Python
Explicit constructions of large 3-zero-sum-free subsets in (Z/4Z)^n. Baseline size 176, refined 512 for n=5. Code and data for additive combinatorics.
Add a description, image, and links to the zero-sum-free topic page so that developers can more easily learn about it.
To associate your repository with the zero-sum-free topic, visit your repo's landing page and select "manage topics."