On the van der Waerden conjecture and zeros of polynomials

Let

$\text{F(x) =}\text{∑}\text{k=o}\text{n}\text{n}\text{k}\text{A}{}_{\mathrm{k}}\text{x}{}^{\mathrm{k}}$

$\text{A}{}_{\mathrm{n}}\text{≠ 0,}$

and

$\text{G(x) =}\text{∑}\text{k=o}\text{n}\text{n}\text{k}\text{B}{}_{\mathrm{k}}\text{x}{}^{\mathrm{k}}$

$\text{B}{}_{\mathrm{n}}\text{≠ 0,}$

be polynomials with real zeros satisfying A_n?1 = B_n?1 = 0, and let

$\text{H(x) =}\text{∑}\text{k=o}\text{n-2}\text{n}\text{k}\text{A}{}_{\mathrm{k}}\text{B}{}_{\mathrm{k}}\text{x}{}^{\mathrm{k}}\text{.}$

Using the recently proved validity of the van der Waerden conjecture on permanents, some results on the real zeros of H(x) are obtained. These results are related to classical results on composite polynomials.     

On a conjecture by D. Ž. D̄okovic

It is shown that if $\text{A?Ω}{}_{\mathrm{n}}\text{?{J}{}_{\mathrm{n}}\text{}}$ satisfies

$\text{nkσ}{}_{\mathrm{k}}\text{(A)?(n?k+1)}{}^2\text{σ}{}_{\mathrm{k?1}}\text{(A)}$

$\text{(k=1,2,…,n)}$

, where σ_k(A) denotes the sum of all kth order subpermanent of A, then Per[λJ_n+(1?λ)A] is strictly decreasing in the interval 0<λ<1.     

Binomial self-inverse sequences and tangent coefficients

This paper treats the class of sequences {a_n} that satisfy the recurrence relation

