ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ff be the polynomial defining the rational integral, and let rfr_f denote the integer for which the reduction operation [ ]rf[\,]_{r_f} has the properties established earlier in the paper. The paper explains that rfr_f is explicit but difficult to compute, since Dimca's proof expresses it in terms of a resolution of the singularities of the projective variety V(f)V(f). Dimca's conjecture. Dimca conjectured that

rf⩽n+1.r_f\leqslant n+1.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.