A characterisation of elementary abelian 3-groups
Chimere Anabanti

TL;DR
This paper corrects a previous characterization of elementary abelian 2-groups using sum-free sets and extends the analysis to elementary abelian 3-groups, providing exact counts of maximal sum-free sets and discussing limitations for primes greater than 3.
Contribution
It corrects a flawed theorem about elementary abelian 2-groups and establishes a new characterization for elementary abelian 3-groups based on their maximal sum-free sets.
Findings
Corrected the characterization of elementary abelian 2-groups.
Derived the number of maximal sum-free sets in elementary abelian 3-groups as 3^n - 1.
Showed no similar characterization exists for primes p > 3.
Abstract
Tarnauceanu [Archiv der Mathematik, 102 (1), (2014), 11--14] gave a characterisation of elementary abelian -groups in terms of their maximal sum-free sets. His theorem states that a finite group is an elementary abelian -group if and only if the set of maximal sum-free sets coincides with the set of complements of the maximal subgroups. A corollary is that the number of maximal sum-free sets in an elementary abelian -group of finite rank is . Regretfully, we show here that the theorem is wrong. We then prove a correct version of the theorem from which the desired corollary can be deduced. Moreover, we give a characterisation of elementary abelian -groups in terms of their maximal sum-free sets. A corollary to our result is that the number of maximal sum-free sets in an elementary abelian -group of finite rank is . Finally, for prime and…
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 · graph theory and CDMA systems · Graph Labeling and Dimension Problems
