Let k be a field and G a finite group, acting on the polynomial ring
In that case there are open questions about the constructive complexity of AG, measured by degree bounds for generators, and about the structural complexity, measured by the depth (=length of maximal regular sequence, or “cohomological co-dimension”) of AG as a module over a homogeneous system of parameters.
In my talk I will, after a brief introduction, report on some recent results dealing with both types of questions.
We present methods for the resolution of decomposable form equations over global fields. In general, those equations are reduced to unit equations. Algorithms for solving the latter differ substantially in the number and function field case. Thue and norm form equations will be discussed in greater detail. Also, the fastest known method for computing all integral points on Mordell curves y2=x3 + k will be presented.