Dynamic computations inside the algebraic closure of a valued field
Kuhlmann, Lombardi, Henri, Hervé Perdry
Abstract
Open-access reader
Kuhlmann, Lombardi, Henri, Hervé Perdry
Abstract
Open-access reader
We explain how to compute in the algebraic closure of a valued field. These computations heavily rely on the \NPAz. They are made in the same spirit as the dynamic algebraic closure of a field. They give a concrete content to the theorem saying that a valued field does have an algebraically closed valued extension. The algorithms created for that purpose can be used to perform an effective quantifier elimination for algebraically closed valued fields, which relies on a very natural geometric idea.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We explain how to compute in the algebraic closure of a valued field. These computations heavily rely on the \NPAz. They are made in the same spirit as the dynamic algebraic closure of a field. They give a concrete content to the theorem saying that a valued field does have an algebraically closed valued extension. The algorithms created for that purpose can be used to perform an effective quantifier elimination for algebraically closed valued fields, which relies on a very natural geometric idea.
Key concepts: Algebraically closed field, Algebraic closure, Closure (psychology), Computation, Field (mathematics), Quantifier elimination, Algebraic number, Mathematics