ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Kˉ[x1,…,xn]\bar{K}[x_1,\dots,x_n] be the polynomial algebra in nn variables over an algebraically closed field Kˉ\bar{K}, with n≥1n\geq 1. In the Ideal Chomp Game, player A and player B alternately choose proper ideals according to the game's rules, and a player wins when the opponent has no legal move.

Winning-strategy conjecture. Player A has a winning strategy on Kˉ[x1,…,xn]\bar{K}[x_1,\dots,x_n] for any n≥1n\geq 1.

This conjecture concerns the open question of determining the winner of the Ideal Chomp Game on polynomial algebras in arbitrary dimension. The preceding examples show winning strategies for player A in several related algebras, but the general case remains 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.