Related papers: Behaviour of Newton Polygon over polynomial compos…
We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…
We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…
Given a polynomial matrix P(x) of grade g and a rational function $x(y) = n(y)/d(y)$, where $n(y)$ and $d(y)$ are coprime nonzero scalar polynomials, the polynomial matrix $Q(y) :=[d(y)]^gP(x(y))$ is defined. The complete eigenstructures of…
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…
To study a Dirichlet polynomial $f(s)=\frac{a_{m}}{m^{s}}+\cdots +\frac{a_{n}}{n^{s}}$ by regarding it as a multivariate polynomial via the canonical map $\phi$ sending $p_i^{-s}$ to an indeterminate $X_i$, with $p_i$ the $i$th prime…
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…
Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…
By viewing the regular $N$-gon as the set of $N$th roots of unity in the complex plane we transform several questions regarding polygon diagonals into when a polynomial vanishes when evaluated at roots of unity. To study these solutions we…
In this paper, we study multiplicative dependence of values of polynomials or rational functions over a number field. As an application, we obtain new results on multiplicative dependence in the orbits of a univariate polynomial dynamical…
In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials
Let $(P_n)_n$ and $(Q_n)_n$ be two sequences of monic polynomials linked by a type structure relation such as $$ Q_{n}(x)+r_nQ_{n-1}(x)=P_{n}(x)+s_nP_{n-1}(x)+t_nP_{n-2}(x)\;, $$ where $(r_n)_n$, $(s_n)_n$ and $(t_n)_n$ are sequences of…
We propose a solitonic dynamical system over finite fields that may be regarded as an analogue of the box-ball systems. The one-soliton solutions of the system, which have nested structures similar to fractals, are also proved. The…
We consider polynomially and rationally parameterized curves, where the polynomials in the parameterization have fixed supports and generic coefficients. We apply sparse (or toric) elimination theory in order to determine the vertex…
Let p be a prime and let F_pbar be the algebraic closure of the finite field of p elements. Let f(x) be any one variable rational function over F_pbar with n poles of orders d_1, ...,d_n. Suppose p is coprime to d_i for every i. We prove…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
This work is dedicated to the results were got in the model theory of the regular polygons. We give the characterization of the monoids with axiomatizable and model complete class of regular polygons. We describe the monoids with complete…
We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…
Iterating Newton's method symbolically for the general quadratic yields a rational function, the numerator and denominator of which are polynomials with highly composite coefficients.
The change of conformal moduli of polygonal quadrilaterals under some geometric transformations is studied. We consider the motion of one vertex when the other vertices remain fixed, the rotation of sides, polarization, symmetrization, and…