2022arXiv (Cornell University)Open access

Dynamic computations inside the algebraic closure of a valued field

Kuhlmann, Lombardi, Henri, Hervé Perdry

Open full text 0 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Dynamic computations inside the algebraic closure of a valued field — Research Paper | ScholarLens