Animals, Trees and Renewal Sequences: Corrigendum

IN SECTION 3 of the above we omitted to mention aperiodicity.The period p of the pseudo renewal sequence {a_n: n > 0} isgiven by p = g.c.d. {n > 1: a_n > 0}. We are only concernedwith aperiodic renewal sequences (i.e. where p = 1). As it standsTheorem 3.1 is incorrect and should be restated as: THEOREM 3.1 If a = (a_n: n = 0,1,...) is an aperiodic pseudo-renewalsequence its limit a satisfies g_na^–n > 1 where a^–1 is to be interpreted as; if a = 0.     

On approximation theorems for controllability of non-linear parabolic problems

^** Email: anil{at}math.iitb.ac.in^*** Email: mcj{at}math.iitb.ac.in^**** Email: akp{at}math.iitb.ac.in In this paper, we consider the following control system governedby the non-linear parabolic differential equation of the form: [graphic: see PDF] where A is a linear operator with dense domain and f(t, y)is a non-linear function. We have proved that under Lipschitzcontinuity assumption on the non-linear function f(t, y), theset of admissible controls is non-empty. The optimal pair (u^*,y^*) is then obtained as the limit of the optimal pair sequence{(u_n^*, y_n^*)}, where u_n^* is a minimizer of the unconstrainedproblem involving a penalty function arising from the controllabilityconstraint and y_n^* is the solution of the parabolic non-linearsystem defined above. Subsequently, we give approximation theoremswhich guarantee the convergence of the numerical schemes tooptimal pair sequence. We also present numerical experimentwhich shows the applicability of our result.     

Correction: the Embedding of Radical Rings in Simple Radical Rings

As G. M. Bergman has pointed out, in the proof of the lemmaon p. 187, we cannot conclude that $$\stackrel{\¯}{S}$$is universal in the sense stated. However, the proof can becompleted as follows: Any element of $$\stackrel{\¯}{S}$$can be obtained as the first component of the solution u ofa system (A–I)u+a = 0, (1) where A S_n, a ⁿS and A–I has an inverse over L. SinceS is generated by R and k{s}, A can (by the last part of Lemma3.2 of [1]) be taken to be linear in these arguments, say A= A₀ + sA1, where A₀ R_n, A₀ R_n, A₁ K_n. Multiplying by (I–sA₁)^–1,we reduce this equation to the form (S_vB_v–I)u+a=0, (2) with the same solution u as before, where B_v R_n, s_v k{s}¹and a ⁿS. Now consider the retraction S k{s} (3) obtained by mapping R 0. If we denote its effect by x x^*,then (2) goes over into an equation –I.v + a^* 0, (4) which clearly has a unique solution v in k{s}; therefore theretraction (3) can be extended to a homomorphism $$\stackrel{\¯}{S}$$ k{s}, again denoted by x x^*, provided we can show that u₁^*does not depend on the equation (1) used to define it. Thisamounts to showing that if an equation (1), or equivalently(2), has the solution u₁ = 0, then after retraction we get v₁= 0 in (4), i.e. a₁^* = 0. We shall use induction on n; if u₁= 0 in (2), then by leaving out the first row and column ofthe matrix on the left of (2), we have an equation for u₂,...,u_n and by the induction hypothesis, their values after retractionare uniquely determined. Now from (2) we have where B = (b_ij^v). Applying ^* and observing that b_ij^vR, we seethat a₁ ^* = 0, as we wished to show. The proof still appliesfor n = 1, so we have a well-defined mapping $$\stackrel{\¯}{S}$$ k{s}, which is a homomorphism. Now the proof of the lemma canbe completed as before.     

An error bound for the modified successive overrelaxation method

In this paper we consider the modified successive overrelaxation(MSOR)methodto appropriate the solution of the linear system D^-1/2 Ax =D^-1/2b, where A is a symmetric, positive definite and consistentlyordered matrix and D is a diagonal matrix with the diagonalidentical to that of A. The main purpose of this paper is to obtain some theoreticalresults, namely a bound for the norm of _n = v –v_n in termsof the norms _n –v_n-1, _n+1 –v_n and their inner product,where v =D^-1/2 x and v_n is the nth iteration vector, obtainedusing the (MSOR)method.     

