Factorization of fredholm operators on analytic functions

Let Ω be a simply connected domain in the complex plane, and $\text{A(Ω}{}^{\mathrm{n}}\text{)}$, the space of functions which are defined and analytic on $\text{Ω}{}^{\mathrm{n}}$, if K is the operator on elements $\text{u(t, a}{}_1\text{, …, a}{}_{\mathrm{n}}\text{)}\text{of}\text{A(Ω}{}^{\mathrm{n\; +\; 1}}\text{)}$ defined in terms of the kernels k_i(t, s, a₁, …, a_n) in $\text{A(Ω}{}^{\mathrm{n\; +\; 2}}\text{)}$ by is the identity operator on $\text{A(Ω}{}^{\mathrm{n\; +\; 1}}\text{)}$, then the operator I ? K may be factored in the form (I ? K)(M ? W) = (I ? ΠK)(M ? ΠW). Here, W is an operator on $\text{A(Ω}{}^{\mathrm{n\; +\; 1}}\text{)}$ defined in terms of a kernel w(t, s, a₁, …, a_n) in $\text{A(Ω}{}^{\mathrm{n\; +\; 2}}\text{)}$ by Wu = ∝_an^tw(t, s, a₁, …, a_n) u(s, a₁, …, a_n) ds. ΠW is the operator; ΠWu = ∝_{an ? 1}w(t, s, a₁, …, a_n) u(s, a₁, …, a_n) ds. ΠK is the operator; ΠKu = ∑_{i = 1}^{n ? 1} ∝_ai^tk_i(t, s, a₁, …, a_n) ds + ∝_{an ? 1}^tk_n(t, s, a₁, …, a_n) u(s, a₁, …, a_n) ds. The operator M is of the form m(t, a₁, …, a_n)I, where $\text{m ? A(Ω}{}^{\mathrm{n\; +\; 1}}\text{)}$ and maps elements of $\text{A(Ω}{}^{\mathrm{n\; +\; 1}}\text{)}$ into itself by multiplication. The function m is uniquely derived from K in the following manner. The operator K defines an operator $\text{K}{}^1$ on functions u in $\text{A(Ω}{}^{\mathrm{n\; +\; 2}}\text{)}$, by . A determinant $\text{δ(I ? K}{}^1\text{)}$ of the operator $\text{I ? K}{}^1$ is defined as an element $\text{m}{}^1\text{(t, a}{}_1\text{, …, a}{}_{\mathrm{n\; +\; 1}}\text{)}$ of $\text{A(Ω}{}^{\mathrm{n\; +\; 2}}\text{)}$. This is mapped into $\text{A(Ω}{}^{\mathrm{n\; +\; 1}}\text{)}$ by setting a_{n + 1} = t to give m(t, a₁, …, a_n). The operator I ? ΠK may be factored in similar fashion, giving rise to a chain factorization of I ? K. In some cases all the matrix kernels k_i defining K are separable in the sense that k_i(t, s, a₁, …, a_n) = P_i(t, a₁, …, a_n) Q_i(s, a₁, …, a_n), where P_i is a 1 × p_i matrix and Q_i is a p_i × 1 matrix, each with elements in $\text{A(Ω}{}_{\mathrm{n\; +\; 1}}\text{)}$, explicit formulas are given for the kernels of the factors W. The various results are stated in a form allowing immediate extension to the vector-matrix case.     

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}$

     

A divided difference inequality for n-convex functions

For a₍₁₎ ? a₍₂₎ ? ··· ? a_(n) ? 0, b₍₁₎ ? b₍₂₎ ? ··· ? b_(n) ? 0, the ordered values of a_i, b_i, i = 1, 2,…, n, m fixed, m ? n, and p ? 1 it is shown that

$\text{∑}\text{1}\text{n}\text{a}{}_{\mathrm{i}}\text{b}{}_{\mathrm{i}}\text{?}\text{∑}\text{1}\text{m}\text{a}{}^{\mathrm{p}}{}_{\mathrm{(i)}}{}^{\mathrm{<mtext>1</mtext><mtext>p</mtext>}}\text{∑}\text{1}\text{m?k?1}\text{b}{}^{\mathrm{q}}{}_{\mathrm{(i)}}\text{+}\text{b}{}^{\mathrm{q}}{}_{\mathrm{[m?k]}}\text{(k+1)}{}^{\mathrm{<mtext>q</mtext><mtext>p</mtext>}}{}^{\mathrm{<mtext>1</mtext><mtext>q</mtext>}}$

