On the distance from a rational power to the nearest integer

We prove that for any non-zero real number ξ the sequence of fractional parts {ξ(3/2)ⁿ}, n=1,2,3,…, contains at least one limit point in the interval [0.238117…,0.761882…] of length 0.523764…. More generally, it is shown that every sequence of distances to the nearest integer ||ξ(p/q)ⁿ||, n=1,2,3,…, where p/q>1 is a rational number, has both ‘large’ and ‘small’ limit points. All obtained constants are explicitly expressed in terms of p and q. They are also expressible in terms of the Thue-Morse sequence and, for irrational ξ, are best possible for every pair p>1, q=1. Furthermore, we strengthen a classical result of Pisot and Vijayaraghavan by giving similar effective results for any sequence ||ξαⁿ||, n=1,2,3,…, where α>1 is an algebraic number and where ξ≠0 is an arbitrary real number satisfying ξ∉Q(α) in case α is a Pisot or a Salem number.     

Using Lagrangians of hypergraphs to find non-jumping numbers(II)

Let r?2 be an integer. A real number α∈[0,1) is a jump for r if for any ε>0 and any integer m?r, any r-uniform graph with n>n₀(ε,m) vertices and density at least α+ε contains a subgraph with m vertices and density at least α+c, where c=c(α)>0 does not depend on ε and m. A result of Erd?s, Stone and Simonovits implies that every α∈[0,1) is a jump for r=2. Erd?s asked whether the same is true for r?3. Frankl and Rödl gave a negative answer by showing an infinite sequence of non-jumping numbers for every r?3. However, there are a lot of unknowns on determining whether or not a number is a jump for r?3. In this paper, we find two infinite sequences of non-jumping numbers for r=4, and extend one of the results to every r?4. Our approach is still based on the approach developed by Frankl and Rödl.     

On the Littlewood cyclotomic polynomials

In this article, we study the cyclotomic polynomials of degree N−1 with coefficients restricted to the set {+1,−1}. By a cyclotomic polynomial we mean any monic polynomial with integer coefficients and all roots of modulus 1. By a careful analysis of the effect of Graeffe's root squaring algorithm on cyclotomic polynomials, P. Borwein and K.K. Choi gave a complete characterization of all cyclotomic polynomials with odd coefficients. They also proved that a polynomial p(x) with coefficients ±1 of even degree N−1 is cyclotomic if and only if p(x)=±Φp₁(±x)Φp₂(±xp₁)?Φpr(±xp₁p₂?pr−1), where N=p₁p₂?pr and the pi are primes, not necessarily distinct. Here is the pth cyclotomic polynomial. Based on substantial computation, they also conjectured that this characterization also holds for polynomials of odd degree with ±1 coefficients. We consider the conjecture for odd degree here. Using Ramanujan's sums, we solve the problem for some special cases. We prove that the conjecture is true for polynomials of degree α²pβ−1 with odd prime p or separable polynomials of any odd degree.     

On subword decomposition and balanced polynomials

Let H(x) be a monic polynomial over a finite field F=GF(q). Denote by Na(n) the number of coefficients in Hn which are equal to an element a∈F, and by G the set of elements a∈F^× such that Na(n)>0 for some n. We study the relationship between the numbers (Na(n))_a∈G and the patterns in the base q representation of n. This enables us to prove that for “most” n's we have Na(n)≈Nb(n), a,b∈G. Considering the case H=x+1, we provide new results on Pascal's triangle modulo a prime. We also provide analogous results for the triangle of Stirling numbers of the first kind.     

The algebraic structure of the set of solutions to the Thue equation

Let Fn be a binary form with integral coefficients of degree n?2, let d denote the greatest common divisor of all non-zero coefficients of Fn, and let h?2 be an integer. We prove that if d=1 then the Thue equation (T) Fn(x,y)=h has relatively few solutions: if A is a subset of the set T(Fn,h) of all solutions to (T), with r:=card(A)?n+1, then

