Related papers: Detecting bifurcation values at infinity of real p…

We answer to a problem raised by recent work of Jelonek and Kurdyka: how can one detect by rational arcs the bifurcation locus of a polynomial map $\bR^n\to\bR^p$ in case $p>1$. We describe an effective estimation of the "nontrivial" part…

We show that the variation of the topology at infinity of a two-variable polynomial function is localisable at a finite number of "atypical points" at infinity. We construct an effective algorithm with low complexity in order to detect…

We study the bifurcation values of real polynomial maps $f: \bR^{2n} \to \bR^2$ which reflect the lack of asymptotic regularity at infinity. We formulate real counterparts of some structure results which have been previously proved in case…

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

In this paper, we determine the bifurcation set of a real polynomial function of two variables for non-degenerate case in the sense of Newton polygons by using a toric compactification. We also count the number of singular phenomena at…

A polynomial $f$ of degree $d$ and coefficients in an algebraically closed field $k$ defines a morphism $f:\mathbb{P}^1_k\longrightarrow\mathbb{P}^1_k$ which, if char$(k)\nmid d$, is unramified outside a finite set of points in the image:…

We give a new algorithmic method of detection of atypical values for 2-variables real polynomial functions with emphasis on the effectivity.

An algorithm for computing the limit of a quotient of bivariate real analytic functions has been developed by one of the authors in (Limits of quotients of bivariate real analytic functions, Journal of Symbolic Computation, 50, 2013, 197…

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

An algorithm is presented here, for discovering Hopf-Bifurcation varieties of polynomial dynamical systems. It is based on the expression of specific polynomials, as sums of products of first degree polynomials, with parametrical…

We analyze, mainly using bifurcation methods, an elliptic superlinear problem in one-dimension with periodic boundary conditions. One of the main novelties is that we follow for the first time a bifurcation approach, relying on a…

We construct new examples of cubic polynomials with a parabolic fixed point that cannot be approximated by Misiurewicz polynomials. In particular, such parameters admit maximal bifurcations, but do not belong to the support of the…

An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…

We show that the number of bifurcation points at infinity of a polynomial function f : C2 -> C is at most the number of branches at infinity of a generic fiber of f and that this upper bound can be diminished by one in certain cases.

Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…

We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…

We develop numerical algorithms to approximate positive solutions of elliptic boundary value problems with superlinear subcritical nonlinearity on the boundary of the form $-\Delta u + u = 0$ in $\Omega$ with $\frac{\partial u}{\partial…

This survey paper discusses five equivalent ways of defining a ``critical point at infinity'' for a complex polynomial of two variables.

We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.

The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…