The dihedral and bicyclic Galois-group feasibility conjecture
Statement
Let be the family of polynomial systems such that is finite and the Galois group of over is dihedral or bicyclic. Let denote complex feasibility, namely the problem of deciding whether is nonempty. Dihedral and bicyclic feasibility conjecture. The restriction of to lies in 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.