$\text{a}{}_{\mathrm{2n+1}}\text{=∑}{}_{\mathrm{<mtext>k=0</mtext>}}{}^{\mathrm{<mtext>n</mtext>}}\text{(?1)}{}^{\mathrm{<mtext>k</mtext>}}\text{(}\text{n}\text{k}\text{a}{}_{\mathrm{k}}\text{d}{}^{\mathrm{n?k}}$

between the odd and even terms of {a_n} that involves the coefficients of tan(t), namely

$\text{a}{}_{\mathrm{2n+1}}\text{=∑}{}_{\mathrm{<mtext>k=0</mtext>}}{}^{\mathrm{<mtext>n</mtext>}}\text{(?1)}{}^{\mathrm{<mtext>k</mtext>}}\text{(}\text{2}\text{n}\text{+1}\text{2}\text{k}\text{+1}\text{)}\text{T}{}_{\mathrm{k}}\text{(d/2)}{}^{\mathrm{2k+1}}\text{a}{}_{\mathrm{2n?2k}}$

A combinatorial setting is then provided to elucidate the appearance of the tangent coefficients in this equation.     

Construction of a recurrence relation for modified moments

In this paper we are constructing a recurrence relation of the form

$\text{∑}\text{i=0}\text{r}\text{ω}{}_{\mathrm{i}}\text{(k)m}{}_{\mathrm{k+i}}{}^{\mathrm{\{\lambda \}}}\text{[f] = ω(k)}$

for integrals (called modified moments)

$\text{m}{}_{\mathrm{k}}{}^{\mathrm{\{\lambda \}}}\text{[f]df=}\text{∫}\text{?1}\text{1}\text{f(x)C}{}_{\mathrm{k}}{}^{\mathrm{(\lambda )}}\text{(x)dx (k = 0,1,…)}$

in which C_k^(λ) is the k-th Gegenbauer polynomial of order $\text{λ(λ > ?}\text{1}\text{2}\text{)}$, and f is a function satisfying the differential equation

$\text{∑}\text{i=0}\text{n}\text{P}{}_{\mathrm{i}}\text{(x)f}{}^{\mathrm{(i)}}\text{(x) = p(x) (?1?x?1)}$

of order n, where p₀, p₁, …, p_n ? 0 are polynomials, and m_k^〈λ〉[p] is known for every k. We give three methods of construction of such a recurrence relation. The first of them (called Method I) is optimum in a certain sense.     

On the order of the error function of the (k,r)-integers

Let k and r be fixed integers such that 1 < r < k. Any positive integer n of the form n = a^kb, where b is r-free, is called a (k, r)-integer. In this paper we prove that if Q_k,r(x) denotes the number of (k, r)-integers ≤ x, then $\text{Q}{}_{\mathrm{k,r}}\text{(x) =}\text{xζ(k)}\text{ζ(r)}\text{+ Δ}{}_{\mathrm{k,r}}\text{(x)}$, where $\text{Δ}{}_{\mathrm{k,r}}\text{(x) = O(x}{}^{\mathrm{<mtext>1</mtext><mtext>r</mtext>}}\text{exp}\text{[?B}\text{log}{}^{\mathrm{<mtext>3</mtext><mtext>5</mtext>}}\text{x (}\text{log log}\text{x)}{}^{\mathrm{<mtext>?</mtext><mtext>1</mtext><mtext>5</mtext>}}\text{])}$, B being a positive constant depending on r and the O-estimate is uniform in k. On the assumption of the Riemann hypothesis, we improve the above order estimate of Δ_k,r(x) and prove that

$\text{1}\text{x}\text{∫}\text{1}\text{α}\text{δ}{}_{\mathrm{k,r}}\text{(t)dt=0(x}\text{1}\text{k}\text{ω(x))}\text{or}\text{0(x}{}^{\mathrm{3/(4r+1)}}\text{ω(x))}$

, according as $\text{k ≤}\text{(4r + 1)}\text{3}$ or $\text{k >}\text{(4r + 1)}\text{3}$, where ω(x) = exp [B log x(log log x)^?1].     

Patterns of power residues

This paper examines the question of whether a given pattern

$\text{x,x+a}{}_1\text{,…,x+a}{}_{\mathrm{m?1}}$

of kth power residues of length m can be postponed indefinitely. This is the case when there exists a prime q, called a delay prime, which does not contain this pattern even if q itself is considered as a kth power residue. It is conjectured that if there exists no delay prime then there exists a finite limit

$\text{Λ=Λ (k,m;a}{}_1\text{,…,a}{}_{\mathrm{m?1}}$

for which the corresponding pattern will occur before Λ in every sufficiently large prime of the form kn + 1.     

On matrix functions which commute with their derivative

We improve several results published from 1950 up to 1982 on matrix functions commuting with their derivative, and establish two results of general interest. The first one gives a condition for a finite-dimensional vector subspace E(t) of a normed space not to depend on t, when t varies in a normed space. The second one asserts that if A is a matrix function, defined on a set ?, of the form A(t)= U diag(B₁(t),…,B_p(t)) U^-1, t ∈ ?, and if each matrix function B_k has the polynomial form

$\text{B}{}_{\mathrm{k}}\text{(t)=}\text{∑}\text{i=0}\text{α}{}_{\mathrm{k}}\text{f}{}_{\mathrm{ki}}\text{(t)C}{}_{\mathrm{k}}{}^{\mathrm{i}}\text{, t∈ ?, k∈{1,…,p}}$

then A itself has the polynomial form

$\text{A(t)=}\text{∑}\text{i=0}\text{d?1}\text{f}{}_{\mathrm{i}}\text{(t)C}{}^{\mathrm{i}}\text{,t∈?}$

, where

$\text{d=}\text{∑}\text{k=1}\text{p}\text{d}{}_{\mathrm{k}}$

, d_k being the degree of the minimal polynomial of the matrix C_k, for every k ∈ {1,…,p}.     

Deterministic version of Wigner's semicircle law for the distribution of matrix eigenvalues

It is proved that Wigner's semicircle law for the distribution of eigenvalues of random matrices, which is important in the statistical theory of energy levels of heavy nuclei, possesses the following completely deterministic version. Let A_n=(a_ij), 1?i, ?n, be the nth section of an infinite Hermitian matrix, {λ⁽ⁿ⁾}_1?k?n its eigenvalues, and {u_k⁽ⁿ⁾}_1?k?n the corresponding (orthonormalized column) eigenvectors. Let $\text{v}{}^1{}_{\mathrm{n}}\text{=(a}{}_{\mathrm{n1}}\text{,a}{}_{\mathrm{n2}}\text{,?,a}{}_{\mathrm{n,n?1}}\text{)}$, put

$\text{X}{}_{\mathrm{n}}\text{(t)=[n(n-1)]}{}^{\mathrm{<mtext>-1</mtext><mtext>2</mtext>}}\text{∑}\text{k=1}\text{[(n-1)t]}\text{|v}{}_{\mathrm{n}}{}^1\text{u}{}_{\mathrm{f}}{}^{\mathrm{(n-1)}}\text{|}{}^2\text{,}\text{0?t?1}$

(bookeeping function for the length of the projections of the new row v¹_n of A_n onto the eigenvectors of the preceding matrix A_n?1), and let finally

$\text{F}{}_{\mathrm{n}}\text{(x)=n}{}^{-1}\text{(}\text{number of}\text{λ}{}_{\mathrm{k}}{}^{\mathrm{(n)}}\text{?x}\text{n}\text{,1?k?n)}$

(empirical distribution function of the eigenvalues of $\text{A}{}_{\mathrm{n}}\text{n}$. Suppose (i) $\text{lim}{}_{\mathrm{n}}\text{a}{}_{\mathrm{nn}}\text{n}\text{=0}$, (ii) lim_nX_n(t)=Ct(0<C<∞,0?t?1). Then

$\text{F}{}_{\mathrm{n}}\text{?W(·,C)}\text{(n→∞)}$

,where W is absolutely continuous with (semicircle) density

$\text{w(x,C)=}\text{(2Cπ)}{}^{-1}\text{(4C-x}{}^2{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{for}\text{|x|?2}\text{C}\text{0}\text{for}\text{|x|?2}\text{C}$

     

Kolmogorov-Landau inequalities for monotone functions

Presented in this report are two further applications of very elementary formulae of approximate differentiation. The first is a new derivation in a somewhat sharper form of the following theorem of V. M. Olovyani?nikov: LetN_n (n ? 2) be the class of functionsg(x) such thatg(x), g′(x),…, g⁽ⁿ⁾(x) are ? 0, bounded, and nondecreasing on the half-line ?∞ < x ? 0. A special element ofN_nis

$\text{g}{}_1\text{(x) = 0}\text{if}\text{?∞ < x < ?1, g}{}_1\text{(x) = (1 + x)}{}^{\mathrm{n}}\text{if}\text{?1 ? x ? 0}$

. Ifg(x) ∈ N_nis such that

$\text{g(0) ? g}{}_1\text{(0) = 1, g}{}^{\mathrm{(n)}}\text{(0) ? g}{}_1{}^{\mathrm{(n)}}\text{(0) = n!}$

, then

$\text{g}{}^{\mathrm{(v)}}\text{(0) ? g}{}_1{}^{\mathrm{(v)}}\text{(0)}$

for

1$\text{v = 1,…, n ? 1}$

. Moreover, if we have equality in (1) for some value of v, then we have there equality for all v, and this happens only if $\text{g(x) = g}{}_1\text{(x)}$ in (?∞, 0].The second application gives sufficient conditions for the differentiability of asymptotic expansions (Theorem 4).     

Product formulas for semigroups with elliptic generators

Real constant coefficient nth order elliptic operators, Q, which generate strongly continuous semigroups on L²($\text{R}$^k) are analyzed in terms of the elementary generator,

$\text{A = (?n)}{}^{\mathrm{<mtext>(</mtext><mtext>n</mtext><mtext>2</mtext><mtext>\; ?\; 1</mtext>}}\text{)(n!)}{}^{\mathrm{?1}}\text{∑}\text{k}\text{j = 1}\text{?}{}^{\mathrm{n}}\text{?x}{}_{\mathrm{j}}{}^{\mathrm{n}}$

, for n even. Integral operators are defined using the fundamental solutions p_n(x, t) to u_t = Au and using real polynomials q_l,…, q_k on $\text{R}$^m by the formula, for q = (q_l,…, q_k),

$\text{(F(t)?)(x) = ∫}$

_$\text{R}$m

$\text{?(x + q(z)) P}{}_{\mathrm{n}}\text{(z, t)dz}$

. It is determined when, strongly on L²($\text{R}$^k),

$\text{e}{}^{\mathrm{tQ}}\text{=}\text{lim}\text{j → ∞}\text{F}\text{t}\text{j}{}^{\mathrm{j}}$

. If n = 2 or k = 1, this can always be done. Otherwise the symbol of Q must have a special form.     

Numerical approximation of product integrals

A technique for the numerical approximation of matrix-valued Riemann product integrals is developed. For a ? x < y ? b, I_m(x, y) denotes

$\text{∫}\text{χ}\text{y}\text{∫}\text{χ}\text{v}{}_2\text{?}\text{∫}\text{χ}\text{v}{}_2\text{∏}\text{i=1}\text{m}\text{F(ν}{}_{\mathrm{i}}\text{)dν}{}_1\text{dν}{}_2\text{?dν}{}_{\mathrm{m}}$

, and A_m(x, y) denotes an approximation of I_m(x, y) of the form

$\text{(y?x)}{}^{\mathrm{m}}\text{∑}\text{k=1}\text{n}\text{a}{}_{\mathrm{k}}\text{∏}\text{i=1}\text{m}\text{F(χ}{}_{\mathrm{ik}}\text{)}$

, where a_k and y_ik are fixed numbers for i = 1, 2,…, m and k = 1, 2,…, N and x_ik = x + (y ? x)y_ik. The following result is established. If p is a positive integer, F is a function from the real numbers to the set of w × w matrices with real elements and F⁽¹⁾ exists and is continuous on [a, b], then there exists a bounded interval function H such that, if n, r, and s are positive integers, $\text{(b ? a)}\text{n}\text{= h < 1, x}{}_{\mathrm{i}}\text{= a + hi}\text{for}\text{i = 0, 1,…, n}\text{and}\text{0 < r ? s ? n}$, then

$\text{∏}\text{χ}{}_{\mathrm{r?}}\text{χ}{}_{\mathrm{s}}\text{(I+F dχ)?}\text{∏}\text{i=r}\text{s}\text{I+}\text{∑}\text{j=1}\text{p}\text{I}{}_{\mathrm{j}}\text{(χ}{}_{\mathrm{i?1}}\text{,χ}{}_{\mathrm{i}}\text{)}$

$\text{=h}{}^{\mathrm{p}}\text{H(χ}{}_{\mathrm{r?1}}\text{,χ}{}_{\mathrm{s}}\text{)+O(h}{}^{\mathrm{p+1}}\text{)}$

Further, if F^(j) exists and is continuous on [a, b] for j = 1, 2,…, p + 1 and A is exact for polynomials of degree less than p + 1 ? j for j = 1, 2,…, p, then the preceding result remains valid when A_j is substituted for I_j.     

A transformation theorem for one-dimensional F-expansions

If f is a monotone function subject to certain restrictions, then one can associate with any real number x between zero and one a sequence {a_n(x)} of integers such that

$\text{x=f(a}{}_1\text{(x) + f(a}{}_2\text{(x) +f(a}{}_3\text{(x) +…)))}$

. In this paper properties of the function F defined by

$\text{Fx=g(a}{}_1\text{(x) + g(a}{}_2\text{(x) +g(a}{}_3\text{(x) +…)))}$

, where g is any function satisfying the same restrictions as f, are discussed. Principally, F is found to be useful in finding stationary measures on the sequences {a_n(x)}.     

On the number of zeros of diagonal cubic forms

Let M_s, be the number of solutions of the equation

$\text{X}{}_1{}^3\text{+ X}{}_2{}^3\text{+ … + X}{}_{\mathrm{s}}{}^3\text{=0}$

in the finite field GF(p). For a prime p ≡ 1(mod 3),

$\text{∑}\text{s=1}\text{∞}\text{M}{}_{\mathrm{s}}\text{X}{}^{\mathrm{s}}\text{=}\text{x}\text{1 ? px}\text{+}\text{x}{}^2\text{(p ? 1)(2 + dx)}\text{1 ? 3px}{}^2\text{? pdx}{}^3$

,

$\text{M}{}_3\text{= p}{}^2\text{+ d(p ? 1)}$

, and

$\text{M}{}_4\text{= p}{}^2\text{+ 6(p}{}^2\text{? p)}$

. Here d is uniquely determined by

$\text{4}{}_{\mathrm{p}}\text{= d}{}^2\text{+ 27b}{}^2\text{and}\text{d ≡ 1(}\text{mod}\text{3)}$

.     

Concavity of certain maps on positive definite matrices and applications to Hadamard products

If f is a positive function on (0, ∞) which is monotone of order n for every n in the sense of Löwner and if Φ₁ and Φ₂ are concave maps among positive definite matrices, then the following map involving tensor products:

$\text{(A,B)?f[Φ}{}_1\text{(A)}{}^{\mathrm{?1}}\text{?Φ}{}_2\text{(B)]·(Φ}{}_1\text{(A)?I)}$

is proved to be concave. If Φ₁ is affine, it is proved without use of positivity that the map

$\text{(A,B)?f[Φ}{}_1\text{(A)?Φ}{}_2\text{(B)}{}^{\mathrm{?1}}\text{]·(Φ}{}_1\text{(A)?I)}$

is convex. These yield the concavity of the map

$\text{(A,B)?A}{}^{\mathrm{1?p}}\text{?B}{}^{\mathrm{p}}$

(0<p?1) (Lieb's theorem) and the convexity of the map

$\text{(A,B)?A}{}^{\mathrm{1+p}}\text{?B}{}^{\mathrm{?p}}$

(0<p?1), as well as the convexity of the map

$\text{(A,B)?(A·log[A])?I?A?log[B]}$

.These concavity and convexity theorems are then applied to obtain unusual estimates, from above and below, for Hadamard products of positive definite matrices.     

Starting in maximum-polynomial-degree Nordsieck-Gear methods

The intent of this paper is to show that the Nordsieck-Gear methods with maximum polynomial degree k+1, first described in [1], admit of matched starting methods which are exact for all polynomials of degree ?k+1. In general, it is shown that these starting methods yield starting errors of the required order, O(h^k+2), for all initial-value problems

$\text{y}{}^{\mathrm{(P)}}\text{(x)=f(x,y,y}{}^{\mathrm{(1)}}\text{,y}{}^{\mathrm{(2)}}\text{,…,y}{}^{\mathrm{(p?1)}}\text{),}$

$\text{y(0)=y}{}_0\text{, y}{}^{\mathrm{i}}\text{(0)=y}{}_0{}^{\mathrm{(i)}}\text{, i=1,2,…,p?1,}$

where f is k+1 times continuously differentiable in a neighborhood of the graph of the exact solution (x,?(x)), x?[0,X]. Two theorems are proved. The first is the constructive existence of an algorithm which requires (k-p+1)(k-p+2)/2 evaluations of the function f to obtain approximations of the method's required higher-order scaled derivatives at the origin:

$\text{h}{}^{\mathrm{p+1}}\text{y}\text{?}{}^{\mathrm{(p+1)}}\text{(0)}\text{(p+1)!}\text{,…,}\text{h}{}^{\mathrm{k}}\text{y}\text{?}{}^{\mathrm{(k)}}\text{(0)}\text{k!}\text{,}$

each of which is accurate to O(h^k+2). The second, less general theorem, shows that when f is a polynomial in x, y, and its higher order derivatives y⁽¹⁾,y⁽²⁾,…,y(^p?1), an algorithm can be constructed for obtaining the higher-order scaled derivatives exactly. These results lay to rest once and for all any heuristic arguments against varying corrector minus predictor coefficients for preserving maximal order (polynomial degree) because starting values are inexact. Furthermore, and perhaps most importantly, the maximum-polynomial-degree Nordsieck-Gear methods are shown to have a unique property of zero starting error for an important class of ordinary differential equations.     

Hilbert space representations of general discrete time stochastic processes

We show that under mild conditions the joint densities Px₁,…,x_n) of the general discrete time stochastic process X_n on $\text{pH}$ can be computed via

$\text{Px}{}_1\text{,…,x}{}_{\mathrm{n}}\text{(x}{}_1\text{,…,x}{}_{\mathrm{n}}\text{) = 6?T(x}{}_1\text{)…T(x}{}_{\mathrm{n}}\text{)6}{}^2$

where ? is in a Hilbert space $\text{pH}$, and T (x), x ? $\text{pH}$ are linear operators on $\text{pH}$. We then show how the Central Limit Theorem can easily be derived from such representations.     

The probability that k positive integers are relatively r-prime

If r, k are positive integers, then $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(n)}$ denotes the number of k-tuples of positive integers (x₁, x₂, …, x_k) with 1 ≤ x_i ≤ n and (x₁, x₂, …, x_k)_r = 1. An explicit formula for $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(n)}$ is derived and it is shown that $\text{lim}{}_{\mathrm{n\to \infty }}\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(n)}\text{n}{}^{\mathrm{k}}\text{=}\text{1}\text{ζ(rk)}$.If S = {p₁, p₂, …, p_a} is a finite set of primes, then 〈S〉 = {p₁^a₁p₂^a₂…p_s^a_s; p_i ∈ S and a_i ≥ 0 for all i} and $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(S, n)}$ denotes the number of k-tuples (x₁, x₃, …, x_k) with 1 ≤ x_i ≤ n and (x₁, x₂, …, x_k)_r ∈ 〈S〉. Asymptotic formulas for $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(S, n)}$ are derived and it is shown that $\text{lim}{}_{\mathrm{n\to \infty }}\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(S, n)}\text{n}{}^{\mathrm{k}}\text{=}\text{(p}{}_1\text{… p}{}_{\mathrm{a}}\text{)}{}^{\mathrm{rk}}\text{ζ(rk)(p}{}_1{}^{\mathrm{rk}}\text{? 1) … (p}{}_{\mathrm{s}}{}^{\mathrm{rk}}\text{? 1)}$.     

An asymptotic evaluation of the cycle index of a symmetric group

Let $\text{Z(S}{}_{\mathrm{n}}\text{;?(x))}$ denote the polynomial obtained from the cycle index of the symmetric group Z(S_n) by replacing each variable s_i by f(x¹). Let f(x) have a Taylor series with radius of convergence ? of the form f(x)=x^k + a_k+1x^k+1 + a_k+2x^k+2+? with every a₁?0. Finally, let 0<x<1 and let x??. We prove that

This limit is used to estimate the probability (for n and p both large) that a point chosen at random from a random p-point tree has degree n + 1. These limiting probabilities are independent of p and decrease geometrically in n, contrasting with the labeled limiting probabilities of $\text{1}\text{n!e}$.In order to prove the main theorem, an appealing generalization of the principle of inclusion and exclusion is presented.