Control of fusion by elementary abelian subgroups of rank at least 2
Lizhong Wang, Xingzhong Xu, Jiping Zhang

TL;DR
This paper proves that elementary abelian subgroups of rank at least 2 can control p-fusion for odd primes, improving existing theorems in the field.
Contribution
It extends the control of p-fusion to a broader class of subgroups, specifically elementary abelian of rank ≥ 2, for odd primes.
Findings
Elementary abelian subgroups of rank ≥ 2 control p-fusion for odd primes
Improvement of Theorem B from previous work for odd primes
Enhanced understanding of subgroup control in p-fusion theory
Abstract
In this paper, we focus on the subgroups control -fusion, and we improve the Theorem B of [4] for odd prime. For odd prime, we prove that elementary abelian subgroups of rank at least 2 can control -fusion(see our Theorem B).
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
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · graph theory and CDMA systems
