Dimca's bound for the Griffiths–Dwork reduction index
Statement
Let be the polynomial defining the rational integral, and let denote the integer for which the reduction operation has the properties established earlier in the paper. The paper explains that is explicit but difficult to compute, since Dimca's proof expresses it in terms of a resolution of the singularities of the projective variety . Dimca's conjecture. Dimca conjectured that
This bound would provide an a priori termination bound for the reduction algorithm and avoid dependence on a resolution of the singularities. The source gives no evidence here that the conjecture has been resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.