On the Erdös–Lax inequality concerning polynomials

Let $P(z)$ be a polynomial of degree n and for any complex number α, let $D_{\alpha }P(z):=nP(z)+(\alpha ?z)P^{\prime }(z)$ denote the polar derivative of $P(z)$ with respect to α. In this paper, we present an integral inequality for the polar derivative of a polynomial. Our theorem includes as special cases several interesting generalisations and refinements of Erdöx–Lax theorem.     

On q-asymptotics for linear q-difference-differential equations with Fuchsian and irregular singularities

We consider a Cauchy problem for some family of linear q-difference-differential equations with Fuchsian and irregular singularities, that admit a unique formal power series solution in two variables $\stackrel{?}{X}(t,z)$ for given formal power series initial conditions. Under suitable conditions and by the application of certain q-Borel and Laplace transforms (introduced by J.-P. Ramis and C. Zhang), we are able to deal with the small divisors phenomenon caused by the Fuchsian singularity, and to construct actual holomorphic solutions of the Cauchy problem whose q-asymptotic expansion in t, uniformly for z in the compact sets of $\mathbb{C}$, is $\stackrel{?}{X}(t,z)$. The small divisors? effect is an increase in the order of q-exponential growth and the appearance of a power of the factorial in the corresponding q-Gevrey bounds in the asymptotics.     

(Prefix) reversal distance for (signed) strings with few blocks or small alphabets

We study the String Reversal Distance problem, an extension of the well-known Sorting by Reversals problem. String Reversal Distance takes two strings S and T built on an alphabet Σ as input, and asks for a minimum number of reversals to obtain T from S. We consider four variants: String Reversal Distance, String Prefix Reversal Distance (a constrained version of the previous problem, in which any reversal must include the first letter of the string), and the signed variants of these problems, namely Signed String Reversal Distance and Signed String Prefix Reversal Distance. We study algorithmic properties of these four problems, in connection with two parameters of the input strings: the number of blocks they contain (a block being a maximal substring such that all letters in the substring are equal), and the alphabet size $|\mathrm{\Sigma }|$. Concerning the number of blocks, we show that the four problems are fixed-parameter tractable (FPT) when the considered parameter is the maximum number of blocks among the two input strings. Concerning the alphabet size, we first show that String Reversal Distance and String Prefix Reversal Distance are NP-hard even if the input strings are built on a binary alphabet $\mathrm{\Sigma }=\{0,1\}$, each 0-block has length at most two and each 1-block has length one. We also show that Signed String Reversal Distance and Signed String Prefix Reversal Distance are NP-hard even if the input strings have only one letter. Finally, when $|\mathrm{\Sigma }|=O(1)$, we provide a singly-exponential algorithm that computes the exact distance between any pair of strings, for a large family of distances that we call well-formed, which includes the four distances we study here.     

First order theory of cyclically ordered groups

By a result known as Rieger's theorem (1956), there is a one-to-one correspondence, assigning to each cyclically ordered group H a pair $(G,z)$ where G is a totally ordered group and z is an element in the center of G, generating a cofinal subgroup $〈z〉$ of G, and such that the cyclically ordered quotient group $G/〈z〉$ is isomorphic to H. We first establish that, in this correspondence, the first-order theory of the cyclically ordered group H is uniquely determined by the first-order theory of the pair $(G,z)$. Then we prove that the class of cyclically orderable groups is an elementary class and give an axiom system for it. Finally we show that, in contrast to the fact that all theories of totally ordered Abelian groups have the same universal part, there are uncountably many universal theories of Abelian cyclically ordered groups.     

Borel summability of the heat equation with variable coefficients

We prove Borel summability in nonsingular directions of solutions of partial differential equations of the form $u_t=a(z)u_{zz}$ where $a(z)$ is a quartic polynomial and the initial condition is analytic. In the special case $a(z)=z$ we obtain the detailed resurgent structure; even in such a simple case, the structure of the singular manifolds is quite intricate.     

On Ozaki's condition for p-valency

Let f be an analytic function in a convex domain $D?\mathbb{C}$. A well-known theorem of Ozaki states that if f is analytic in D, and is given by $f(z)=z^p+{\sum }_{n=p+1}^{\infty }{a}_n{z}^n$ for $z\in D$, and

$\mathfrak{Re}\{{\mathrm{e}}^{\mathrm{i}\alpha }{f}^{(p)}(z)\}>0,(z\in D),$

for some real α, then f is at most p-valent in D. Ozaki's condition is a generalization of the well-known Noshiro–Warschawski univalence condition. The purpose of this paper is to provide some related sufficient conditions for functions analytic in the unit disk $\mathbb{D}=\{z\in \mathbb{C}:|z|<1\}$ to be p-valent in $\mathbb{D}$, and to give an improvement to Ozaki's sufficient condition for p-valence when $z\in \mathbb{D}$.