Many-Sheeted Versions of the Pólya–Bernstein and Borel Theorems for Entire Functions of Order ρ ≠ 1 and Their Applications

The Puiseux series generated by the power function z = w^1/ρ, where ρ > 0,ρ ≠ 1, is considered. A version of the Pólya–Bernstein theorem for an entire function of order ρ ≠ 1 and normal type is proposed and applied to describe the domain of analytic continuation of this series. The domain of summability of a “regular” Puiseux series is found (this is a many-sheeted “Borel polygon”); in the case ρ = 1, the “one-sheeted” result of Borel is substantially extended. These results make it possible to describe domains of analytic continuation of the Puiseux expansions of popular many-sheeted functions (such as inverses of rational functions).     

Resolution of singularities of convolutions with the Gaussian kernel

We present a complete classification of the zero set of a function which is a convolution with the Gaussian kernel. In the first part, we calculate the Taylor expansion of the convolution in a critical point. In the second part, we resolve the singularity with the help of the general Newton process which yields the Puiseux expansions for the solutions. Finally, we describe the resolved singularity in terms of Hermite polynomials.

     

Irreducibility testing over local fields

The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in , the ring of polynomials with coefficients from the field of Laurent series in with rational coefficients. This is achieved by computing certain associated Puiseux expansions, and as a result, a polynomial-time complexity bound for the number of bit operations required to perform this irreducibility test is computed.

     

The 16th Hilbert problem on algebraic limit cycles

For real planar polynomial differential systems there appeared a simple version of the 16th Hilbert problem on algebraic limit cycles: Is there an upper bound on the number of algebraic limit cycles of all polynomial vector fields of degree m? In [J. Llibre, R. Ramírez, N. Sadovskaia, On the 16th Hilbert problem for algebraic limit cycles, J. Differential Equations 248 (2010) 1401-1409] Llibre, Ramírez and Sadovskaia solved the problem, providing an exact upper bound, in the case of invariant algebraic curves generic for the vector fields, and they posed the following conjecture: Is1+(m−1)(m−2)/2the maximal number of algebraic limit cycles that a polynomial vector field of degree m can have?In this paper we will prove this conjecture for planar polynomial vector fields having only nodal invariant algebraic curves. This result includes the Llibre et al.?s as a special one. For the polynomial vector fields having only non-dicritical invariant algebraic curves we answer the simple version of the 16th Hilbert problem.     

Polynomial operators and local smoothness classes on the unit interval

We obtain a characterization of local Besov spaces of functions on [-1,1] in terms of algebraic polynomial operators. These operators are constructed using the coefficients in the orthogonal polynomial expansions of the functions involved. The example of Jacobi polynomials is studied in further detail. A by-product of our proofs is an apparently simple proof of the fact that the Cesàro means of a sufficiently high integer order of the Jacobi expansion of a continuous function are uniformly bounded.     

Limits of Puiseux Expansions and Parametric Deformations of Plane Curve Singularities

We consider a family of parametrizations of unibranched plane curve singularities. Each member of the family can be expressed via the Puiseux expansion. Studying the limits of suitably renormalized coefficients of the Puiseux expansions, we obtain in some cases obstructions for a possible adjacency of unibranched plane curve singularities.

Furthermore, we show that the coefficients of the Puiseux expansion are not generic (in a precisely defined sense) as functions of the coefficients of parametrization of the singularity.     

On the distribution of the coefficients of normal forms for Frobenius expansions

Frobenius expansions are representations of integers to an algebraic base which are sometimes useful for efficient (hyper)elliptic curve cryptography. The normal form of a Frobenius expansion is the polynomial with integer coefficients obtained by reducing a Frobenius expansion modulo the characteristic polynomial of Frobenius. We consider the distribution of the coefficients of reductions of Frobenius expansions and non-adjacent forms of Frobenius expansions (NAFs) to normal form. We give asymptotic bounds on the coefficients which improve on naive bounds, for both genus one and genus two. We also discuss the non-uniformity of the distribution of the coefficients (assuming a uniform distribution for Frobenius expansions).     

Laplace's method on a computer algebra system with an application to the real valued modified Bessel functions

We examine a Maple implementation of two distinct approaches to Laplace's method used to obtain asymptotic expansions of Laplace-type integrals. One algorithm uses power series reversion, whereas the other expands all quantities in Taylor or Puiseux series. These algorithms are used to derive asymptotic expansions for the real valued modified Bessel functions of pure imaginary order and real argument that mimic the well-known corresponding expansions for the unmodified Bessel functions.     

A counterexample to the ``composition conjecture"

In this note we construct a class of counterexamples to the ``composition conjecture" concerning an infinitesimal version of the center problem for the polynomial Abel equation in the complex domain.

     

A Systematic “Saddle Point Near a Pole” Asymptotic Method with Application to the Gauss Hypergeometric Function

In recent works [ 1 ] and [ 2 ], we have proposed more systematic versions of the Laplace’s and saddle point methods for asymptotic expansions of integrals. Those variants of the standard methods avoid the classical change of variables and give closed algebraic formulas for the coefficients of the expansions. In this work we apply the ideas introduced in [ 1 ] and [ 2 ] to the uniform method “saddle point near a pole.” We obtain a computationally more systematic version of that uniform asymptotic method for integrals having a saddle point near a pole that, in many interesting examples, gives a closed algebraic formula for the coefficients. The asymptotic sequence is given, in general, in terms of exponential integrals of fractional order (or incomplete gamma functions). In particular, when the order of the saddle point is two, the basic approximant is given in terms of the error function (as in the standard method). As an application, we obtain new asymptotic expansions of the Gauss Hypergeometric function ₂F₁(a, b, c; z) for large b and c with c > b + 1 .     

