On depth first search strees inm-out digraphs

We consider depth first search (DFS for short) trees in a class of random digraphs: am-out model. Let _i be thei ^th vertex encountered by DFS andL(i, m, n) be the height of _i in the corresponding DFS tree. We show that ifi/n asn, then there exists a constanta(,m), to be defined later, such thatL(i, m, n)/n converges in probability toa(,m) asn. We also obtain results concerning the number of vertices and the number of leaves in a DFS tree.     

On the approximation of singular integral equations by equations with smooth kernels

Singular integral equations with Cauchy kernel and piecewise-continuous matrix coefficients on open and closed smooth curves are replaced by integral equations with smooth kernels of the form(t–)[(t–) ²–n ² (t) ²]^–1,0, wheren(t), t , is a continuous field of unit vectors non-tangential to . we give necessary and sufficient conditions under which the approximating equations have unique solutions and these solutions converge to the solution of the original equation. For the scalar case and the spaceL ₂() these conditions coincide with the strong ellipticity of the given equation.This work was fulfilled during the first author's visit to the Weierstrass Institute for Applied Analysis and Stochastics, Berlin in October 1993.     

A graded scale of parametric families of distributions,and parameter estimates based on the sample mean

Summary Denote by _k a class of familiesP={P} of distributions on the line R¹ depending on a general scalar parameter , being an interval of R¹, and such that the moments µ₁()=xdP ,...,µ_2k ()=x ^2k dP are finite, ₁ (), ..., _k (), _k+1 () ..., _k () exist and are continuous, with ₁ () 0, and _j +1 ()= ₁ () _j () +[₂() -₁()²] _j ()/ ₁ (), J=2, ..., k. Let ₁=¯x=x ₁ + ... +x _n/n, ₂=x ₁ ² + ... +x _n ²/n, ..., _k =(x ₁ ^k + ... +x _n ^k/n denote the sample moments constructed for a sample x₁, ..., x_n from a population with distribution Pg. We prove that the estimator of the parameter by the method of moments determined from the equation ₁= ₁() and depending on the observations x₁, ..., x_n only via the sample mean ¯x is asymptotically admissible (and optimal) in the class _k of the estimators determined by the estimator equations of the form ₀ () + ₁ () ₁ + ... + _k () _k =0 if and only ifP _k .The asymptotic admissibility (respectively, optimality) means that the variance of the limit, as n (normal) distribution of an estimator normalized in a standard way is less than the same characteristic for any estimator in the class under consideration for at least one 9 (respectively, for every ).The scales arise of classes _{1 2}... of parametric families and of classes _{1 2} ... of estimators related so that the asymptotic admissibility of an estimator by the method of moments in the class _k is equivalent to the membership of the familyP in the class _k .The intersection consists only of the families of distributions with densities of the form h(x) exp {C₀() + C₁() x } when for the latter the problem of moments is definite, that is, there is no other family with the same moments ₁ (), ₂ (), ...Such scales in the problem of estimating the location parameter were predicted by Linnik about 20 years ago and were constructed by the author in [1] (see also [2, 3]) in exact, not asymptotic, formulation.Translated from Problemy Ustoichivosti Stokhasticheskikh Modelei, pp. 41–47, 1981.     

On the singular graph and the Weyr characteristic of anM-matrix

LetA be anM-matrix in standard lower block triangular form, with diagonal blocksA _ii irreducible. LetS be the set of indices such that the diagonal blockA is singular. We define the singular graph ofA to be the setS with partial order defined by > if there exists a chain of non-zero blocksA _i, A_ij, , A_l.Let ₁ be the set of maximal elements ofS, and define thep-th level _p ,p = 2, 3, , inductively as the set of maximal elements ofS \( _{1 p-1}). Denote by _p the number of elements in _p . The Weyr characteristic (associated with 0) ofA is defined to be (A) = ( ₁, ₂,, _h ), where ₁ + + _p = dim KerA ^p ,p = 1, 2, , and _h > 0, _h+1 = 0.Using a special type of basis, called anS-basis, for the generalized eigenspaceE(A) of 0 ofA, we associate a matrixD withA. We show that(A) = ( ₁, , _h) if and only if certain submatricesD _p,p+1 ,p = 1, , h – 1, ofD have full column rank. This condition is also necessary and sufficient forE(A) to have a basis consisting of non-negative vectors, which is a Jordan basis for –A. We also consider a given finite partially ordered setS, and we find a necessary and sufficient condition that allM-matricesA with singular graphS have(A) = ( ₁, , _h). This condition is satisfied ifS is a rooted forest.The work of the second-named author was partly supported by the National Science Foundation, under grant MPS-08618 A02.     

Compact interval spaces in which all closed subsets are homeomorphic to clopen ones,I

A topological space X whose topology is the order topology of some linear ordering on X, is called an interval space. A space in which every closed subspace is homeomorphic to a clopen subspace, is called a CO space. We regard linear orderings as topological spaces, by equipping them with their order topology. If L and K are linear orderings, then L ^*, L+K, L·K denote respectively the reverse orderings of L, the ordered sum of L and K and the lexicographic order on L×K (so ·2=+ and 2·=). Ordinals are considered as linear orderings, and cardinals are initial ordinals. For cardinals , 0, let L(, )= + 1 + ^* . Main theorem. Let X be a compact interval space. Then X is a CO space if and only if X is homeomorphic to a space of the form + 1 + _i L( _i , _i ), where is any ordinal, n, for every ii, _i are regular cardinals and _{i i}, and if n>0, then max({ _i: i}) · . This first part is devoted to show the following result. Theorem: If X is a compact interval CO space, then X is a scattered space (that means that every subspace of X has an isolated point).Supported by the Université Claude-Bernard (Lyon-1), the Ben Gurion University of the Negev, and the C.N.R.S.: UPR 9016Supported by the City of Lyon     

Approximation in the mean by bounded analytic functions

Let 1<p< and . LetC _q denote the Bessel capacity in the plane. Let be the set of homomorphisms ofH (G) such that (z)= and letNP denote the set of points in G for which is not a peak set forH (G). In this note, we show that ifC _q (NP)=0, thenH (G) is dense inL _a ^p (G), the Bergman space overG.Partially supported by NSF DMS-9401234     

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.     

The local nature of Δ-coloring and its algorithmic applications

Given a connected graphG=(V, E) with |V|=n and maximum degree such thatG is neither a complete graph nor an odd cycle, Brooks' theorem states thatG can be colored with colors. We generalize this as follows: letG-v be -colored; then,v can be colored by considering the vertices in anO(log n) radius aroundv and by recoloring anO(log n) length augmenting path inside it. Using this, we show that -coloringG is reducible inO(log³ n/log) time to (+1)-vertex coloringG in a distributed model of computation. This leads to fast distributed algorithms and a linear-processorNC algorithm for -coloring.A preliminary version of this paper appeared as part of the paper Improved Distributed Algorithms for Coloring and Network Decomposition Problems, in theProceedings of the ACM Symposium on Theory of Computing pages 581–592, 1992. This research was done when the authors were at the Computer Science Department of Cornell University. The research was supported in part by NSF PYI award CCR-89-96272 with matching funds from UPS and Sun Microsystems.     

Une variante à la Coxeter du groupe de Steinberg

LetG _n ()be the semi-direct product of the symmetric groupS _n by the Steinberg groupSt _n ()of a ringWe first prove thatG _n ()has a Coxeter-type presentation. The canonical morphism St _n () GL _n ()extends to a group homo G_n() GL _n ()We next determine the kernel of for n = We also give an expression for the generator of the algebraic K group K ₂(Z)of the integers in terms of permutation matrices.     

Uniqueness of kernel functions of the heat equation

We consider the heat equation on ={(x,t) R ²;t<0, ¦x¦<(–t)} and give the uniqueness of kernel functions at the infinity (see Theorem 5). For the proof, we examine the continuity of the density of the parabolic measure onD ={(x,t);t>x}, closely related to . By this theorem, we can decide the Martin boundary of (<1) with respect to the heat equation.     

The quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms

Given a vector of real numbers=(₁,... _d ) ^d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C⁽ⁿ⁾():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] ^d [0, 1] ^d and A:[0,1] ^d GL(d+1,), which compute convergent matrices C⁽ⁿ⁾())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C⁽ⁿ⁾() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C⁽ⁿ⁾⁽⁾ one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.     

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.     