where $\text{1}\text{p}\text{+}\text{1}\text{q}\text{= 1, b}{}_{\mathrm{[j]}}\text{= b}{}_{\mathrm{(j)}}\text{+ b}{}_{\mathrm{(j\; +\; 1)}}\text{+ ··· + b}{}_{\mathrm{(n)}}\text{,}\text{and}\text{k}$ is the integer such that $\text{b}{}_{\mathrm{(m\; ?\; k\; ?\; 1)}}\text{?}\text{b[m ? k]}\text{(k + 1)}$ and $\text{b}{}_{\mathrm{(m\; ?\; k)}}\text{<}\text{b}{}_{\mathrm{[m\; ?\; k\; +\; 1]}}\text{k}$. The inequality is shown to be sharp. When p < 1 and a_(i)'s are in increasing order then the inequality is reversed.     

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.     

Periodic oscillations of coefficients of power series that satisfy functional equations

It is shown that the coefficients a_n of the power series f(z) = ∑^∞_n=1a_nzⁿ which satisfies the functional equation

$\text{f(z)=z+f(z}{}^2\text{+z}{}^3\text{)}$

display periodic oscillations; $\text{a}{}_{\mathrm{n}}\text{～ (}\text{ø}{}^{\mathrm{n}}\text{n}\text{) u(}\text{log}\text{n}$ as n → ∞, where $\text{ø =}\text{(1 + 5}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{)}\text{2}$ and u(x) is a positive, nonconstant, continuous function which is periodic with period log(4 ? ø). Similar results are obtained for a wide class of power series that satisfy similar functional equations. Power series of these types are of interest in combinatorics and computer science since they often represent generating functions. For example, the nth coefficient of the power series satisfying (1) enumerates 2, 3-trees with n leaves.     

Diagonal forms over finite fields

We shall establish for all finite fields GF(pⁿ) the following result of Chowla: given a positive integer m greater than one and the finite field GF(p), p a prime, such that x^m = ?1 is solvable in GF(p), then there exists an absolute positive constant c, $\text{c ≤}\text{10}\text{ln}\text{2}$, such that for each set of s nonzero elements a_i of GF(p), $\text{a}{}_1\text{x}{}_1{}^{\mathrm{m}}\text{+ ? + a}{}_{\mathrm{s}}\text{x}{}_{\mathrm{s}}{}^{\mathrm{m}}$ has a non-trivial zero in GF(p) if s ≥ c ln m.     

Asymptotic behavior of nonoscillatory solutions of nonlinear differential equations with retarded arguments

For nonlinear retarded differential equations $\text{y}{}^{\mathrm{2n}}\text{(t)?}\text{∑}\text{i=1}\text{m}\text{f}{}_{\mathrm{i}}\text{(t,y(t),y(g}{}_{\mathrm{i}}\text{(t)))=0}$ and $\text{y}{}^{\mathrm{n}}\text{(t)?}\text{∑}\text{i=1}\text{m}\text{P}{}_{\mathrm{i}}\text{(t)F}{}_{\mathrm{i}}\text{(y(g}{}_{\mathrm{i}}\text{(t)))=h(t),}$ the sufficient conditions are given on f_i, p_i, F_i, and h under which every bounded nonoscillatory solution of (${}^1$) or (${}^7$) tends to zero as t → ∞.     

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.     

On the fair coin tossing process

Let Ω = {1, 0} and for each integer n ≥ 1 let $\text{Ω}{}_{\mathrm{n}}\text{= Ω × Ω × … × Ω}$ (n-tuple) and $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}\text{= {(a}{}_1\text{, a}{}_2\text{, …, a}{}_{\mathrm{n}}\text{)|(a}{}_1\text{, a}{}_2\text{, … , a}{}_{\mathrm{n}}\text{) ? Ω}{}_{\mathrm{n}}\text{and}\text{Σ}{}_{\mathrm{i=1}}{}^{\mathrm{n}}\text{a}{}_{\mathrm{i}}\text{= k}}$ for all k = 0,1,…,n. Let {Y_m}_m≥1 be a sequence of i.i.d. random variables such that $\text{P(Y}{}_1\text{= 0) = P(Y}{}_1\text{= 1) =}\text{1}\text{2}$. For each A in $\text{Ω}{}_{\mathrm{n}}$, let T_A be the first occurrence time of A with respect to the stochastic process {Y_m}_m≥1. R. Chen and A.Zame (1979, J. Multivariate Anal. 9, 150–157) prove that if n ≥ 3, then for each element A in $\text{Ω}{}_{\mathrm{n}}$, there is an element B in $\text{Ω}{}_{\mathrm{n}}$ such that the probability that T_B is less than T_A is greater than $\text{1}\text{2}$. This result is sharpened as follows: (I) for n ≥ 4 and 1 ≤ k ≤ n ? 1, each element A in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$, there is an element B also in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$ such that the probability that T_B is less than T_A is greater than $\text{1}\text{2}$; (II) for n ≥ 4 and 1 ≤ k ≤ n ? 1, each element A = (a₁, a₂,…,a_n) in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$, there is an element C also in $\text{Ω}{}_{\mathrm{n}}{}^{\mathrm{k}}$ such that the probability that T_A is less than T_C is greater than $\text{1}\text{2}$ if n ≠ 2m or n = 2m but a_i = a_{i + 1} for some 1 ≤ i ≤ n?1. These new results provide us with a better and deeper understanding of the fair coin tossing process.     

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.     

