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.     

Higher-order recurrences for Bernoulli numbers

Euler's well-known nonlinear relation for Bernoulli numbers, which can be written in symbolic notation as n(B₀+B₀)=−nBn−1−(n−1)Bn, is extended to n(Bk₁+?+Bkm) for m?2 and arbitrary fixed integers k₁,…,km?0. In the general case we prove an existence theorem for Euler-type formulas, and for m=3 we obtain explicit expressions. This extends the authors' previous work for m=2.     

On Cauchy's bound for zeros of a polynomial

In this paper we have improved Cauchy's bound for zeros of a polynomialp(z)=z ⁿ+a _n+1 z ^n-1+a _n-2 z ^n-2+......+a ₁ z+a ₀. Our result is best possible and sharpens some other results also.     

The transcendental meromorphic solutions of a certain type of nonlinear differential equations

In this paper, we study the differential equations of the following form w²+R(z)²(w(k))=Q(z), where R(z), Q(z) are nonzero rational functions. We proved the following three conclusions: (1) If either P(z) or Q(z) is a nonconstant polynomial or k is an even integer, then the differential equation w²+P²(z)²(w(k))=Q(z) has no transcendental meromorphic solution; if P(z), Q(z) are constants and k is an odd integer, then the differential equation has only transcendental meromorphic solutions of the form f(z)=acos(bz+c). (2) If either P(z) or Q(z) is a nonconstant polynomial or k>1, then the differential equation w²+(z−z₀)P²(z)²(w(k))=Q(z) has no transcendental meromorphic solution, furthermore the differential equation w²+A(z−z₀)²(w^′)=B, where A, B are nonzero constants, has only transcendental meromorphic solutions of the form , where a, b are constants such that Ab²=1, a²=B. (3) If the differential equation , where P is a nonconstant polynomial and Q is a nonzero rational function, has a transcendental meromorphic solution, then k is an odd integer and Q is a polynomial. Furthermore, if k=1, then Q(z)≡C (constant) and the solution is of the form f(z)=Bcosq(z), where B is a constant such that B²=C and q^′(z)=±P(z).     

Heilbronn's conjecture on Waring's number (mod p)

Let p be a prime k|p−1, t=(p−1)/k and γ(k,p) be the minimal value of s such that every number is a sum of s kth powers . We prove Heilbronn's conjecture that γ(k,p)?k1/2 for t>2. More generally we show that for any positive integer q, γ(k,p)?C(q)k1/q for ?(t)?q. A comparable lower bound is also given. We also establish exact values for γ(k,p) when ?(t)=2. For instance, when t=3, γ(k,p)=a+b−1 where a>b>0 are the unique integers with a²+b²+ab=p, and when t=4, γ(k,p)=a−1 where a>b>0 are the unique integers with a²+b²=p.     

Maximal periods of (Ehrhart) quasi-polynomials

A quasi-polynomial is a function defined of the form q(k)=cd(k)kd+cd−1(k)kd−1+?+c₀(k), where c₀,c₁,…,cd are periodic functions in k∈Z. Prominent examples of quasi-polynomials appear in Ehrhart's theory as integer-point counting functions for rational polytopes, and McMullen gives upper bounds for the periods of the cj(k) for Ehrhart quasi-polynomials. For generic polytopes, McMullen's bounds seem to be sharp, but sometimes smaller periods exist. We prove that the second leading coefficient of an Ehrhart quasi-polynomial always has maximal expected period and present a general theorem that yields maximal periods for the coefficients of certain quasi-polynomials. We present a construction for (Ehrhart) quasi-polynomials that exhibit maximal period behavior and use it to answer a question of Zaslavsky on convolutions of quasi-polynomials.     

