Discrete Spectrum of Differential Operators in Spectral Gaps under Nonnegative Perturbations of High Order

Let A be a self-adjoint elliptic second-order differential operator, let (, ) be an inner gap in the spectrum of A, and let B(t) = A + tW ^* W, where W is a differential operator of higher order. Conditions are obtained under which the spectrum of the operator B(t) in the gap (, ) is either discrete, or does not accumulate to the right-hand boundary of the spectral gap, or is finite. The quantity N(, A, W, ), (, ), > 0 (the number of eigenvalues of the operator B(t) passing the point (, ) as t increases from 0 to ) is considered. Estimates of N(, A, W, ) are obtained. For the perturbation W ^* W of a special form, the asymptotics of N(, A, W, ) as + is given. Bibliography: 5 titles.     

Rates of convergence for the stability of large order statistics

Forr1 and eachnr, letM _nr be therth largest ofX ₁,X ₂, ...,X _n , where {X _n ,n1} is an i.i.d. sequence. Necessary and sufficient conditions are presented for the convergence of for all >0 and some –1, where {a _n } is a real sequence. Furthermore, it is shown that this series converges for all >–1, allr1 and all >0 if it converges for some >–1, somer1 and all >0.     

Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du maximum

Résumé Certaines méthodes directes et indirectes pour le calcul de Max {x ^t Ax, (x)1} sont étudiées.Les méthodes directes sont basées sur les propriétés particulières des normes ₁, ₂ et . Ces méthodes sont très simples mais ne s'appliquent qu'à certaines familles de matrices.La méthode indirecte est la méthode autoduale introduite dans [25, 26] avec = ₁. Dans ce cas, le choix du vecteur initial pour qu'il y ait convergence vers une solution optimale est largement discuté.

---

Some methods for computing the maximum of quadratic from on the unit ball of the maximum norm

Summary Some direct and indirect methods are studied for computing Max {x ^t Ax, (x)1} whereA is symmetric definite positive.Direct methods are constructed using particular properties of ₁, ₂, norms. These methods are very simple, but uniquely suitable to certains families of matrices.The indirect method is the autodual method, introduced in [25, 26, 29] with = ₁. In this case the problem of choosing an initial vector so that convergence of the iterative sequence occurs to an optimal solution is largely discussed.

     

On discrete and continuous norms in Paley-Wiener spaces and consequences for exponential frames

It is well known that for certain sequences {t_n}_n the usual L^p norm ·_p in the Paley-Wiener space PW ^p is equivalent to the discrete norm f_p,{tn}:=( _n=– |f(t_n)|^p)^1/p for 1 p = < and f_,{tn}:=sup _n|f(t_n| for p=). We estimate f_p from above by Cf_p, _n and give an explicit value for C depending only on p, , and characteristic parameters of the sequence {t_n}_n. This includes an explicit lower frame bound in a famous theorem of Duffin and Schaeffer.     

Limits of balayage measures

LetA be a subset of a balayage space (X,W) and a measure onX. It is shown that for every sequence _n of measures such that lim_nn and lim_{n n} ^A = the limit measure is of the formf+[(1-f)]^A for some (unique) Borel function 0f1_Cb(A). Furthermore, conditions are given such that any such functionf occurs.     

Sample path large deviations for super-Brownian motion

Summary We derive two large deviation principles of Freidlin-Wentzell type for rescaled super-Brownian motion. For one of the appearing rate functions an integral representation is given and interpreted as Kakutani-Hellinger energy. As a tool we develop estimates for the Laplace functionals of (historical) super-Brownian motion and certain maximal inequalities. Also it is shown that the Hölder norm of index <1/2 of the processtf, X _t possesses some finite exponential moments provided the functionf is smooth.This work was supported in part by the Graduiertenkolleg Algebraische, analytische und geometrische Methoden und ihre Wechselwirkung in der modernen Mathematik, Bonn     

Points cônes du mouvement brownien plan,le cas critique

Summary LetB=(B _t,t0) be a planar Brownian motion and let >0. For anyt0, the pointz=B _t is called a one-sided cone point with angle if there exist >0 and a wedgeW(,z) with vertexz and angle such thatB _sW(,z) for everys[t, t+]. Burdzy and Shimura have shown independently that one-sided cone points with angle exist when >/2 but not when      

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.     

Jensen inequalities for functions with higher monotonicities