Perturbation of the Laplacian by the Coulomb potential and a point interaction in L p (ℝ)3

Perturbations of -+/|x| (with >0) by a point interaction centered at zero are defined in L ^p(³). This is done for 3/20 (³{0}), such that the extension is the negative generator of an analytic semigroup on L ^p(³).     

S-Continued Fraction Method for the Investigation of a Complex Dielectric Constant of Two-Components Composite

The aim of this contribution is to examine the S-continued fraction method of obtaining bounds on the effective dielectric constant _e of a two-phase composite for the case where the dielectric coefficients ₁and ₂ of both components are either complex or real. The starting point for our study is a power expansion of _e (z) at(z)=0 (z)=₂/₁-1. The obtained S-continued fraction bounds have an interesting mathematical structure convenient for theoretical and numerical investigations of _e. They also agree with the earlier estimations reported by Bergman and Milton. Specific examples of calculation of bounds on _e by theS-continued fraction method are also provided.     

Irregular but nonfractal drums andn-dimensional weyl conjecture

In this paper, we study the asymptotics of the spectrum of the Dirichlet (or Neumann) Laplacian in a bounded open set R ⁿ (n 1) with irregular but nonfractal boundary. We give a partial resolution of the Weyl conjecture, i.e. for the counting functionN _i ()(i=0 : Dirichlet;i=1 : Neumann), we have got a precise estimate of the remainder term÷ _i ()=() –N _i () for large, where() is the Weyl term. This implies that for the irregular but nonfractal drum , not only the volume || _n is spectral invariant but also the area of boundary || _n–1 might be spectral invariant as well.Partially supported by the National Natural Science Foundation of China and the Grant of Chinese State Education Committee.     