Elementary proof of the transformation formula for Lambert series involving generalized Dedekind sums

An elementary proof is given of the author's transformation formula for the Lambert series $\text{G}{}_{\mathrm{p}}\text{(x) =}\text{Σ}{}_{\mathrm{n?1}}{}^{\mathrm{<mtext>\infty </mtext>}}\text{n}{}^{\mathrm{?p}}\text{x}{}^{\mathrm{n}}\text{(1?x}{}^{\mathrm{n}}\text{)}$ relating G_p(e^2πiτ) to G_p(e^2πiAτ), where p > 1 is an odd integer and $\text{Aτ =}\text{(aτ + b)}\text{(cτ + d)}$ is a general modular substitution. The method extends Sczech's argument for treating Dedekind's function $\text{log}\text{η(τ) =}\text{πiτ}\text{12}\text{? G}{}_1\text{(e}{}^{\mathrm{2\pi i\tau }}\text{)}$, and uses Carlitz's formula expressing generalized Dedekind sums in terms of Eulerian functions.     

The sum of aΩ(n) over integers n ≤ x with all prime factors between a and y

For a > 0 let $\text{ψ}{}_{\mathrm{a}}\text{(x, y) =}\text{Σ}\text{a}{}^{\mathrm{\Omega (n)}}$, the sum taken over all n, 1 ≤ n ≤ x such that if p is prime and p|n then a < p ≤ y. It is shown for u < about ($\text{log log}\text{x}\text{log log log}\text{x}$) that $\text{ψ}{}_{\mathrm{a}}\text{(x, x}{}^{\mathrm{<mtext>1</mtext><mtext>u</mtext>}}\text{) ? x(}\text{log}\text{x)}{}^{\mathrm{a?1}}\text{p}{}_{\mathrm{a}}\text{(u)}$, where p_a(u) solves a delay differential equation much like that for the Dickman function p(u), and the asymptotic behavior of p_a(u) is worked out.     

Enumeration of pairs of permutations

Let π = (a₁, a₂, …, a_n), ? = (b₁, b₂, …, b_n) be two permutations of $\text{Z}{}_{\mathrm{n}}\text{= {1, 2, …, n}}$. A rise of π is pair a_i, a_i+1 with a_i < a_i+1; a fall is a pair a_i, a_i+1 with a_i > a_i+1. Thus, for i = 1, 2, …, n ? 1, the two pairs a_i, a_i+1; b_i, b_i+1 are either both rises, both falls, the first a rise and the second a fall or the first a fall and the second a rise. These possibilities are denoted by RR, FF, RF, FR. The paper is concerned with the enumeration of pairs π, p with a given number of RR, FF, RF, FR. In particular if ω_n denotes the number of pairs with RR forbidden, it is proved that $\text{∑}{}^{\mathrm{\infty }}{}_0\text{ω}{}_{\mathrm{n}}\text{z}{}^{\mathrm{n}}\text{n!n!}\text{=}\text{1}\text{?(z)}$, $\text{?(z) = ∑}{}^{\mathrm{\infty }}{}_0\text{(-1)}{}^{\mathrm{n}}\text{z}{}^{\mathrm{n}}\text{n!n!}$. More precisely if ω(n, k) denotes the number of pairs π, p with exactly k occurences of RR(or FF, RF, FR) then $\text{1 + ∑}{}^{\mathrm{\infty }}{}_{\mathrm{n=1}}\text{z}{}^{\mathrm{n}}\text{n!n!}$$\text{∑}{}^{\mathrm{n?1}}{}_{\mathrm{k=0}}\text{ω(n, k)x}{}^{\mathrm{k}}\text{=}\text{(1 ? x)}\text{(?(z(1 ? x)) ? x)}$.     

