ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let F\mathcal{F} be the family of polynomial systems FF such that Z(F)Z(F) is finite and the Galois group of FF over Q\mathbb{Q} is dihedral or bicyclic. Let FEAS⁡C\operatorname{FEAS}_{\mathbb{C}} denote complex feasibility, namely the problem of deciding whether Z(F)Z(F) is nonempty. Dihedral and bicyclic feasibility conjecture. The restriction of FEAS⁡C\operatorname{FEAS}_{\mathbb{C}} to F\mathcal{F} lies in PNPNP\mathbf{P}^{\mathbf{NP}^{\mathbf{NP}}} unconditionally. This proposes an unconditional upper bound for complex feasibility on systems whose zero set is finite and whose Galois group has the specified structure; the surrounding discussion presents it as an algorithmic analogue of the paper's results and as a conjecture based on an observation of Rachel Pries.

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.