Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 27 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 84 tok/s Pro
Kimi K2 174 tok/s Pro
GPT OSS 120B 430 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Bloch-Kato pro-p groups and locally powerful groups (1211.4504v1)

Published 19 Nov 2012 in math.GR, math.KT, and math.NT

Abstract: A Bloch-Kato pro-p group G is a pro-p group with the property that the F_p-cohomology ring of every closed subgroup of G is quadratic. It is shown that either such a pro-p group G contains no closed free pro-p groups of infinite rank, or there exists an orientation $\theta\colon G\rightarrow \Z_p\times$ such that G is theta-abelian. In case that G is also finitely generated, this implies that G is powerful, p-adic analytic with d(G)=cd(G), and its \F_p-cohomology ring is an exterior algebra. These results will be obtained by studying locally powerful groups (see Theorem A). There are certain Galois-theoretical implications, since Bloch-Kato pro-p groups arise naturally as maximal pro-p quotients and pro-p Sylow subgroups of absolute Galois groups (see Corollary 4.9). Finally, we study certain closure operations of the class of Bloch-Kato pro-p groups, connected with the Elementary type conjecture.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.