A modular idealizer chain and unrefinability of partitions with repeated parts (Q6561670)

Recently, \textit{R. Aragona} et al. [Aequationes Math. 96, No. 6, 1339--1363 (2022; Zbl 1525.11116)] introduced a chain of normalizers in a Sylow \(2\)-subgroup of \(\mathrm{Sym}(2^n)\), starting from an elementary abelian regular subgroup. They proved that the indices of consecutive groups in the chain depend on the number of partitions into distinct parts and provided a description, by means of rigid commutators, of the first \(n-2\) terms in the chain. Moreover, they proved that the \((n-1)\)-th term of the chain is described by means of rigid commutators corresponding to unrefinable partitions into distinct parts. Although the mentioned chain can be defined in a Sylow \(p\)-subgroup of \(\mathrm{Sym}(p^n)\), for \(p>2\) computing the chain of normalizers indeed becomes a difficult task, in the absence of a suitable notion of rigid commutators.\N\NIn an attempt to achieve results in this direction, the authors introduce the graded Lie ring associated to the lower central series of \(\Sigma\), which is the iterated wreath product of Lie rings of rank one, and reflects the construction of the Sylow \(p\)-subgroup of \(\mathrm{Sym}(p^n)\), for any prime \(p\geq2\). They next prove how the corresponding idealizers are generated by subsets of partitions into at most \(m-1\) parts and we conjecture that the idealizer chain grows as the normalizer chain in the symmetric group. They further conjecture that this is the \(p\)-analog of the chain of normalizers in \(\mathrm{Sym}(p^n)\), where \(m=p\) is odd. For the case \(m=2\), they prove that the terms of the normalizer chain can be actually computed via the Lie ring structure described as above. More precisely, they establish a correspondence between the two constructions in the case \(m=2\). This paper concludes with some comments on open problems.