The Separating Noether Number of Finite Abelian Groups
Jing Huang

TL;DR
This paper exactly determines the separating Noether number for all finite abelian groups using additive combinatorics, avoiding previous assumptions, and confirms a conjecture about the support of extremal separating atoms for groups of rank at least two.
Contribution
It provides a complete formula for the separating Noether number of finite abelian groups and introduces novel combinatorial methods, bypassing previous restrictive assumptions.
Findings
Exact formulas for eta_{ ext{sep}}(G) for all finite abelian groups.
Validation of a conjecture on the support of extremal separating atoms for groups of rank or more.
Identification of exceptions in the cyclic (rank 1) case.
Abstract
For a finite abelian group , let denote its separating Noether number. We determine exactly for every finite abelian group with If , then whereas if , then where denotes the smallest prime divisor of . Our proof is additive-combinatorial in nature. It avoids the Davenport-equality assumption used in previous works. The key ingredients are a geometric reduction of auxiliary sequences via the novel construction of geodesic surrogates, alongside a uniform lifting procedure for relation groups. As an application, we prove that if , then every extremal separating atom…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Rings, Modules, and Algebras · Graph Labeling and Dimension Problems
