Related papers: On truncations of valuations

We associate to any given finite set of valuations on the polynomial ring in two variables over an algebraically closed field a numerical invariant whose positivity characterizes the case when the intersection of their valuation rings has…

Let $K\to L$ be an algebraic field extension and $\nu$ a valuation of $K$. The purpose of this paper is to describe the totality of extensions $\left\{\nu'\right\}$ of $\nu$ to $L$ using a refined version of MacLane's key polynomials. In…

In this article, using key tools including Zhou valuations, Tian functions and a convergence result for relative types, we establish necessary and sufficient conditions for the existence of valuative interpolations on the rings of germs of…

Let $\nu$ 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\'e key polynomials for valuations $\mu\le\nu$ and abstract key polynomials for…

One aspect of Poisson approximation is that the support of the random variable of interest is often finite while the support of the Poisson distribution is not. In this paper we will remedy this by examining truncated negative binomial (of…

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 {\nu} a valuation of K. The original motivation for introducing key polynomials was…

We consider four classes of polynomials over the fields $\mathbb{F}_{q^3}$, $q=p^h$, $p>3$, $f_1(x)=x^{q^2+q-1}+Ax^{q^2-q+1}+Bx$, $f_2(x)=x^{q^2+q-1}+Ax^{q^3-q^2+q}+Bx$, $f_3(x)=x^{q^2+q-1}+Ax^{q^2}-Bx$, $f_4(x)=x^{q^2+q-1}+Ax^{q}-Bx$,…

Let $q=4$ and $k$ a positive integer. In this short note, we present a class of permutation polynomials over $\Bbb F_{q^{3k}}$. We also present a generalization.

We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…

Let $\nu$ be a rank one valuation on $K[x]$ and $\Psi_n$ the set of key polynomials for $\nu$ of degree $n\in\N$. We discuss the concepts of being $\Psi_n$-stable and $(\Psi_n,Q)$-fixed. We discuss when these two concepts coincide. We use…

Learning constraint networks is known to require a number of membership queries exponential in the number of variables. In this paper, we learn constraint networks by asking the user partial queries. That is, we ask the user to classify…

In this paper we use algebraic curves and other algebraic number theory methods to show the validity of a permutation polynomial conjecture regarding $f(X)=X^{q(p-1)+1} +\alpha X^{pq}+X^{q+p-1}$, on finite fields $\mathbb{F}_{q^2}, q=p^k$,…

Let $(K,\nu)$ be an arbitrary-rank valued field, $R_\nu$ its valuation ring, $K(\alpha)/K$ a separable finite field extension generated over $K$ by a root of a monic irreducible polynomial $f\in R_\nu[X]$. We give necessary and sufficient…

We consider the problem of deciding whether a common solution to a multivariate polynomial equation system is isolated or not. We present conditions on a given truncated Puiseux series vector centered at the point ensuring that it is not…

The resolvability of equations in integers containing truncated Newton's binomial, is determined by the divisibility of the binomial by the characteristic parameters of the equation, which most often is the binomial exponent. Two types of…

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

We define a truncated Euler polynomial $E_{m,n}(x)$ as a generalization of the classical Euler polynomial $E_n(x)$. In this paper we give its some properties and relations with the hypergeometric Bernoulli polynomial.

The present paper studies the existence of valuative interpolation on the local ring of an irreducible analytic subvariety at singular points. We firstly develop the concepts and methods of Zhou weights and Tian functions near singular…

Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…

A monic polynomial in F_q[t] of degree n over a finite field F_q of odd characteristic can be written as the sum of two irreducible monic elements in F_q[t] of degrees n and n-1 if q is larger than a bound depending only on n. The main tool…