Abstract
A group is said to be factorized into subsets if every element in can be uniquely represented as , where , . We consider the following conjecture: for every finite group and every factorization of its order, there is a factorization with and . We show that a minimal counterexample to this conjecture must be a nonabelian simple group and prove the conjecture for every finite group the nonabelian composition factors of which have orders less than .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.