Related papers: The Newton Procedure for several variables
A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally):…
Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…
We extend to several variables an earlier result of ours, according to which an entire function of one variable of sufficiently small exponential type, having all derivatives of even order taking integer values at two points, is a…
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…
In this paper we compute the Weierstrass order-sequence associated with a certain linear series on the Deligne-Lusztig curve of Ree type. As a result, we determine that the set of Weierstrass points of this linear series consists entirely…
There are several examples of spaces of univariate functions for which we have a characterization of all sets of knots which are poised for the interpolation problem. For the standard spaces of univariate polynomials, or spline functions…
We consider the structure of rational points on elliptic curves in Weierstrass form. Let x(P)=A_P/B_P^2 denote the $x$-coordinate of the rational point P then we consider when B_P can be a prime power. Using Faltings' Theorem we show that…
The purpose of this paper is to study some properties of the Newton maps associated to real quintic polynomials. First using the Tschirnhaus transformation, we reduce the study of Newton's method for general quintic polynomials to the case…
We prove that twisted versions of Schubert polynomials defined by $\widetilde{\mathfrak S}_{w_0} = x_1^{n-1}x_2^{n-2} \cdots x_{n-1}$ and $\widetilde{\mathfrak S}_{ws_i} = (s_i+\partial_i)\widetilde{\mathfrak S}_w$ are monomial positive and…
We studies the Newton polygon for the L-function of toric exponential sums attached to a family of two variable generalized hyperkloosterman sum,$f_{t}(x,y)=x^{n}+y+\frac{t}{xy}$ with $t$ the parameter. The explicit Newton polygon is…
Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…
We study the weighted multilinear polynomial averages in finite fields. The essential ingredient is the $u^s$-norm control of the corresponding weighted multilinear polynomial averages in finite fields, which is motivated by Ter\"av\"ainen…
A theorem of Kushnirenko and Bernstein shows that the number of isolated roots of a system of polynomials in a torus is bounded above by the mixed volume of the Newton polytopes of the given polynomials, and this upper bound is generically…
We use the method of the Weingarten functions to evaluate SU(N) integrals of the polynomial type. As an application we calculate various one-link integrals for lattice gauge and spin SU(N) theories.
We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with…
The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…
A time-dependent monic polynomial in the z variable with N distinct roots such that exactly one root has multiplicity m>=2 is considered. For k=1,2, the k-th derivatives of the N roots are expressed in terms of the derivatives of order j<=…
This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.
We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…
We start with a random polynomial $P^{N}(z)$ of degree $N$ with independent coefficients. We then consider a new polynomial $P_{t}^{N}$ obtained by $\lceil Nt\rceil$ applications of a fractional differential operator of the form $z^{a}…