Inverspositive Operatoren und Taubersätze in der Erneuerungstheorie

A generalization of ordinary renewal processes has been treated byHinderer and the author: for the stochastic process with values in ₊ the aim is (a,a+) with 0a<, 0< instead of (a, ), and a possible passing over the aim is replaced by a phase of stagnation. In the present paper for the open case of an infinite mean length of the undisturbed steps the relationV(a)/a0(a), with fixed, for the mean waiting timeV(a) until reaching the aim is obtained. The proof uses the theory of inversepositive operators ofCollatz andSchröder. This concept also yields an elementary proof of the so-called elementary renewal theorem. Finally the Tauberian theorem ofIkehara inAgmon's version is generalized; it yields the so-called general renewal theorem in the case of finite mean length of the steps, which is also a corollary of a general Tauberian theorem ofBene.

---

---

Herrn Professor Collatz zum 65. Geburtstag     

On the divergence of certain Hermite-Fejér interpolation

Summary In his paper [1]P. Turán discovers the interesting behaviour of Hermite-Fejér interpolation (based on the ebyev roots) not describing the derivative values at exceptional nodes {_n} _n=1 . Answering to his question we construct such exceptional node-sequence for which the mentioned process is bounded for bounded functions whenever –1<x<1 but does not converge for a suitable continuous function at any point of the whole interval [–1, 1].     

The length,the width and the cutset-number of finite ordered sets

The partially ordered set P is an (, , ) ordered set if the width of P, the length of any chain of P and the cut-set number . We will prove that if P is an (, , ) ordered set then P contains a simple (, , ) ordered set and use this result to prove that if P has the 3 cutset property, then width of P length of P+3.     

Indépendance conditionnelle et uniformité pour les lois fortes des grands nombres dans les espaces de Banach

Summary A. Beck has given an uniform strong law of large numbers for families of mutually symmetric and uniformly essentially bounded sequences of centered random variables, with values in (k, )—B-convex spaces. We show that, without any limitation on the Banach spaces, the technique used by A. Beck allows to replace, in strong law of large numbers making use of conditions bearing on essential bounds, the hypothesis of independence by an hypothesis called conditional-independence-and-centering, which is weaker than both hypothesis of independence and of mutual symmetry; moreover, in several cases, one gets uniform strong laws of large numbers (for families of conditionally-independent-and-centered sequences). The results we get are compared with recent results of G. Pisier, obtained with type p spaces techniques.     

Set systems with no union of cardinality 0 modulom

Letq be a prime power. It is shown that for any hypergraph = {F ₁,...,F _d(q–1)+1} whose maximal degree isd, there exists Ø ₀ , such that 0 (modq).     

Singularities of the Green function of a random walk on a discrete group

LetX be a countable discrete group and let be an irreducible probability onX. The radius of convergence of the Green function is finite, and independent ofx. Let 0} \right\}$$ " align="middle" border="0"> be the period of . We show that for eachxX the singularities of the analytic functionzG(x; z) on the circle {z:|z|=} are precisely the points e ^2ik/d k=0, ...,d–1. In particular, is the only singularity on the circle in the aperiodic cased=1 (which occurs, for example, when (e)>0). This affirms a conjecture ofLalley [5]. When is symmetric, i.e., (x ^–1)=(x) for allxX, d is either 1 or 2. As another particular case of our result, we see that- is then a singularity ofzG (x; z) if and only ifd=2, in which caseX is bicolored. This answers a question ofde la Harpe, Robertson andValette [2].     

Über nullstellenfreie Gebiete von ζ(itk) (s)

Let ^(itk) (s) denote thek-th derivative of the Riemann Zeta-function,s=+it, ,t real numbers,k1 rational integers. Using ideas fromT. C. Titchmarsh and from a paper ofR. Spira, lower bounds are derived for |^(itk)(s)|, |^(itk)(1-s) for >1 and some infinitely many, sufficiently large values oft. Further let be an algebraic number of degreen and heightH; then a lower bound for |^(itk)(its)|, dependent onn, H, k is established for alln,H1,k3, 2+7k/4 and all realt.     

Convergence for Sequences of Functions and an Egorov Type Theorem

For every ordinal <₁ we define a new type of convergence for sequences of functions (-uniform pointwise) which is intermediate between uniform and pointwise convergence. Using this type of convergence we obtain an Egorov type theorem for sequences of measurable functions.     

On the method for numerical integration of Clenshaw and Curtis

Letf(x) be a function, defined and well behaved on the finite intervalaxb Clenshaw andCurtis [1] have given a method for the numerical integration off(x) froma tob, based on the approximation off(x) with a finite series of Chebyshev polynomials. We show that this method is asymptotically equivalent to using the trapezoïdal rule for integratingg(y)=f(cosy).     

Coexistence of infinite (*)-clusters II. Ising percolation in two dimensions

