Related papers: Minimal limit key polynomials

For a certain field $K$, we construct a valuation-algebraic valuation on the polynomial ring $K[x]$, whose Maclane--Vaqui\'e chain consists of an infinite (countable) number of limit augmentations

For a fixed irreducible polynomial $F$ we study the set $\mathcal V_F$ of all valuations on $K[x]$ bounded by valuations whose support is $(F)$. The first main result presents a characterization for valuations in $\mathcal V_F$ in terms of…

We pursue various restricted variable generalizations of the Chevalley-Warning theorem for low degree polynomial systems over a finite field. Our first such result involves variables restricted to Cartesian products of the Vandermonde…

Let $T$ be a polynomially bounded o-minimal theory extending the theory of real closed ordered fields. Let $K$ be a model of $T$ equipped with a $T$-convex valuation ring and a $T$-derivation. If this derivation is continuous with respect…

We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of R^k, assuming that P is positive on the simplex. This bound depends only on the number…

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Let $(K,v)$ be a valued field. We review some results of MacLane and Vaqui\'e on extensions of $v$ to valuations on the polynomial ring $K[x]$. We introduce certain MacLane-Vaqui\'e chains of residually transcendental valuations, and we…

One of the main goals of this paper is to present the relation of limit key polynomials and limit MacLane-Vaqui\'e key polynomials. This is a continuation of the work started in a paper by Decaup, Mahboub and Spivakovsky, where it is proved…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

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…

We introduce a new method of constructing complete sequences of key polynomials for simple extensions of tame fields. In our approach the key polynomials are taken to be the minimal polynomials over the base field of suitably constructed…

Non-archimedean fields with restricted analytic functions may not support a full exponential function, but they always have partial exponentials defined in convex subrings. On face of this, we study the first order theory of the class of…

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

We derive a lower and an upper bound for the rank of the finite part of operator $K$-theory groups of maximal and reduced $C^*$-algebras of finitely generated groups. The lower bound is based on the amount of polynomially growing conjugacy…

In this paper, we present some explicit exponents in the estimates for the volumes of sub-level sets of polynomials on bounded sets, and applications to the decay of oscillatory integrals and the convergent of singular integrals.

We study the set of algebraic objects known as vanishing polynomials (the set of polynomials that annihilate all elements of a ring) over general commutative rings with identity. These objects are of special interest due to their close…

We present a hierarchy of tractable relaxations to obtain lower bounds on the minimum value of a polynomial over a constraint set defined by polynomial equations. In contrast to previous convex relaxation techniques for this problem, our…

There is a space of vector-valued nonsymmetric Jack polynomials associated with any irreducible representation of a symmetric group. Singular polynomials for the smallest singular values are constructed in terms of the Jack polynomials. The…

This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…