(#)

h divides the numberΔ(A):=_∏1?k<l?rδ(ξk,ξl),

where ξk=〈xk,yk〉∈A, 1?k?r, and δ(ξk,ξl)=xkyl−xlyk. As a corollary we obtain that if h is a prime number then, under weak assumptions on Fn, there is a partition of T(Fn,h) into at most n subsets maximal with respect to condition (#).     

The inverse of a matrix polynomial

An explicit representation is obtained for P(z)^?1 when P(z) is a complex n×n matrix polynomial in z whose coefficient of the highest power of z is the identity matrix. The representation is a sum of terms involving negative powers of z?λ for each λ such that P(λ) is singular. The coefficients of these terms are generated by sequences u_k, v_k of 1×n and n×1 vectors, respectively, which satisfy u₁≠0, v₁≠0, ∑^k?1_h=0(1?h!)u_k?hP^(h)(λ)=0, ∑^k?1_h=0(1?h!)P^(h)(λ)v_k?h=0, and certain orthogonality relations. In more general cases, including that when P(z) is analytic at λ but not necessarily a polynomial, the terms in the representation involving negative powers of z?λ provide the principal part of the Laurent expansion for P(z)^?1 in a punctured neighborhood of z=λ.     

A numerical algorithm for solving a nonstationary problem of optimal control

Let {φ _n ^(α,β) (z)} _n=0 ^∞ be a system of Jacobi polynomials orthonormal on the circle |z| = 1 with respect to the weight (1 ? cos τ)^α+1/2(1 + cos τ)^β+1/2 (α, β > ?1), and let \(\psi _n^{\left( {\alpha ,\beta } \right)*} \left( z \right): = z^n \overline {\psi _n^{\left( {\alpha ,\beta } \right)} \left( {{1 \mathord{\left/ {\vphantom {1 {\bar z}}} \right. \kern-\nulldelimiterspace} {\bar z}}} \right)}\)). We establish relations between the polynomial φ _n ^(α,?1/2) (z) and the nth (C, α ? 1/2)-mean of the Maclaurin series for the function (1 ? z)^?α?3/2 and also between the polynomial φ _n ^(α,?1/2)* (z) and the nth (C, α + 1/2)-mean of the Maclaurin series for the function (1 ? z)^?α?1/2. We use these relations to derive an asymptotic formula for φ _n ^(α,?1/2) (z); the formula is uniform inside the disk |z| < 1. It follows that φ _n ^(α,?1/2) (z) ≠ 0 in the disk |z| ≤ ρ for fixed φ ∈ (0, 1) and α > ?1 if n is sufficiently large.     

Extensions of some polynomial inequalities to the polar derivative

Let p(z) be a polynomial of degree n and for any real or complex number α, let Dαp(z)=np(z)+(α−z)p^′(z) denote the polar derivative of the polynomial p(z) with respect to α. In this paper, we obtain inequalities for the polar derivative of a polynomial having all its zeros inside or outside a circle. Our results shall generalize and sharpen some well-known polynomial inequalities.     

A sufficient condition for a polynomial to be stable

A real polynomial is called Hurwitz (stable) if all its zeros have negative real parts. For a given n∈N we find the smallest possible constant dn>0 such that if the coefficients of F(z)=a₀+a₁z+?+anzn are positive and satisfy the inequalities akak+1>dnak−1ak+2 for k=1,2,…,n−2, then F(z) is Hurwitz.     

An algebraic structure for Faber polynomials

Let Σ be the set of functions, convergent for all |z|>1, with a Laurent series of the form f(z)=z+∑_n?0a_nz^-n. In this paper, we prove that the set of Faber polynomial sequences over Σ and the set of their normalized kth derivative sequences form groups which are isomorphic to the hitting time subgroup and the Bell^(k) subgroup of the Riordan group, respectively. Further, a relationship between such Faber polynomial sequences and Lucas and Sheffer polynomial sequences is derived.     

The zeros of a quadratic form at square-free points

Let F(x₁,…,xn) be a nonsingular indefinite quadratic form, n=3 or 4. For n=4, suppose the determinant of F is a square. Results are obtained on the number of solutions of

F(x₁,…,xn)=0     

Two results on homogeneous Hessian nilpotent polynomials

Let z=(z₁,…,z_n) and , the Laplace operator. A formal power series P(z) is said to be Hessian Nilpotent (HN) if its Hessian matrix is nilpotent. In recent developments in [M. de Bondt, A. van den Essen, A reduction of the Jacobian conjecture to the symmetric case, Proc. Amer. Math. Soc. 133 (8) (2005) 2201-2205. [MR2138860]; G. Meng, Legendre transform, Hessian conjecture and tree formula, Appl. Math. Lett. 19 (6) (2006) 503-510. [MR2170971]. See also math-ph/0308035; W. Zhao, Hessian nilpotent polynomials and the Jacobian conjecture, Trans. Amer. Math. Soc. 359 (2007) 249-274. [MR2247890]. See also math.CV/0409534], the Jacobian conjecture has been reduced to the following so-called vanishing conjecture (VC) of HN polynomials: for any homogeneous HN polynomialP(z) (of degreed=4), we haveΔ^mP^m+1(z)=0for anym?0. In this paper, we first show that the VC holds for any homogeneous HN polynomial P(z) provided that the projective subvarieties Z_P and Z_σ2 of CPⁿ⁻¹ determined by the principal ideals generated by P(z) and , respectively, intersect only at regular points of Z_P. Consequently, the Jacobian conjecture holds for the symmetric polynomial maps F=z−∇P with P(z) HN if F has no non-zero fixed point w∈Cⁿ with . Secondly, we show that the VC holds for a HN formal power series P(z) if and only if, for any polynomial f(z), Δ^m(f(z)P(z)^m)=0 when m?0.     

A complete determination of Rabinowitsch polynomials

Let m be a positive integer and fm(x) be a polynomial of the form fm(x)=x²+x−m. We call a polynomial fm(x) a Rabinowitsch polynomial if for and consecutive integers x=x₀,x₀+1,…,x₀+s−1, |fm(x)| is either 1 or prime. In this paper, we show that there are exactly 14 Rabinowitsch polynomials fm(x).     

Meromorphic Solutions for a Class of Differential Equations and Their Applications

In this note, we study the admissible meromorphic solutions for algebraic differential equation fⁿf' + P_n?1(f) = R(z)e^α(z), where P_n?1(f) is a differential polynomial in f of degree ≤ n ? 1 with small function coefficients, R is a non-vanishing small function of f, and α is an entire function. We show that this equation does not possess any meromorphic solution f(z) satisfying N(r, f) = S(r, f) unless P_n?1(f) ≡ 0. Using this result, we generalize a well-known result by Hayman.     

On rational approximation of algebraic functions

We construct a new scheme of approximation of any multivalued algebraic function f(z) by a sequence {r_n(z)}_n∈N of rational functions. The latter sequence is generated by a recurrence relation which is completely determined by the algebraic equation satisfied by f(z). Compared to the usual Padé approximation our scheme has a number of advantages, such as simple computational procedures that allow us to prove natural analogs of the Padé Conjecture and Nuttall's Conjecture for the sequence {r_n(z)}_n∈N in the complement CP¹?D_f, where D_f is the union of a finite number of segments of real algebraic curves and finitely many isolated points. In particular, our construction makes it possible to control the behavior of spurious poles and to describe the asymptotic ratio distribution of the family {r_n(z)}_n∈N. As an application we settle the so-called 3-conjecture of Egecioglu et al. dealing with a 4-term recursion related to a polynomial Riemann Hypothesis.     

On the radii of convexity and starlikeness for some special classes of analytic functions in a disk

We introduce the class O _α, 0≤α≤1, of functions w=?(z), ?(0)=0, ?′(0)=0,..., ? ₍₀₎ ^(n?1) =0, f ⁽ⁿ⁾(0)=(n-l)! analytic in the disk |z|<1 and satisfying the condition $$\operatorname{Re} \left( {\frac{{1 - 2z^n \cos \Theta + z^{2n} }}{{z^{n - 1} }}f'(z)} \right) > \alpha , 0 \leqslant \Theta \leqslant \pi , n = 1,2,3,... .$$ We establish the radius of convexity in the class Oα and the radius of starlikeness in the class Uα of functions σ(z)=z?′(z), ?(z)?O _α.     

Generalized radix representations and dynamical systems. IV

For r = (r₁,…, r_d) ∈ ?^d the mapping τ_r:?^d →?^d given byτ_r(a₁,…,a_d) = (a₂, …, a_d,−⌊r₁a₁+…+ r_da_d⌋)where ⌊·⌋ denotes the floor function, is called a shift radix system if for each a ∈ ?^d there exists an integer k > 0 with τ_r^k(a) = 0. As shown in Part I of this series of papers, shift radix systems are intimately related to certain well-known notions of number systems like β-expansibns and canonical number systems. After characterization results on shift radix systems in Part II of this series of papers and the thorough investigation of the relations between shift radix systems and canonical number systems in Part III, the present part is devoted to further structural relationships between shift radix systems and β-expansions. In particular we establish the distribution of Pisot polynomials with and without the finiteness property (F).     

Reciprocal relations between cyclotomic fields

We describe a reciprocity relation between the prime ideal factorization, and related properties, of certain cyclotomic integers of the type ?n(c−ζm) in the cyclotomic field of the m-th roots of unity and that of the symmetrical elements ?m(c−ζn) in the cyclotomic field of the n-th roots. Here m and n are two positive integers, ?n is the n-th cyclotomic polynomial, ζm a primitive m-th root of unity, and c a rational integer. In particular, one of these integers is a prime element in one cyclotomic field if and only if its symmetrical counterpart is prime in the other cyclotomic field. More properties are also established for the special class of pairs of cyclotomic integers q(1−ζp)−1 and p(1−ζq)−1, where p and q are prime numbers.     

Effective Fast Algorithms for Polynomial Spectral Factorization

Let p(z) be a polynomial of degree n having zeros |ξ₁|≤???≤|ξ _m |<1<|ξ _m+1|≤???≤|ξ _n |. This paper is concerned with the problem of efficiently computing the coefficients of the factors u(z)=∏ _i=1 ^m (z?ξ _i ) and l(z)=∏ _i=m+1 ⁿ (z?ξ _i ) of p(z) such that a(z)=z ^?m p(z)=(z ^?m u(z))l(z) is the spectral factorization of a(z). To perform this task the following two-stage approach is considered: first we approximate the central coefficients x _?n+1,. . .x _n?1 of the Laurent series x(z)=∑ _i=?∞ ^+∞ x _i z ⁱ satisfying x(z)a(z)=1; then we determine the entries in the first column and in the first row of the inverse of the Toeplitz matrix T=(x _i?j ) _i,j=?n+1,n?1 which provide the sought coefficients of u(z) and l(z). Two different algorithms are analyzed for the reciprocation of Laurent polynomials. One algorithm makes use of Graeffe's iteration which is quadratically convergent. Differently, the second algorithm directly employs evaluation/interpolation techniques at the roots of 1 and it is linearly convergent only. Algorithmic issues and numerical experiments are discussed.     

Partitions of natural numbers with the same representation functions

For a set A of nonnegative integers the representation functions R₂(A,n), R₃(A,n) are defined as the number of solutions of the equation n=a+a^′,a,a^′∈A with a<a^′, a?a^′, respectively. Let D(0)=0 and let D(a) denote the number of ones in the binary representation of a. Let A₀ be the set of all nonnegative integers a with even D(a) and A₁ be the set of all nonnegative integers a with odd D(a). In this paper we show that (a) if R₂(A,n)=R₂(N?A,n) for all n?2N−1, then R₂(A,n)=R₂(N?A,n)?1 for all n?12N²−10N−2 except for A=A₀ or A=A₁; (b) if R₃(A,n)=R₃(N?A,n) for all n?2N−1, then R₃(A,n)=R₃(N?A,n)?1 for all n?12N²+2N. Several problems are posed in this paper.