A Note on the WKB Method for Difference Equations

We consider the asymptotic solution of the second-order differenceequation y_n + 1 –2y_n + y_n–1 + Q_ny_n = 0, where Q_n= N^–Q(n/N), 0 < < 2, Q(s) being a differentiablefunction of s, and N a large parameter such that Q(n/N) variesby order unity as n varies by order N. A discrete WKB methodis proposed, the form of the asymptotic expansion being similarto that used in the conventional WKB method. A particular Q(s)is studied, for which results of the discrete WKB method arein agreement with the results from the approach due to Bremmer(1951).     

A Class of Pencils of Matrices

A linear machine is one in which the time dependent input yis related to the output z by P(D). z = S(D). y where P andS are polynomials in D = d/dt with constant coefficients. Fornumerical computation it is necessary to replace this relationby a set of simultaneous first order differential equationsand this paper shows how to construct such equations by methodswhich extend the results of Gilder (1961). Attention is restrictedto those sets of equations that are of a special form (see (1))which is characterized by the matrix operating on the dependentvariables. This matrix forms a pencil, being linear in D, andthree theorems are given to show how such matrix pencils maybe constructed from the polynomials. The theorems also statethat any matrix pencil with the required properties can be transformedinto the canonical forms given in the theorems by pre- and post-multiplicationby suitable constant non-singular matrices. Thus the variablesof any set of equations having the required properties are linearcombinations of the variables of the equations given by thetheorems. In the paper it is assumed that the degree of P(D)is greater than that of S(D), as otherwise z would be replacedby z₁+Q(D) . y, where Q is the quotient of S(D)/P(D). Also,as the algebriac manipulations are independent of the natureof the polynomials, D is replaced by an indeterminate x andthe coefficients considered to be from an arbitrary field. Fortechnical reasons we rename y and z, y_o and y_n–_m respectively.     

Controllability of a system of parabolic equations with non-diagonal diffusion matrix

