ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KK be an algebraically closed field of characteristic 0, and let GG be an ordered divisible group. Consider the Hahn field, defined as follows:

K((G))={∑g∈Sagtg∣S⊆G well-ordered,ag∈K} K((G)) = \left\{\sum_{g\in S}a_g t^g \mid S\subseteq G \text{ well-ordered}, a_g\in K\right\}

If KK and GG are computable and f∈K((G))[X]f\in K((G))[X], how complex is it to determine a root of ff? At each step, the procedure should produce the next term in a root of ff, based on the aga_g in the input coefficients of ff. For each step α\alpha, how many jumps over these coefficients are needed to do step α\alpha?

Record

Added
Links

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.