Summary We investigate generalizations of the classical Jensen and Chebyshev inequalities. On one hand, we restrict the class of functions and on the other we enlarge the class of measures which are allowed. As an example, consider the inequality (J)(f(x) d) A (f(x) d, d d = 1. Iff is an arbitrary nonnegativeL _x function, this holds if 0, is convex andA = 1. Iff is monotone the measure need not be positive for (J) to hold for all convex withA = 1. If has higher monotonicity, e.g., is also convex, then we get a version of (J) withA < 1 and measures that need not be positive.     

Some Landau's type inequalities for infinitesimal generators

Summary Lett T(t) be a strongly continuous contraction semigroup on a complex Banach space and letA be its infinitesimal generator. We prove that, forx D(A ³), the following inequalities hold true: Ax³ 243/8 x²A ³ x, A ² x 24 xA ³ x². Ift T(t) is a contraction group (resp. cosine function) we get the analogous but better inequalities with constants 9/8 and 3 (resp. 81/40 and 72/25) instead of 243/8 and 24. We consider also uniformly bounded semigroups, groups and cosine functions.     

Complete problems withL-samplable distributions

The average case complexity classes P, L-samplable and NL, L-samplable are defined. We show that Deterministic Bounded Halting is complete for P, L-samplable and that Graph Reachability is complete for NL-samplable, both problems with a universal logspace samplable distribution.     

On the stability of semi-implicit methods for ordinary differential equations

The aim of this paper is to analyze the stability properties of semi-implicit methods (such as Rosenbrock methods,W-methods, and semi-implicit extrapolation methods) for nonlinear stiff systems of differential equations. First it is shown that the numerical solution satisfies y ₁ (h)y ₀, if the method is applied with stepsizeh to the systemy =Ay ( denotes the logarithmic norm ofA). Properties of the function(x) are studied. Further, conditions for the parameters of a semi-implicit method are given, which imply that the method produces contractive numerical solutions over a large class of nonlinear problems for sufficiently smallh. The restriction on the stepsize, however, does not depend on the stiffness of the differential equation. Finally, the presented theory is applied to the extrapolation method based on the semi-implicit mid-point rule.     

Efficient nonparametric estimation of distribution density in the basis of algebraic polynomials

A nonparametric estimatef ^* of an unknown distribution densityf W is called locally minimax iff it is minimax for all not too small neighborhoodsW _g ,g W, simultaneously, whereW is some dense subset ofW. Radaviius and Rudzkis proved the existence of such an estimate under some general conditions. However, the construction of the estimate is rather complicated. In this paper, a new estimate is proposed. This estimate is locally minimax under some additional assumptions which usually hold for orthobases of algebraic polynomial and is almost as simple as the linear projective estimate. Thus, it takes a form convenient for the construction of an adaptive estimator, which does not usea-priori information about the smoothness of the density. The adaptive estimation problem is briefly discussed and an unknown density fitting by Jacobi polynomials is investigated more explicitly.     

On the relation between Fourier and Leont’ev coefficients with respect to smirnov spaces

Yu. Melnik showed that the Leontev coefficients _f () in the Dirichlet series 2}}$$ " align="middle" border="0"> of a function f E ^p (D), 1 < p < , are the Fourier coefficients of some function F L ^p , ([0, 2]) and that the first modulus of continuity of F can be estimated by the first moduli and majorants in f. In the present paper, we extend his results to moduli of arbitrary order.Published in Ukrainskyi Matematychnyi Zhurnal, Vol. 56, No. 4, pp. 517–526, April, 2004.     

Black holes on the plane drawn by a Wiener process

Summary We say that the discD()R ², of radius , located around the origin isp-covered in timeT by a Wiener processW(·) if for anyzD() there exists a 0tT such thatW(t) is a point of the disc of radiusp, located aroundz. The supremum of those 's (0) is studied for which,D() isp-covered inT.     

An Erdős-Révész type law of the iterated logarithm for stationary Gaussian processes

Summary Let {X(t),t 0} be a stationary Gaussian process withEX(t)=0,EX ²(t)=1 and covariance function satisfying (i)r(t) = 1 2212;C |t | + o (|t|)ast0 for someC>0, 0<2; (ii)r(t)=0(t ^–2) as t for some >0 and (iii) sup_ts|r(t)|<1 for eachs>0. Put (t)= sup {s:0 s t,X(s) (2logs)^1/2}. The law of the iterated logarithm implies a.s. This paper gives the lower bound of (t) and obtains an Erds-Rèvèsz type LIL, i.e., a.s. if 0<<2 and . Applications to infinite series of independent Ornstein-Uhlenbeck processes and to fractional Wiener processes are also given.Research supported by the Fok Yingtung Education Foundation of China and by Charles Phelps Taft Postdoctoral Fellowship of the University of Cincinnati     

4-Dimensional compact projective planes with small nilradical

We consider 4-dimensional compact projective planes with a solvable 6-dimensional collineation group and with orbit type (2, 1), i.e. fixes a flagv W, acts transitively onL \{W} and fixes no point in the setW\{v}. We We prove a series of lemmas concerning the action of invariant subgroups of . These lemmas are applied to prove that the maximal connected nilpotent invariant subgroup of has dimension at least 4.Dedicated to Prof. H. Salzmann on the occasion of his 65th birthday     

Wave operators and similarity of certain non-normal one-parameter groups

This paper starts from a self-adjoint Schrödinger operator H(0) for three particles. If the interaction is dilation-analytic, H(0) has an analytic continuation H() (>0). G(t,) (–(±,a,) defined as strong limits, when t±, of t-dependent operators. The wave operators establish transformations under which the subgroups are similar to unitary groups. The scattering matrix determined by G(t,) is diagonal with respect to a.This work was supported in part by the National Science Foundation under grant DMS-8301096.     

On the convergence of the multivariate “homogeneous”qd-algorithm

The convergence of columns in the univariateqd-algorithm to reciprocals of polar singularities of meromorphic functions has often proved to be very useful. A multivariateqd-algorithm was discovered in 1982 for the construction of the so-called homogeneous Padé approximants.In the first section we repeat the univariate convergence results. In the second section we summarize the homogeneous multivariateqd-algorithm. In the third section a multivariate convergence result is proved by combining results from the previous sections. This convergence result is compared with another theorem for the general order multivariateqdg-algorithm. The main difference lies in the fact that the homogeneous form detects the polar singularities pointwise while the general form detects them curvewise.     

On spectral variations under bounded real matrix perturbations

Summary In this paper we investigate the set of eigenvalues of a perturbed matrix {ie509-1} whereA is given and ^{n × n}, ||< is arbitrary. We determine a lower bound for thisspectral value set which is exact for normal matricesA with well separated eigenvalues. We also investigate the behaviour of the spectral value set under similarity transformations. The results are then applied tostability radii which measure the distance of a matrixA from the set of matrices having at least one eigenvalue in a given closed instability domain _b.