Termination conjecture for the SatSAGBI procedure
Statement
Let [...]. Given a positively graded subalgebra and an indeterminate , let be a compatible term ordering, and let Procedure~ be the procedure that computes a -SAGBI basis of the saturation
SatSAGBI termination conjecture. If there is a finite -SAGBI basis of , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.