On the Vanishing Criterion for the Cohomology Groups of the Automorphism Group of a finite Abelian $p$-Group
Abstract: For a partition $\underline{\lambda} = (\lambda_{1}{\rho_1}>\lambda_{2}{\rho_2}>\lambda_{3}{\rho_3}>\ldots>\lambda_{k}{\rho_k})$ and its associated finite abelian $p$-group $\mathcal{A}{\underline{\lambda}}=\underset{i=1}{\overset{k}{\oplus}} (\mathbb{Z}/p{\lambda_i}\mathbb{Z}){\rho_i}$, where $p$ is a prime, we consider two actions of its automorphism group $\mathcal{G}{\underline{\lambda}}$ on $\mathcal{A}{\underline{\lambda}}$. The first action is the natural action $g\bullet a=\ ga$ for all $g\in\mathcal{G}{\underline{\lambda}}$ and $a\in\mathcal{A}{\underline{\lambda}}$ where the action map is denoted by $\Lambda_1=Id{\mathcal{G}{\underline{\lambda}}}:\mathcal{G}{\underline{\lambda}}\longrightarrow \mathcal{G}{\underline{\lambda}}$ and the second action is the trivial action $g\bullet a=a$ for all $g\in\mathcal{G}{\underline{\lambda}}$ and $a\in\mathcal{A}{\underline{\lambda}}$ where the action map is denoted by $\Lambda_2:\mathcal{G}{\underline{\lambda}}\longrightarrow {e}\subset\mathcal{G}{\underline{\lambda}}$ the trivial map. For the natural action $\Lambda_1$, we show that the first and second cohomology groups $H{\Lambda_1}i(\mathcal{G}{\underline{\lambda}},\mathcal{A}{\underline{\lambda}}),i=1,2$ vanish for any partition $\underline{\lambda}$ for an odd prime $p$. For the trivial action $\Lambda_2$ we show that, for an odd prime $p$, the first cohomology group $H_{\Lambda_2}1(\mathcal{G}{\underline{\lambda}},\mathcal{A}{\underline{\lambda}})$ and for an odd prime $p\neq 3$, the second cohomology group $H_{\Lambda_2}2(\mathcal{G}{\underline{\lambda}},\mathcal{A}{\underline{\lambda}})$ vanish if and only if the difference between two successive parts of the partition $\underline{\lambda}$ is at most one. This is done by using the $mod\ p$ cohomologies $Hi(\mathcal{G}_{\underline{\lambda}},\mathbb{Z}/p\mathbb{Z}),i=1,2$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.