ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KK[...]. Given a positively graded subalgebra SS and an indeterminate a0a_0, let σ\sigma be a compatible term ordering, and let Procedure~ be the procedure that computes a σ\sigma-SAGBI basis of the saturation

S:a0∞.S:a_0^\infty.

SatSAGBI termination conjecture. If there is a finite σ\sigma-SAGBI basis of S:a0∞S:a_0^\infty, then Procedure~ terminates in a finite number of iterations, hence it is an algorithm. The procedure is proved correct when it terminates; the delicate point is that its intermediate algebras might form a sequence that approaches the saturation without ever reaching it. The paper leaves finite termination under the stated finite-basis hypothesis open.

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.