The notion of key polynomials was first introduced in 1936 by S. Maclane in the case of discrete rank 1 valuations. . Let K -> L be a field extension and ν a valuation of K. The original motivation for introducing key polynomials was the problem of describing all the extensions μ of ν to L. Take a valuation μ of L extending the valuation ν. In the case when ν is discrete of rank 1 and L is a simple algebraic extension of K Maclane introduced the notions of key polynomials for μ and augmented valuations and proved that μ is obtained as a limit of a family of augmented valuations on the polynomial ring K[x].
In a series of papers, M. Vaquié generalized MacLane's notion of key polynomials to the case of arbitrary valuations ν (that is, valuations which are not necessarily discrete of rank 1).
In the paper Valuations in algebraic field extensions, published in the Journal of Algebra in 2007, F.J. Herrera Govantes, M.A. Olalla Acosta and M. Spivakovsky develop their own notion of key polynomials for extensions (K, ν) -> (L, μ) of valued fields, where ν is of archimedian rank 1 (not necessarily discrete) and give an explicit description of the limit key polynomials.
Our purpose in this paper is to clarify the relationship between the two notions of key polynomials already developed by vaquié and by F.J. Herrera Govantes, M.A. Olalla Acosta and M. Spivakovsky.
Let $(K,v)$ be a valued field. We review some results of MacLane and Vaquié on extensions of $v$ to valuations on the polynomial ring $K[x]$. We introduce certain MacLane-Vaquié chains of residually transcendental valuations, and we prove that every valuation $μ$ on $K[x]$ is a limit of a finite or countably infinite MacLane-Vaquié chain. This chain underlying $μ$ is essentially unique and contains arithmetic data yielding an explicit description of the graded algebra of $μ$ as an algebra over the graded algebra of $v$.
Let $ν$ be a valuation of arbitrary rank on the polynomial ring $K[x]$ with coefficients in a field $K$. We prove comparison theorems between MacLane-Vaquié key polynomials for valuations $μ\leν$ and abstract key polynomials for $ν$. Also, some results on invariants attached to limit key polynomials are obtained. In particular, if $\operatorname{char}(K)=0$ we show that all limit key polynomials of unbounded continuous MacLane chains have numerical character equal to one.
This article is a natural construction of our previous works. In this article, we employ similar ideas due to MacLane to provide an estimate of IC(K(X)|K,v) when (K(X)|K,v) is a valuation algebraic extension. Our central result is an analogue of the estimate obtained in the valuation transcendental case. We further provide a natural construction of a complete sequence of key polynomials for v over K in the setting of valuation algebraic extensions.
Given a well-ordered semi-group $Γ$ with a minimal system of generators of ordinal type at most $ωn$ and of rational rank $r$, which satisfies a positivity and increasing condition, we construct a zero-dimensional valuation centered on the ring of polynomials with $r$ variables such that the semi-group of the values of the polynomial ring is equal to $Γ$. The construction uses a generalization of Favre and Jonsson's version of MacLane's sequence of key-polynomials.
Let $(K,v)$ be a henselian valued field. Let $\mathbb{P}^{dless}\subset K[x]$ be the set of monic, irreducible polynomials which are defectless and have degree greater than one. For a certain equivalence relation $\,\approx\,$ on $\,\mathbb{P}^{dless}$, we establish a canonical bijection $\mathbb{M}\to \mathbb{P}^{dless}/\!\!\approx$, where $\mathbb{M}$ is a discrete MacLane space, constructed in terms of inductive valuations on $K[x]$ extending $v$.
Let $K\to L$ be an algebraic field extension and $ν$ a valuation of $K$. The purpose of this paper is to describe the totality of extensions $\left\{ν'\right\}$ of $ν$ to $L$ using a refined version of MacLane's key polynomials. In the basic case when $L$ is a finite separable extension and $rk ν=1$, we give an explicit description of the limit key polynomials (which can be viewed as a generalization of the Artin--Schreier polynomials). We also give a realistic upper bound on the order type of the set of key polynomials. Namely, we show that if $char K=0$ then the set of key polynomials has or…
Given a divisorial discrete valuation 'centered at infinity' on C[x,y], we show that its sign on C[x,y] (i.e. whether it is negative or non-positive on non-constant polynomials) is completely determined by the sign of its value on the 'last key form' (key forms being the avatar of 'key polynomials' of valuations (introduced by [Maclane, 1936]) in 'global coordinates'). The proof involves computations related to the cone of curves on certain compactifications of C^2 and gives a characterization of the divisorial valuations centered at infinity whose 'skewness' can be interpreted in terms of the…
For an arbitrary valued field $(K,v)$ and a given extension $v(K^*)\hookrightarrowΛ$ of ordered groups, we analyze the structure of the tree formed by all $Λ$-valued extensions of $v$ to the polynomial ring $K[x]$. As an application, we find a model for the tree of all equivalence classes of valuations on $K[x]$ (without fixing their value group), whose restriction to $K$ is equivalent to $v$. In the henselian case, we apply these results to show that there is a complete parallelism between the arithmetic properties of irreducible polynomials $F\in K[x]$, encoded by their Okutsu frames, and th…
Let $ι:(K,ν)\hookrightarrow(K(x),μ)$ be a simple purely transcendental extension of valued fields. In order to study such an extension, M. Vaquié, generalizing an earlier construction of S. Mac Lane, introduced the notion of Key polynomials. In this paper we define a related notion of \textbf{abstract key polynomials} associated to $ι$ and study the relationship between them and key polynomials of Mac Lane -- Vaquié. Associated to each abstract key polynomial $Q$, we define the truncation $μ_{Q}$ of $μ$ with respect to $Q$ and we study the properties of those truncations. Roughly speaking, $μ_…
Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting key polynomials.
For a simple, normal and finite extension of a valued field, we prove that we can related the order of the ramification group of the field extension and the set of key polynomials associated to the extension of the valuation. More precisely, the order of this group can be expressed in terms of a product of a power of the characteristic of the residue field of the valuation and the effective degrees of the key polynomials. We also give a condition on the order of the ramification group so that there is no limit key polynomials for a valuation of rank one. This condition also allow us to have a …
For all simple and finite extension of a valued field, we prove that its defect is the product of the effective degrees of the complete set of key polynomials associated. As a consequence, we obtain a local uniformization theorem for valuations of rank 1 centered on an equicharacteristic quasi-excellent local domain satisfying some inductive assumptions of lack of defect.
Let $R$ be a two-dimensional regular local ring. In this paper, we prove that there is a bijection between the set of all valuations of $Quot(R)$ centered at $R$ and valuations of $k(x,y)$ centered at $k[x,y]_{(x,y)}$, where $k$ is the residue field of $R$ and $x$ and $y$ are independent variables. Moreover, we give a new proof, for the fact that the set of all normalized real valuations centered at $R$ admits a structure of non metric tree.
Schubert polynomials are a basis for the polynomial ring that represent Schubert classes for the flag manifold. In this paper, we introduce and develop several new combinatorial models for Schubert polynomials that relate them to other known bases including key polynomials and fundamental slide polynomials. We unify these and existing models by giving simple bijections between the combinatorial objects indexing each. In particular, we give a simple bijective proof that the balanced tableaux of Edelman and Greene enumerate reduced expressions and a direct combinatorial proof of Kohnert's algori…
For Reed-Solomon codes, the key equation relates the syndrome polynomial---computed from the parity check matrix and the received vector---to two unknown polynomials, the locator and the evaluator. The roots of the locator polynomial identify the error positions. The evaluator polynomial, along with the derivative of the locator polynomial, gives the error values via the Forney formula. The Berlekamp-Massey algorithm efficiently computes the two unknown polynomials. This chapter shows how the key equation, the Berlekamp-Massey algorithm, the Forney formula, and another formula for error evalua…
We compare four key hierarchies for solving Constrained Polynomial Optimization Problems (CPOP): Sum of Squares (SOS), Sum of Diagonally Dominant Polynomials (SDSOS), Sum of Nonnegative Circuits (SONC), and the Sherali Adams (SA) hierarchies. We prove a collection of dependencies among these hierarchies both for general CPOPs and for optimization problems on the Boolean hypercube. Key results include for the general case that the SONC and SOS hierarchy are polynomially incomparable, while SDSOS is contained in SONC. A direct consequence is the non-existence of a Putinar-like Positivstellensatz…