A note on acyclic edge coloring of complete bipartite graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (2-colored) cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a^′(G). Let Δ=Δ(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by K_n,n. Alon, McDiarmid and Reed observed that a^′(K_p−1,p−1)=p for every prime p. In this paper we prove that a^′(K_p,p)≤p+2=Δ+2 when p is prime. Basavaraju, Chandran and Kummini proved that a^′(K_n,n)≥n+2=Δ+2 when n is odd, which combined with our result implies that a^′(K_p,p)=p+2=Δ+2 when p is an odd prime. Moreover we show that if we remove any edge from K_p,p, the resulting graph is acyclically Δ+1=p+1-edge-colorable.     

Meromorphic Functions That Share Fixed-Points

In this paper, we prove the following result: Let f(z) and g(z) be two nonconstant meromorphic(entire) functions, n ≥ 11(n ≥ 6) a positive integer. If fⁿ(z)f′(z) and gⁿ(z)g′(z) have the same fixed-points, then either f(z) = c₁e^cz2, g(z) = c₂e^− cz2, where c₁, c₂, and c are three constants satisfying 4(c₁c₂)^n + 1c² = −1, or f(z) ≡ tg(z) for a constant t such that t^n + 1 = 1.     

An inequality for polynomials with a prescribed zero

Let p_n(z)=∑_(k-0)~n a_kz~k be a polynomial of degree n such that |p_n(z)|≤M for |z|≤1. It is well.known that for 0≤u相似文献   

On a polynomial inequality

Let p(z)=a₀+?+anzn and q(z)=b₀+? be polynomials of degree respectively n and less than n such that

     

Value distribution and shared sets of differences of meromorphic functions

We investigate value distribution and uniqueness problems of difference polynomials of meromorphic functions. In particular, we show that for a finite order transcendental meromorphic function f with λ(1/f)<ρ(f) and a non-zero complex constant c, if n?2, then fn(z)f(z+c) assumes every non-zero value a∈C infinitely often. This research also shows that there exist two sets S₁ with 9 (resp. 5) elements and S₂ with 1 element, such that for a finite order nonconstant meromorphic (resp. entire) function f and a non-zero complex constant c, Ef(z)(Sj)=Ef(z+c)(Sj)(j=1,2) imply f(z)≡f(z+c). This gives an answer to a question of Gross concerning a finite order meromorphic function f and its shift.     

Intersective polynomials and the primes

Intersective polynomials are polynomials in Z[x] having roots every modulus. For example, P₁(n)=n² and P₂(n)=n²−1 are intersective polynomials, but P₃(n)=n²+1 is not. The purpose of this note is to deduce, using results of Green and Tao (2006) [8] and Lucier (2006) [16], that for any intersective polynomial h, inside any subset of positive relative density of the primes, we can find distinct primes p₁,p₂ such that p₁−p₂=h(n) for some integer n. Such a conclusion also holds in the Chen primes (where by a Chen prime we mean a prime number p such that p+2 is the product of at most 2 primes).     

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.     

Classification of reflexible regular embeddings and self-Petrie dual regular embeddings of complete bipartite graphs

In this paper, we classify the reflexible regular orientable embeddings and the self-Petrie dual regular orientable embeddings of complete bipartite graphs. The classification shows that for any natural number n, say (p₁,p₂,…,p_k are distinct odd primes and a_i>0 for each i?1), there are t distinct reflexible regular embeddings of the complete bipartite graph K_n,n up to isomorphism, where t=1 if a=0, t=2^k if a=1, t=2^k+1 if a=2, and t=3·2^k+1 if a?3. And, there are s distinct self-Petrie dual regular embeddings of K_n,n up to isomorphism, where s=1 if a=0, s=2^k if a=1, s=2^k+1 if a=2, and s=2^k+2 if a?3.     

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.     

Entire functions that share a small function with its derivative

In this paper, by studying the properties of meromorphic functions which have few zeros and poles, we find all the entire functions f(z) which share a small and finite order meromorphic function a(z) with its derivative, and f(n)(z)−a(z)=0 whenever f(z)−a(z)=0 (n?2). This result is a generalization of several previous results.     

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.     

On a ramification bound of torsion semi-stable representations over a local field

Let p be a rational prime, k be a perfect field of characteristic p, W=W(k) be the ring of Witt vectors, K be a finite totally ramified extension of Frac(W) of degree e and r be a non-negative integer satisfying r<p−1. In this paper, we prove the upper numbering ramification group for j>u(K,r,n) acts trivially on the pn-torsion semi-stable GK-representations with Hodge-Tate weights in {0,…,r}, where u(K,0,n)=0, u(K,1,n)=1+e(n+1/(p−1)) and u(K,r,n)=1−p−n+e(n+r/(p−1)) for 1<r<p−1.     

On the successive coefficients of close-to-convex functions

Let f∈S, f be a close-to-convex function, f_k(z)=[f(z^k)]^1/k. The relative growth of successive coefficients of f_k(z) is investigated. The sharp estimate of ||c_n+1|−|c_n|| is obtained by using the method of the subordination function.