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 polynomial digraphs

Let Φ(x,y) be a bivariate polynomial with complex coefficients. The zeroes of Φ(x,y) are given a combinatorial structure by considering them as arcs of a directed graph G(Φ). This paper studies some relationship between the polynomial Φ(x,y) and the structure of G(Φ).     

Flat cyclotomic polynomials of order three

We say that a cyclotomic polynomial Φn has order three if n is the product of three distinct primes, p<q<r. Let A(n) be the largest absolute value of a coefficient of Φn. For each pair of primes p<q, we give an infinite family of r such that A(pqr)=1. We also prove that A(pqr)=A(pqs) whenever s>q is a prime congruent to .     

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.     

A specific family of cyclotomic polynomials of order three

Let A(n) be the largest absolute value of any coefficient of n-th cyclotomic polynomial Φn(x).We say Φn(x) is flat if A(n) = 1.In this paper,for odd primes p q r and 2r ≡ 1(mod pq),we prove that Φpqr(x) is flat if and only if p = 3 and q ≡ 1(mod 3).     

Some irreducibility results for truncated binomial expansions

For positive integers n>k, let be the polynomial obtained by truncating the binomial expansion of n(1+x) at the kth stage. These polynomials arose in the investigation of Schubert calculus in Grassmannians. In this paper, the authors prove the irreducibility of Pn,k(x) over the field of rational numbers when 2≤2k≤n<³(k+1).     

Sums and Differences of Two Cubic Polynomials

 When f(x) is a cubic polynomial with integral coefficients, we show that almost all integers represented as the sum or difference of two values of f(x), with , are thus represented essentially uniquely. (Received 18 January 1999; in revised form 17 May 1999)     

On the Greatest Common Di visor of u − 1 and v − 1 with u and v Near ${\cal S}$- units

In [2], it was shown that if a and b are multiplicatively independent integers and ɛ > 0, then the inequality gcd (aⁿ − 1,bⁿ − 1) < exp(ɛn) holds for all but finitely many positive integers n. Here, we generalize the above result. In particular, we show that if f(x),f₁(x),g(x),g₁(x) are non-zero polynomials with integer coefficients, then for every ɛ > 0, the inequality holds for all but finitely many positive integers n.     

Dirichlet series associated with polynomials and applications

We consider the possibility of the analytic continuation of the Dirichlet series SP;Z(s) associated with a polynomial P(x) and auxiliary series Z(s). In fact, we derive a certain criterion for the analytic continuation for some class of polynomials and give examples such that SP;Z(s) cannot be continued meromorphically to the whole plane C. We also study the asymptotic behaviors of the sum MP(x)=_∑P(n₁,…,nk)?xΛ(n₁)?Λ(nk) considered first by M. Peter. Generalizations of this sum are also considered.     

On the coefficients of ternary cyclotomic polynomials

We study coefficients of ternary cyclotomic polynomials Φ_pqr(z)=∏_ρ(z−ρ), where p, q, and r are distinct odd primes and the product is taken over all primitive pqrth roots of unity ρ.     

On the mean square average of special values of L-functions

Let χ be a Dirichlet character and L(s,χ) be its L-function. Using weighted averages of Gauss and Ramanujan sums, we find exact formulas involving Jordan?s and Euler?s totient function for the mean square average of L(1,χ) when χ ranges over all odd characters modulo k and L(2,χ) when χ ranges over all even characters modulo k. In principle, using our method, it is always possible to find the mean square average of L(r,χ) if χ and r?1 have the same parity and χ ranges over all odd (or even) characters modulo k, though the required calculations become formidable when r?3. Consequently, we see that for almost all odd characters modulo k, |L(1,χ)|<Φ(k), where Φ(x) is any function monotonically tending to infinity.     

On the average orders of the error term in the Dirichlet divisor problem

Let Δ(x) be the error term in the Dirichlet divisor problem. The purpose of this paper is to study the difference between two kinds of mean value formulas of Δ(x), that is, the mean value formulas and ∑_n?xΔ(n)^k with a natural number k. In particular we study the case k=2 and 3 in detail.     

Polynomial Cunningham chains