Summary We show a strong type of conditionally mixing property for the Gibbs states ofd-dimensional Ising model when the temperature is above the critical one. By using this property, we show that there is always coexistence of infinite (+ *)-and (–*)-clusters when is smaller than _c andh=0 in two dimensions. It is also possible to show that this coexistence region extends to some non-zero external field case, i.e., for every < _c, there exists someh _c()>0 such that |h|<h _c() implies the coexistence of infinite (*)-clusters with respect to the Gibbs state for (,h).work supported in part by Grant in Aid for Cooperative research no. 03302010, Grant in Aid for Scientific Research no. 03640056 and ISM Cooperative research program (91-ISM,CRP-3)To the memory of Professor Haruo Totoki     

Some functional inequalities and their Baire category properties

Summary In the paper we consider, from a topological point of view, the set of all continuous functionsf:I I for which the unique continuous solution:I – [0, ) of(f(x)) (x, (x)) and(x, (x)) (f(x)) (x, (x)), respectively, is the zero function. We obtain also some corollaries on the qualitative theory of the functional equation(f(x)) = g(x, (x)). No assumption on the iterative behaviour off is imposed.     

Bestimmung der Eigenwerte und Eigenvektoren einer Matrix mit Hilfe des Quotienten-Differenzen-Algorithmus

Summary Two previous papers (in Vol. V) describe theory and some applications of the quotient-difference (=QD-) algorithm. Here we give an extension which allows the determination of the eigenvectors of a matrix. Letx ₍₀₎ ¹ , ...,x ₍₀₎ ⁿ be a coordinate system in whichA has Jacobi form (such a system may be constructed with methods ofC. Lanczos orW. Givens). Then the QD-algorithm allows the construction of a sequence of coordinate systemsx ₍₂₎ ¹ , ...,x ₍₂₎ ⁿ , (=0, 1, 2, ...) which converge for to the system of the eigenvectors ofA.     

Approximating derivations on ideals ofC *-algebras

For each^*-derivation of a separableC ^*-algebraA and each >0 there is an essential idealI ofA and a self-adjoint multiplierx ofI such that (–ad(ix))|I< and x.     

Schwach irreduzible Markoff-Operatoren

For any weakly irreducible Markov operatorT on the space of continuous functions on a compact space and any continuous functionf we show that pointwise convergence of (T ⁿf) already implies uniform convergence. This improves a result ofJamison [2]. We also study convergence whenf is only measurable and give results related to the zero-two law. Finally two characterizations of uniform ergodicity for this class of operators are given. In particular a question ofLotz [4] is answered.     

Convergence of simultaneous Padé approximants to two dilogarithms

. .     

D λ -cycles in 3-cyclable graphs

Letk and be positive integers, andG a 2-connected graph of ordern with minimum degree and independence number. A cycleC ofG is called aD -cycle if every component ofG – V(C) has order smaller than. The graphG isk-cyclable if anyk vertices ofG lie on a common cycle. A previous result of the author is that if k 2, G isk-connected and every connected subgraphH ofG of order has at leastn +k ² + 1/k + 1 – vertices outsideH adjacent to at least one vertex ofH, thenG contains aD -cycle. Here it is conjectured that k-connected can be replaced by k-cyclable, and this is proved fork = 3. As a consequence it is shown that ifn 4 – 6, or ifG is triangle-free andn 8 – 10, thenG contains aD ₃-cycle orG , where denotes a well-known class of nonhamiltonian graphs of connectivity 2. As an analogue of a result of Nash-Williams it follows that ifn 4 – 6 and – 1, thenG is hamiltonian orG . The results are all best possible and compare favorably with recent results on hamiltonicity of graphs which are close to claw-free.     

The tree number of a graph with a given girth

A family of subtrees of a graphG whose edge sets form a partition of the edge set ofG is called atree decomposition ofG. The minimum number of trees in a tree decomposition ofG is called thetree number ofG and is denoted by(G). It is known that ifG is connected then(G) |G|/2. In this paper we show that ifG is connected and has girthg 5 then(G) |G|/g + 1. Surprisingly, the case wheng = 4 seems to be more difficult. We conjecture that in this case(G) |G|/4 + 1 and show a wide class of graphs that satisfy it. Also, some special graphs like complete bipartite graphs andn-dimensional cubes, for which we determine their tree numbers, satisfy it. In the general case we prove the weaker inequality(G) (|G| – 1)/3 + 1.     

The Reynolds number and large time behaviour for weak solutions of the Navier-Stokes equations

We consider time-dependent perturbationsu of R. Finn's stationary PR-solution of the Navier-Stokes equations, which converges to a constant vectorv as ¦x¦ .We investigate the large time behaviour ofu in the case, that the (energetic) Reynolds numberR _e of has the critical valueR _e =1. We show that perturbationsu with small initial kinetic energy and small driving force become smooth after finite time.     

On perfect graphs and polyhedra with (0, 1)-valued extreme points

LetC andA be (0, 1)-valued matrices with no zero columns. Fulkerson has shown that the extreme points of {x: Cx 1,x 0} are given by the rows ofA and their projections and the extreme points of {x: Ax 1,x 0} are given by the rows ofC and their projections if and only if the maximal rows ofC andA are the incidence vectors of maximal cliques and anticliques, respectively, of a perfect graph. This theorem is discussed and a new proof is given for the only if implication.Research partially supported by grant ENG 76-09936 from the National Science Foundation to Cornell University and by Sonderforschungsbereich 21 (DFG), Institut für Operations Research, Universität Bonn.