Papers › Discrete symmetries and Efficient Counting of Operators
Discrete symmetries and Efficient Counting of Operators
Simon Calò, Coenraad Marinissen, Rudi Rahn
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present DECO ("Discrete and Efficient Counting of Operators"), an implementation of the Hilbert Series to enumerate subleading operator bases for SMEFT-like EFTs with symmetry groups as typically found in flavour and BSM physics. DECO can accommodate EFTs with arbitrary numbers and combinations of the SM gauge groups, as well as the discrete groups S4, A4, and Zn, and U(1) groups with residual global charge (and these groups' most important representations). The program is highly modular and can easily be extended to additional groups and/or representations. We demonstrate the design cases for DECO by using it to cross-check subleading operator bases of EFTs in the literature, which allows us to identify a missing operator in a widely used model for the neutrino masses and discuss said operator's impact.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections