Papers › Replicable functions arising from code-lattice VOAs fixed by automorphisms
Replicable functions arising from code-lattice VOAs fixed by automorphisms
Lea Beneish, Jennifer Berg, Eva Goedhart, Hussain M. Kadhem, Allechar Serrano López, Stephanie Treneer
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 ascertain properties of the algebraic structures in towers of codes, lattices, and vertex operator algebras (VOAs) by studying the associated subobjects fixed by lifts of code automorphisms. In the case of sublattices fixed by subgroups of code automorphisms, we identify replicable functions that occur as quotients of the associated theta functions by suitable eta products. We show that these lattice theta quotients can produce replicable functions not associated to any individual automorphisms. Moreover, we show that the structure of the fixed subcode can induce certain replicable lattice theta quotients and we provide a general code theoretic characterization of order doubling for lifts of code automorphisms to the lattice-VOA. Finally, we prove results on the decompositions of characters of fixed subVOAs.
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