A sequence of prime numbers p₁,p₂,p₃,…, such that pi=2pi−1+? for all i, is called a Cunningham chain of the first or second kind, depending on whether ?=1 or −1 respectively. If k is the smallest positive integer such that 2pk+? is composite, then we say the chain has length k. It is conjectured that there are infinitely many Cunningham chains of length k for every positive integer k. A sequence of polynomials f₁(x),f₂(x),… in Z[x], such that f₁(x) has positive leading coefficient, each fi(x) is irreducible in Q[x] and fi(x)=xfi−1(x)+? for all i, is defined to be a polynomial Cunningham chain of the first or second kind, depending on whether ?=1 or −1 respectively. If k is the least positive integer such that fk+1(x) is reducible in Q[x], then we say the chain has length k. In this article, for polynomial Cunningham chains of both kinds, we prove that there are infinitely many chains of length k and, unlike the situation in the integers, that there are infinitely many chains of infinite length, by explicitly giving infinitely many polynomials f₁(x), such that fk+1(x) is the only term in the sequence that is reducible.     

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 (#).     

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).     

Spectrally arbitrary ray patterns

An n×n ray pattern A is said to be spectrally arbitrary if for every monic nth degree polynomial f(x) with coefficients from C, there is a matrix in the pattern class of A such that its characteristic polynomial is f(x). In this article the authors extend the nilpotent-Jacobi method for sign patterns to ray patterns, establishing a means to show that an irreducible ray pattern and all its superpatterns are spectrally arbitrary. They use this method to establish that a particular family of n×n irreducible ray patterns with exactly 3n nonzeros is spectrally arbitrary. They then show that every n×n irreducible, spectrally arbitrary ray pattern has at least 3n-1 nonzeros.     

Coefficients of ternary cyclotomic polynomials

It is customary to define a cyclotomic polynomial Φn(x) to be ternary if n is the product of three distinct primes, p<q<r. Let A(n) be the largest absolute value of a coefficient of Φn(x) and M(p) be the maximum of A(pqr). In 1968, Sister Marion Beiter (1968, 1971) [3] and [4] conjectured that . In 2008, Yves Gallot and Pieter Moree (2009) [6] showed that the conjecture is false for every p≥11, and they proposed the Corrected Beiter conjecture: . Here we will give a sufficient condition for the Corrected Beiter conjecture and prove it when p=7.     

A generalization of the Buchstab equation

Letf be a multiplicative function and letΨ _f (x, y) denote the incomplete multiplicative sum Σ _n≤x,P(n)≤y f(n), whereP(n) denotes the greatest prime factor ofn. A Buchstab- and a Hildebrand equation forΨ _f (x, y) are derived.     

On the distribution of sociable numbers

For a positive integer n, define s(n) as the sum of the proper divisors of n. If s(n)>0, define s₂(n)=s(s(n)), and so on for higher iterates. Sociable numbers are those n with sk(n)=n for some k, the least such k being the order of n. Such numbers have been of interest since antiquity, when order-1 sociables (perfect numbers) and order-2 sociables (amicable numbers) were studied. In this paper we make progress towards the conjecture that the sociable numbers have asymptotic density 0. We show that the number of sociable numbers in [1,x], whose cycle contains at most k numbers greater than x, is o(x) for each fixed k. In particular, the number of sociable numbers whose cycle is contained entirely in [1,x] is o(x), as is the number of sociable numbers in [1,x] with order at most k. We also prove that but for a set of sociable numbers of asymptotic density 0, all sociable numbers are contained within the set of odd abundant numbers, which has asymptotic density about 1/500.     

Identification of the unknown diffusion coefficient in a linear parabolic equation by the semigroup approach

In this article, we study the semigroup approach for the mathematical analysis of the inverse coefficient problems of identifying the unknown coefficient k(x) in the linear parabolic equation ut(x,t)=(k(x)uxx(x,t)), with Dirichlet boundary conditions u(0,t)=ψ₀, u(1,t)=ψ₁. Main goal of this study is to investigate the distinguishability of the input-output mappings Φ[⋅]:K→C¹[0,T], Ψ[⋅]:K→C¹[0,T] via semigroup theory. In this paper, we show that if the null space of the semigroup T(t) consists of only zero function, then the input-output mappings Φ[⋅] and Ψ[⋅] have the distinguishability property. Moreover, the values k(0) and k(1) of the unknown diffusion coefficient k(x) at x=0 and x=1, respectively, can be determined explicitly by making use of measured output data (boundary observations) f(t):=k(0)ux(0,t) or/and h(t):=k(1)ux(1,t). In addition to these, the values k^′(0) and k^′(1) of the unknown coefficient k(x) at x=0 and x=1, respectively, are also determined via the input data. Furthermore, it is shown that measured output dataf(t) and h(t) can be determined analytically, by an integral representation. Hence the input-output mappings Φ[⋅]:K→C¹[0,T], Ψ[⋅]:K→C¹[0,T] are given explicitly in terms of the semigroup. Finally by using all these results, we construct the local representations of the unknown coefficient k(x) at the end points x=0 and x=1.