On a combinatorial problem in group theory (Q5966152)

Let \(G\) be a group of order \(p^{2n}\), where \(p\) is prime. This paper examines the structure of \(G\) as a product \(H_ i H_ j\) of subgroups of order \(p^ n\) (\(i,j = 1,2,\dots,r\), \(i \neq j\)), called components of \(G\). It is thus a generalization of the process of constructing finite translation nets of order \(p^{2n}\) and degree \(r\). The set \(\{H_ i\}\) is called a partial congruence partition of order \(p^ n\) and degree \(r\), \((p^ n,r)\text{-PCP}\) for short. Define \(T(G)\) to be the maximum value of \(r\) such that there is a \((p^ n,r)\text{-PCP}\) in the group \(G\). The author proves: Let \(n\geq 4\) and let \(G\) be a group of order \(p^{2n}\). Assume that \(G\) is not elementary abelian. then \(T(G) \leq (p^{n - 1} - 1)/(p - 1)\). The author also analyses the case \(n = 3\) in detail. Because the proofs are equally valid for \(p\) even or odd, he obtains new results, particularly when \(p\) is odd.