In this paper we give a necessary and sufficient algebraic conditionfor the approximate controllability of the following systemof parabolic equations with Dirichlet boundary condition: {z_t = D z + b₁(x)u₁ + ··· + b_m(x)u_m, t 0, z ⁿ, z = 0, on where is a sufficiently smooth bounded domain in ^N, b_i L²(;ⁿ), the control functions u_i L²(0, t₁; ); i = 1, 2, ..., mand D is an n x n non-diagonal matrix whose eigenvalues aresemi-simple with positive real part. This algebraic conditionis checkable since it is given in terms of the n_j x m matricesDP_j and P_jB, i.e. Rank [P_jBDP_jBD²P_jB··· D^n_j–1 P_jB]= n_j, where P_jBu = P_jb₁u₁ + ··· + P_jb_mu_m. Finally,this result can be applied to those systems of partial differentialequations that can be rewritten as a diffusion system (see deOliveira, 1998).     

The sound field due to a periodic array of forced wave-bearing strips

A compressible fluid in a two-dimensional half-space (y >0) is bounded by a plane surface (y = 0) which is acousticallyhard except for a set of periodically arranged strips S_n givenby nd – a < x < nd + a, y = 0 with n = 0, 1, 2,....The velocity potential Re {(x, y)exp(–it)} satisfies theHelmholtz wave equation in the fluid region y>0, with /y= 0 on the plane y = 0, x S_n. The boundary condition on thepistons S_n is taken to have the form where the prescribed forcing function V(x) is the same on eachstrip, so that V(x + nd) = V(x), and the operators L and M arepolynomial functions of the second derivative ²/x². This boundarycondition includes the possibilities of an elastic plate, amembrane, or an impedance surface for S_n. When the separationdistance d is much greater than the strip width 2a and wavelength2/k, the problem is reduced to that of finding the potential_p due to a single piston S_o set in a rigid baffle, togetherwith a potential _c subject to a similar condition with forcingfunctions exp (ikx) in place of V(x). The problem is generalizedto allow for the possibility of a phased forcing function V(x),such that V(x + nd) = exp (ißnd)V(x), where ßis a given constant.     

On the Local and Superlinear Convergence of Quasi-Newton Methods

This paper presents a local convergence analysis for severalwell-known quasi-Newton methods when used, without line searches,in an iteration of the form to solve for x^* such that Fx^* = 0. The basic idea behind theproofs is that under certain reasonable conditions on x_o, Fand x_o, the errors in the sequence of approximations {H_k} toF'(x^*)^–1 can be shown to be of bounded deterioration inthat these errors, while not ensured to decrease, can increaseonly in a controlled way. Despite the fact that H_k is not shownto approach F'(x^*)^–1, the methods considered, includingthose based on the single-rank Broyden and double-rank Davidon-Fletcher-Powellformulae, generate locally Q-superlinearly convergent sequences{x_k}.     

Random Sequences Interpolating with Probability One

Let {_n} be a sequence of independent random variables uniformlydistributed on [0, 2], and let {r_n} be a sequence of (deterministic)radii in [0, 1). Form points of the unit disc putting z_n = r_ne_n.We characterize those sequences {r_n} for which {z_n} is an interpolatingsequence with probability one.     

A Characterization of Finite Soluble Groups by Laws in Two Variables

Define a sequence (s_n) of two-variable words in variables x,y as follows: s₀(x, y) = x, s_n+1(x,y)=[s_n(x, y]^–y, s_n(x,y)for n 0. It is shown that a finite group G is soluble if andonly if s_n is a law of G for all but finitely many values ofn. 2000 Mathematics Subject Classification 20D10, 20D06.     

The cyclic Barzilai--Borwein method for unconstrained optimization

^** Email: dyh{at}lsec.cc.ac.cn^*** Email: hager{at}math.ufl.edu^**** Email: klaus.schittkowski{at}uni-bayreuth.de^***** Email: hzhang{at}math.ufl.edu In the cyclic Barzilai–Borwein (CBB) method, the sameBarzilai–Borwein (BB) stepsize is reused for m consecutiveiterations. It is proved that CBB is locally linearly convergentat a local minimizer with positive definite Hessian. Numericalevidence indicates that when m > n/2 3, where n is the problemdimension, CBB is locally superlinearly convergent. In the specialcase m = 3 and n = 2, it is proved that the convergence rateis no better than linear, in general. An implementation of theCBB method, called adaptive cyclic Barzilai–Borwein (ACBB),combines a non-monotone line search and an adaptive choice forthe cycle length m. In numerical experiments using the CUTErtest problem library, ACBB performs better than the existingBB gradient algorithm, while it is competitive with the well-knownPRP+ conjugate gradient algorithm.     

BENFORD'S LAW FOR THE 3x + 1 FUNCTION

Benford's law (to base B) for an infinite sequence {x_k : k 1} of positive quantities x_k is the assertion that {log_B x_k: k 1} is uniformly distributed (mod 1). The 3x + 1 functionT(n) is given by T(n) = (3n + 1)/2 if n is odd, and T(n) = n/2if n is even. This paper studies the initial iterates x_k = T^(k)(x₀)for 1 k N of the 3x + 1 function, where N is fixed. It showsthat for most initial values x₀, such sequences approximatelysatisfy Benford's law, in the sense that the discrepancy ofthe finite sequence {log_B x_k : 1 k N} is small.     

Long-Time Behavior of Solutions of the Fast Diffusion Equations with Critical Absorption Terms

This paper is devoted to the long-time behavior of solutionsto the Cauchy problem of the porous medium equation u_t = (u^m)– u^p in Rⁿ x (0,) with (1 – 2/n)₊ < m < 1and the critical exponent p = m + 2/n. For the strictly positiveinitial data u(x,0) = O(1 + |x|)^–k with n + mn(2 –n + nm)/(2[2 – m + mn(1 – m)]) k < 2/(1 –m), we prove that the solution of the above Cauchy problem convergesto a fundamental solution of u_t = (u^m) with an additional logarithmicanomalous decay exponent in time as t .     

Regularity of Rees Algebras

Let B = k[x₁, ..., x_n] be a polynomial ring over a field k,and let A be a quotient ring of B by a homogeneous ideal J.Let m denote the maximal graded ideal of A. Then the Rees algebraR = A[m t] also has a presentation as a quotient ring of thepolynomial ring k[x₁, ..., x_n, y₁, ..., y_n] by a homogeneousideal J^*. For instance, if A = k[x₁, ..., x_n], then Rk[x₁,...,x_n,y₁,...,y_n]/(x_iy_j–x_jy_i|i, j=1,...,n). In this paper we want to compare the homological propertiesof the homogeneous ideals J and J^*.     

Isoperimetric Inequalities for Volumes Associated with Decomposable Forms

We give sharp estimates for volumes in Rⁿ defined by decomposableforms. In particular, we show that if F(X₁..., X_n) = (_i1X₁ + ... + _inX_n) is a decomposableform with _ij C, degree d > n, and discriminant D_F 0, andif V_F is the volume of the region {xRⁿ:|F(x)| 1}, then |D_F|^(d–n)!/d!V_F C_n, where C_n is the value of |D_F|^(d–n)!/d! V_F whenF(X₁..., X_n) = X₁... X_n(X₁ +... + X_n); moreover, we show thatthe sequence {C_n} is asymptotic to (2/)e^1–(2n)ⁿ. Theseresults generalize work of the first author on binary formsand will likely find application in the enumeration of solutionsof decomposable form inequalities.     

具有缺项系数的几类解析函数族的性质

S*表示所有在单位圆盘 D 内解析且满足条件 f(0)=f′ (0)-1=0的星形函数族, K 表示所有在 D内解析且满足条件 f(0)=f′ (0)-1=0 的凸函数族, P 表示所有在 D 内解析且满足条件p(0)=1, Rep(z)>0 的函数族. 设P_n={p(z): p(z)=1+a_nzⁿ+a_n+1zⁿ⁺¹+…∈ P}, S*_n={f (z): f(z)=z+a_nzⁿ+a_n+1zⁿ⁺¹+…∈ S*}, K_n={f (z): f (z)=z+a_nzⁿ+a_n+1zⁿ⁺¹+…∈ K}. L_Sn*={g(z)=ln f(z)/z, f ∈ S_n*}, 其中对数函数取使得ln1=0的那个单值解析分支. 该文研究了函数族S_n^*, K_n和L_Sn*的性质, 找出了解析函数族L_Sn*的极值点与支撑点,并对S*_n与K_n的极值点和支撑点作了一些探讨.     

Analytic Tridiagonal Reproducing Kernels

The paper characterizes the reproducing kernel Hilbert spaceswith orthonormal bases of the form {(a_n,0+a_n,1z+...+a_n,Jz^J)zⁿ,n 0}. The primary focus is on the tridiagonal case where J= 1, and on how it compares with the diagonal case where J =0. The question of when multiplication by z is a bounded operatoris investigated, and aspects of this operator are discussed.In the diagonal case, M_z is a weighted unilateral shift. Itis shown that in the tridiagonal case, this need not be so,and an example is given in which the commutant of M_z on a tridiagonalspace is strikingly different from that on any diagonal space.     

On regularity of a quasiconformal mapping at a point of maximal stretching

Local behaviour of a K-quasiconformal mapping f at a point z₀of maximal stretching is studied. A sufficient condition forthe existence of the finite limit lim(f(z) – f(z₀))/(z– z₀)|z – z₀|^1/K–1 as z z₀, and a criterionfor z₀ to be a point of maximal stretching are given.     

On Mason's conjecture concerning interpolation by polynomials in z and z-1 on an annulus

A polynomial of degree n in z^–1 and n – 1 in z isdefined by an interpolation projection from the space A(N) of functions f analytic in thecircular annulus ^–1<|z| and continuous on its boundaries|z|=^–1, . The points of interpolation are chosen to coincidewith the n roots of zⁿ=–n and the n roots of zⁿ=^–n.We prove Mason's conjecture that the corresponding Lebesguefunction attains its maximal value on the inner circle. We alsoestimate the bound of the Lebesgue constant . It is proved that the following estimate for theoperator norm holds: where _n, is the Lebesgue constant of Gronwall for equally spacedinterpolation on a circle by a polynomial of degree n.