An application of algebraic sieve theory

Let K be a fixed totally real algebraic number field of finite degree over the rationals. The theme of this paper is the problem about the occurrence of algebraic almost-primes in a polynomial sequence generated by an irreducible polynomial of K with prime arguments. The method is based on a weighted upper and lower linear Selberg-type sieve in K and makes use of a multidimensional algebraic version of Bombieris theorem on primes in arithmetic progressions.     

Computer Algebra and Bifurcations

In this paper we will present the family of Newton algorithms. From the computer algebra point of view, the most basic of them is well known for the local analysis of plane algebraic curves f(x,y)=0 and consists in expanding y as Puiseux series in the variable x. A similar algorithm has been developped for multi-variate algebraic equations and for linear differential equations, using the same basic tools: a “regular” case, associated with a “simple” class of solutions, and a “simple” method of calculus of these solutions; a Newton polygon; changes of variable of type ramification; changes of unknown function of two types y=ct ^μ+? or y=exp?(c/t ^μ)?. Our purpose is first to define a “regular” case for nonlinear implicit differential equations f(t,y,y′)=0. We will then apply the result to an explicit differential equation with a parameter y′=f(y,α) in order to make a link between the expansions of the solutions obtained by our local analysis and the classical theory of bifurcations.     

On the resolution of relative Thue equations

An efficient algorithm is given for the resolution of relative Thue equations. The essential improvement is the application of an appropriate version of Wildanger's enumeration procedure based on the ellipsoid method of Fincke and Pohst.

Recently relative Thue equations have gained an important application, e.g., in computing power integral bases in algebraic number fields. The presented methods can surely be used to speed up those algorithms.

The method is illustrated by numerical examples.

     

Some Applications of a Bombieri-Type Theoremin Totally Real Number Fields

 The primary concern of this paper is to present three further applications of a multi-dimensional version of Bombieri’s theorem on primes in arithmetic progressions in the setting of a totally real algebraic number field K. First, we deal with the order of magnitude of a greatest (relative to its norm) prime ideal factor of , where the product runs over prime arguments ω of a given irreducible polynomial F which lie in a certain lattice point region. Then, we turn our attention to the problem about the occurrence of algebraic primes in a polynomial sequence generated by an irreducible polynomial of K with prime arguments. Finally, we give further contributions to the binary Goldbach problem in K.     

On expansion of algebraic functions in power and Puiseux series, I

We present algorithms that (a) reduce an algebraic equation, defining an algebraic function, to a Fuchsian differential equation that this function satisfies; and (b) compute coefficients in the expansions of solutions of linear differential equations in the neighborhood of regular singularities via explicit linear recurrences. This allows us to compute the Nth coefficient (or N coefficients) of an algebraic function of degree d in O(dN) operations with O(d) storage (or O(dN) storage).     

Asymptotic behaviour of families of real curves

We consider the family of fibres of a polynomial function f on a smooth noncompact algebraic real surface and we characterise the regular fibres of f which are atypical due to their asymptotic behaviour at infinity. We compare to the similar problem in the complex case. Received: 5 May 1998 / Revised version: 20 March 1999     

Some Applications of a Bombieri-Type Theoremin Totally Real Number Fields

 The primary concern of this paper is to present three further applications of a multi-dimensional version of Bombieri’s theorem on primes in arithmetic progressions in the setting of a totally real algebraic number field K. First, we deal with the order of magnitude of a greatest (relative to its norm) prime ideal factor of , where the product runs over prime arguments ω of a given irreducible polynomial F which lie in a certain lattice point region. Then, we turn our attention to the problem about the occurrence of algebraic primes in a polynomial sequence generated by an irreducible polynomial of K with prime arguments. Finally, we give further contributions to the binary Goldbach problem in K. (Received 11 January 2000; in revised form 4 December 2000)     

The principal axis theorem for holomorphic functions

An algebraic approach to Rellich's theorem is given which states that any analytic family of matrices which is normal on the real axis can be diagonalized by an analytic family of matrices which is unitary on the real axis. We show that this result is a special version of a purely algebraic theorem on the diagonalization of matrices over fields with henselian valuations.

     

A theorem on iterations of polynomial maps in several variables

We establish a polynomial version of a theorem obtained by Enflo, Gurarii, Lomonosov and Lyubich for linear operators. As a consequence, we also derive a polynomial version of a result due to Pták.

     

A two‐grid SA‐AMG convergence bound that improves when increasing the polynomial degree

In this paper, we consider the convergence rate of a smoothed aggregation algebraic multigrid method, which uses a simple polynomial (1 ? t)^ν or an optimal Chebyshev‐like polynomial to construct the smoother and prolongation operator. The result is purely algebraic, whereas a required main weak approximation property of the tentative interpolation operator is verified for a spectral element agglomeration version of the method. More specifically, we prove that, for partial differential equations (PDEs), the two‐grid method converges uniformly without any regularity assumptions. Moreover, the convergence rate improves uniformly when the degree of the polynomials used for the smoother and the prolongation increases. Such a result, as is well‐known, would imply uniform convergence of the multilevel W‐cycle version of the algorithm. Numerical results, for both PDE and non‐PDE (graph Laplacian) problems are presented to illustrate the theoretical findings. Published 2016. This article is a U.S. Government work and is in the public domain in the USA.