Comparison results for the lower tail of Gaussian seminorms

Let =( _n ) be i.i.d.N(0, 1) random variables andq(x), q(x):R [0, ) be seminorms. We investigate necessary and sufficient conditions that the ratio ofP(q()<) andP(q()<) goes to a positive constant as 0⁺. We give satisfactory answers forl ₂-norms and also some results for sup-norms andl _p-norms. Some applications are given to the rate of escape of infinite dimensional Brownian motion, and we give the lower tail of the Ornstein-Uhlenbeck process and a weighted Brownian bridge under theL ₂-norms.     

Global Attractivity of the Equilibrium of a Nonlinear Difference Equation

The authors consider the nonlinear difference equation x_n+1=x_n+x_n-kf(x_n-k),n=0,1,(0.1) where (0,1), k 0,1, and f C¹[[0,), [0,)] with f(x) < 0.They give sufficient conditions for the unique positive equilibrium of (0.1) to be a global attractor of all positive solutions. The results here are somewhat easier to apply than those of other authors. An application to a model of blood cell production is given.     

A Note on a Boundary Value Problem

In this note, we prove that, for Robins boundary value problem, a unique solution exists if f_x(t, x, x), f_x(t, x, x), (t), and (t) are continuous, and f_x -(t), f_x -(t), 4(t) ² + ²(t) ++ 2(t), and 4(t) ² + ²(t) + 2(t).AMS Subject Classification (2000) 34B15     

Propriété de stabilité de la fonction extrémale relative

Nous donnons une caractérisation des domaines DX pour lesquels la fonction extrémale relative ^*(,E,D) a la propriété de stabilité pour tout ED, i.e. lim _k^*(,E,D _k )=^*(,E,D), ED. Ensuite, nous étudions la relation entre cette propriété et les enveloppes pluripolaires. Nous concluons par quelques remarques sur la propriété de stabilité lim _k^*(,E _k ,D)=^*(,E,D).     

Interval stability and interval covering property in finite posets

Given a finite ranked posetP, let (P) be the maximum size of a subset ofP such that no two elements of it belong simultaneously to some interval ofP and let (P) be the minimum number of intervals covering all elements ofP. We say thatP has the strong interval stability property (resp. the strong interval covering property) if for each subposetP induced by consecutive levels ofP, i.e.,P=P _(l)...P _(u), one has (P)=max{|P _(l)|, |P _(u)|} (resp. (P)=max{|P _(l)|, |P _(u)|}).We prove these properties for several classes of posets and discuss some general facts concerning the numbers (P) and (P), e.g., NP-completeness and min-max relations.