On the probability that k positive integers are relatively prime II

Given a set S of positive integers let $\text{Z}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(t)}$ denote the number of k-tuples 〈m₁, …, m_k〉 for which $\text{m}{}_{\mathrm{i}}\text{∈ S ? [1, t]}$ and (m₁, …, m_k) = 1. Also let $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n)}$ denote the probability that k integers, chosen at random from $\text{S ? [1, n]}$, are relatively prime. It is shown that if P = {p₁, …, p_r} is a finite set of primes and S = {m : (m, p₁ … p_r) = 1}, then $\text{Z}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(t) = (td(S))}{}^{\mathrm{k}}\text{Π}{}_{\mathrm{\nu ?P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{) + O(t}{}^{\mathrm{k?1}}\text{)}$ if k ≥ 3 and $\text{Z}{}_2{}^{\mathrm{S}}\text{(t) = (td(S))}{}^2\text{Π}{}_{\mathrm{p?P}}\text{(1 ?}\text{1}\text{p}{}^2\text{) + O(t}\text{log}\text{t)}$ where d(S) denotes the natural density of S. From this result it follows immediately that $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n) → Π}{}_{\mathrm{p?P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{) = (ζ(k))}{}^{\mathrm{?1}}\text{Π}{}_{\mathrm{p\in P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{)}{}^{\mathrm{?1}}$ as n → ∞. This result generalizes an earlier result of the author's where $\text{P = ?}$ and S is then the whole set of positive integers. It is also shown that if S = {p₁^x₁ … p_r^x_r : x_i = 0, 1, 2,…}, then $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n) → 0}$ as n → ∞.     

Asymptotic results for partitions (II) and a conjecture of Bateman and Erdös

Asymptotic results are obtained for p_A^(k)(n), the kth difference of the function p_A(n) which is the number of partitions of n into integers from A. Under certain restrictions on A it is shown that

$\text{P}{}_{\mathrm{A}}{}^{\mathrm{(k+1)}}\text{(n)}\text{P}{}_{\mathrm{A}}{}^{\mathrm{(k)}}\text{(n)}\text{= O(n}{}^{\mathrm{?1/2}}\text{) (n→ ∫)}$

thereby verifying for these A a conjecture of Bateman and Erdös.     

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.     

Pairs of additive equations II. Large odd degree

Let k be an odd positive integer. Davenport and Lewis have shown that the equations

$\text{a}{}_1\text{x}{}_1{}^{\mathrm{k}}\text{+…+a}{}_{\mathrm{n}}\text{x}{}_{\mathrm{n}}{}^{\mathrm{k}}\text{=0}$

with integer coefficients, have a nontrivial solution in integers x₁,…, x_N provided that

$\text{N?[36klog6k]}$

Here it is shown that for any ? > 0 and k > k₀(?) the equations have a nontrivial solution provided that

$\text{N?}\text{8}\text{log 2}\text{+?}\text{k log k.}$

     

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

On the asymptotic number of tournament score sequences

An n-tournament is a complete labelled digraph on n vertices without loops or multiple arcs. A tournament's score sequence is the sequence of the out-degrees of its vertices arranged in nondecreasing order. The number S_n of distinct score sequences arising from all possible n-tournaments, as well as certain generalizations are investigated. A lower bound of the form

$\text{S}{}_{\mathrm{n}}\text{>}\text{C}{}_1\text{4}{}^{\mathrm{n}}\text{n}{}^{\mathrm{<mtext>5</mtext><mtext>2</mtext>}}$

(C₁ a constant) and an upper bound of the form $\text{S}{}_{\mathrm{n}}\text{<}\text{C}{}_2\text{4}{}^{\mathrm{n}}\text{n}{}^2$ are proved. A q-extension of the Catalan numbers

$\text{c}{}_1\text{(q)=1}\text{and}\text{c}{}_{\mathrm{n}}\text{(q)=}\text{∑}\text{i?1}\text{n?1}\text{c}{}_{\mathrm{i}}\text{(q)c}{}_{\mathrm{n?1}}\text{(q)q}{}^{\mathrm{i(n?i?1)}}$

is defined. It is conjectured that all coefficients in the polynomial C_n(q) are at most $\text{O(}\text{4}{}^{\mathrm{n}}\text{n}{}^3\text{)}$. It is shown that if this conjecture is true, then

$\text{S}{}_{\mathrm{n}}\text{<}\text{C}{}_3\text{4}{}^{\mathrm{n}}\text{n}{}^{\mathrm{<mtext>5</mtext><mtext>2</mtext>}}$

     

Extension de quelques theoremes sur les densites de series d'elements de n a des series de sous-ensembles finis de n

For a sequence A = {A_k} of finite subsets of N we introduce: $\text{δ(A) =}\text{inf}{}_{\mathrm{m?n}}\text{A(m)}\text{2}{}^{\mathrm{n}}$, $\text{d(A) =}\text{lim inf}{}_{\mathrm{n\to \infty }}\text{A(n)}\text{2}{}^{\mathrm{n}}$, where A(m) is the number of subsets A_k ? {1, 2, …, m}.The collection of all subsets of {1, …, n} together with the operation $\text{a ∪ b, (a ∩ b), (a 1 b = a ∪ b ? a ∩ b)}$ constitutes a finite semi-group N^∪ (semi-group N^∩) (group $\text{N}{}^1$). For N^∪, N^∩ we prove analogues of the Erdös-Landau theorem: δ(A+B) ? δ(A)(1+(2λ)^?1(1?δ(A>))), where B is a base of N of the average order λ. We prove for $\text{N}{}^{\mathrm{\cup }}\text{, N}{}^{\mathrm{\cap }}\text{, N}{}^1$ analogues of Schnirelmann's theorem (that δ(A) + δ(B) > 1 implies δ(A + B) = 1) and the inequalities λ ? 2h, where h is the order of the base.We introduce the concept of divisibility of subsets: a|b if b is a continuation of a. We prove an analog of the Davenport-Erdös theorem: if d(A) > 0, then there exists an infinite sequence {A_kr}, where A_kr | A_kr+1 for r = 1, 2, …. In Section 6 we consider for $\text{N∪, N∩, N1}$ analogues of Rohrbach inequality: $\text{2n}\text{? g(n) ? 2}\text{n}$, where g(n) = min k over the subsets {a₁ < … < a_k} ? {0, 1, 2, …, n}, such that every m? {0, 1, 2, …, n} can be expressed as m = a_i + a_j.Pour une série A = {A_k} de sous-ensembles finis de N on introduit les densités: $\text{δ(A) =}\text{inf}{}_{\mathrm{m?n}}\text{A(m)}\text{2}{}^{\mathrm{m}}$, $\text{d(A) =}\text{lim inf}{}_{\mathrm{n\to \infty }}\text{A(n)}\text{2}{}^{\mathrm{n}}$ où A(m) est le nombre d'ensembles A_k ? {1, 2, …, m}. L'ensemble de toutes les parties de {1, 2, …, n} devient, pour les opérations $\text{a ∪ b, a ∩ b, a 1 b = a ∪ b ? a ∩ b}$, un semi-groupe fini N^∪, N^∩ ou un groupe N¹ respectivement. Pour N^∪, N^∩ on démontre l'analogue du théorème de Erdös-Landau: δ(A + B) ? δ(A)(1 + (2λ)^?1(1?δ(A))), où B est une base de N d'ordre moyen λ. On démontre pour $\text{N}{}^{\mathrm{\cup }}\text{, N}{}^{\mathrm{\cap }}\text{, N}{}^1$ l'analogue du théorème de Schnirelmann (si δ(A) + δ(B) > 1, alors δ(A + B) = 1) et les inégalités λ ? 2h, où h est l'ordre de base. On introduit le rapport de divisibilité des enembles: a|b, si b est une continuation de a. On démontre l'analogue du théorème de Davenport-Erdös: si d(A) > 0, alors il existe une sous-série infinie {A_kr}, où A_kr|A_kr+1, pour r = 1, 2, … . Dans le Paragraphe 6 on envisage pour N^∪, $\text{N}{}^{\mathrm{\cap }}\text{, N}{}^1$ les analogues de l'inégalité de Rohrbach: $\text{2n}\text{? g(n) ? 2}\text{n}$, où g(n) = min k pour les ensembles {a₁ < … < a_k} ? {0, 1, 2, …, n} tels que pour tout m? {0, 1, 2, …, n} on a m = a_i + a_j.