
> 
> 1. Is there an algorithm which halts on all inputs that takes as input a finite group ($p$-group if you like) and outputs a finite presentation of the cohomology ring (with trivial coefficients $\mathbb{F}\_p$) in terms of generators and relations.
> 
> 
> 


For concreteness, let's say the input is given by a generating set of matrices, or permutations, or by giving its multiplication table - from the computability point of view, these are all equivalent.


I've read much of David J. Green's book "Grobner bases and the computation of group cohomology," in which he presents an algorithm that produces "partial presentation" of the cohomology ring degree-by-degree. There is a sufficient criterion due to J. F. Carlson which says when you're done - that is, when this partial presentation is actually a correct presentation of the cohomology ring - but the book seems to indicate that Carlson's criterion either is not necessary or at least not known to be necessary (as of its writing, 2003).


Now, the algorithm used in Green's book will eventually get a complete presentation of the cohomology ring, but the issue is whether the algorithm can tell when it's reached a high enough degree to be done. Following this strategy, a related question is:



> 
> 2. Consider the function $b\_p:FinGrp \to \mathbb{N}$ defined by $b\_p(G)$ is the least $n \in \mathbb{N}$ such that the cohomology ring of $G$ with coefficients in $\mathbb{F}\_p$ is completely determined by the partial presentation one gets by going up to degree $n$. Is $b\_p$ bounded by a computable function?
> 
> 
> 



Is the cohomology ring of a finite group computable?
As I understand it this follows from Benson's Regularity Conjecture, proved by Symonds fairly recently. It says that $b\_p = 2(|G|-1)$ will do. 


