Cross-cuts in the power set of an infinite set

In the power setP(E) of a setE, the sets of a fixed finite cardinalityk form across-cut, that is, a maximal unordered setC such that ifX, Y E satisfyXY, X someX inC, andY someY inC, thenXZY for someZ inC. ForE=, ₁, and ₂, it is shown with the aid of the continuum hypothesis thatP(E) has cross-cuts consisting of infinite sets with infinite complements, and somewhat stronger results are proved for and ₁.The work reported here has been partially supported by NSERC Grant No. A8054.     

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 Gauss quadrature formulas with equal weights

Summary It is well known that the Chebyshev weight function (1–x ²)^–1/2 is the only weight function (up to a linear transformation) for which then point Gauss quadrature formula has equal weights for alln. In this paper we describe all weight functions for which thenm point Gauss quadrature formula has equal weights for alln, wherem is fixed.     

Stability of a spline collocation method for strongly elliptic multidimensional singular integral equations

Summary We consider a spline collocation method for strongly elliptic zero order pseudodifferential equationsp _gw Au=f on a cube =(0, 1) ^m . Utilizing multilinear spline functions which are zero at the boundary we collocate at the meshpoints inside . For classical strongly elliptic translation invariant pseudodifferential operators, we verify the stability of the considered collocation method inL ²(). Afterwards, form2 and a right hand sidefH ⁸(),s>m/2, we prove an asymptotic convergence estimate.The author has been supported by a grant of Deutsche Forschungsgemeinschaft under grant number Ko 634/32-1     

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

Rates of convergence and optimal spectral bandwidth for long range dependence

Summary For a realization of lengthn from a covariance stationary discrete time process with spectral density which behaves like ^1–2H as 0+ for 1/2<H<1 (apart from a slowly varying factor which may be of unknown form), we consider a discrete average of the periodogram across the frequencies 2j/n,j=1,..., m, wherem andm/n0 asn. We study the rate of convergence of an analogue of the mean squared error of smooth spectral density estimates, and deduce an optimal choice ofm.     

Even diameters of the classes W(r)H ω in the space C2π

For even values of n we find the exact values of the diameters d_n(W^(r)H) of the classes of 2-periodic functions ((t) is an arbitrary convex upwards modulus of continuity) in the space C₂. We find that d_2n(W^(r)H)=d_2n–1(W^(r)H) (n=1, 2, ... r=0, 1, 2, ...).Translated from Matematicheskie Zametki, Vol. 15, No. 3, pp. 387–392, March, 1974.The author expresses his thanks to N. P. Korneichuk for his interest in my work.     

Constraint decomposition algorithms in global optimization

Many global optimization problems can be formulated in the form min{c(x, y): x X, y Y, (x, y) Z, y G} where X, Y are polytopes in ^p , ⁿ , respectively, Z is a closed convex set in ^p+n, while G is the complement of an open convex set in ⁿ . The function c: ^p+n is assumed to be linear. Using the fact that the nonconvex constraints depend only upon they-variables, we modify and combine basic global optimization techniques such that some new decomposition methods result which involve global optimization procedures only in ⁿ . Computational experiments show that the resulting algorithms work well for problems with smalln.     

Lattice Polytopes Associated to Certain Demazure Modules of sl n + 1

Let w be an element of the Weyl group of sl _{n + 1}. We prove that for a certain class of elements w (which includes the longest element w₀ of the Weyl group), there exist a lattice polytope R ^l(w) , for each fundamental weight _i of sl _{n + 1}, such that for any dominant weight = _{i = 1} ⁿ a _{i i} , the number of lattice points in the Minkowski sum _w = _{i = 1} ⁿ a _{i i} ^w is equal to the dimension of the Demazure module E _w (). We also define a linear map A ^w : R ^l(w) P _Z R where P denotes the weight lattice, such that char E _w () = e e^–A(x) where the sum runs through the lattice points x of ^w .     

Subsets with Restricted Movement

Let G be a finite permutation group on a set with no fixed points in and let m and k be integers with 0 < m < k. For a finite subset of the movement of is defined as move() = max_gG| ^g \ |. Suppose further that G is not a 2-group and that p is the least odd prime dividing |G| and move() m for all k-element subsets of . Then either || k + m or k (7m – 5) / 2, || (9m – 3)/2. Moreover when || > k + m, then move() m for every subset of .     

Conjugation for polynomial mappings

We consider Keller's functions, namely polynomial functionsf:C ⁿ C ⁿ with detf(x)=1 at allx C ⁿ. Keller conjectured that they are all bijective and have polynomial inverses. The problem is still open.Without loss of generality assumef(0)=0 andf'(0)=I. We study the existence of certain mappingsh , > 1, defined by power series in a ball with center at the origin, such thath(0)=I andh (f(x))=h (x). So eachh conjugates f to its linear part I in a ball where it is injective.We conjecture that for Keller's functionsf of the homogeneous formf(x)=x +g(x),g(sx)=s ^dg(x),g(x)ⁿ=0,xC ⁿ,sC the conjugationh for f is anentire function.     

Homogenization of Some Elasticity Problems with Rapidly Oscillating Convex Constraints on Displacements

The problem of homogenization is considered for an elastic body occupying a perforated domain = obtained from a fixed domain and an -contraction of a 1-periodic domain .     

Some extensions of the Hewitt-Savage zero-one law

Summary Let denote the class of infinite product probability measures = ₁× ₂× defined on an infinite product of replications of a given measurable space (X, A), and let denote the subset of for which (A) =0 or 1 for each permutation invariant event A. Previous works by Hewitt and Savage, Horn and Schach, Blum and Pathak, and Sendler (referenced in the paper) discuss very restrictive sufficient conditions under which a given member , of belongs to . In the present paper, the class is shown to possess several closure properties. E.g., if and _{0 n} for some n 1, then ₀× ₁× ₂×.... While the current results do not permit a complete characterization of they demonstrate conclusively that is a much larger subset of than previous results indicated. The interesting special case X={0,1} is discussed in detail.Research supported by the National Science Foundation under grant No. MCS75-07556     

Constrained normalization of Hamiltonian systems and perturbed Keplerian motion

Summary Consider a Hamiltonian system (H, _2n ,). LetM be a symplectic submanifold of (_2n ,). The system (H, _2n ,) constrained toM is (HM, M, M). In this paper we give an algorithm which normalizes the system on _2n in such a way that restricted toM we have normalized the constrained system. This procedure is then applied to perturbed Kepler systems such as the lunar problem and the main problem of artificial satellite theory.

---

Zusammenfassung Wir betrachten ein Hamiltonisches System (H, _2n ,). SeiMein symplectisches Submanifold von (_2n ,). Das System (H, _2n ,), aufM beschränkt, ist (HM,M,M). In der vorliegenden Arbeit wird ein Algorithmus vorgeschlagen, der dieses System so auf _2n normalisiert, daß das aufM beschränkte System auch normalisiert ist. Dieser Algorithmus wird dann auf gestörte Keplersysteme, wie z. B. das Hill-sche Mondproblem und das Hauptproblem der Theorie der künstlichen Satelliten, angewendet.

     

p-Sets for random walks

Summary Let (,,P) be a probability space and let {itX _n ()} _n=1 be a sequence of i.i.d. random vectors whose state space isZ ^m for some positive integerm, where Z denotes the integers. Forn = 1, 2,... letS _n () be the random walk defined by . ForxZ ^m andU ^m, them-dimensional torus, let . Finally let be the characteristic function of the X's.In this paper we show that, under mild restrictions, there exists a set withP{ ₀ } = 1 such that for ₀ we have for all aU ^m,le0.As a consequence of this theorem, we obtain two corollaries. One is concerned with occupancy sets form-dimensional random walks, and the other is a mean ergodic theorem.Research supported by N.S.F. Grant # MCS 77-26809     

A comparison theorem for the mean exit time from a domain in a Kähler manifold

Let M be a Kähler manifold with Ricci and antiholomorphic Ricci curvature bounded from below. Let be a domain in M with some bounds on the mean and JN-mean curvatures of its boundary . The main result of this paper is a comparison theorem between the Mean Exit Time function defined on and the Mean Exit Time from a geodesic ball of the complex projective space ⁿ () which involves a characterization of the geodesic balls among the domain . In order to achieve this, we prove a comparison theorem for the mean curvatures of hypersurfaces parallel to the boundary of , using the Index Lemma for Submanifolds.Work partially supported by a DGICYT Grant No. PS87-0115-C03-01.     

On a Test Statistic for Linear Trend

Let {W(s)} _s 0 be a standard Wiener process. The supremum of the squared Euclidian norm Y (t)², of the R²-valued process Y(t)=(1/t W(t), {12/t ³ int_{0 t} s dW (s)– {3/t} W(t)), t [, 1], is the asymptotic, large sample distribution, of a test statistic for a change point detection problem, of appearance of linear trend. We determine the asymptotic behavior P {sup _t [, 1] Y(t)² > u as u , of this statistic, for a fixed (0,1), and for a moving = (u) 0 at a suitable rate as u . The statistical interest of our results lie in their use as approximate test levels.     

The complexity and construction of many faces in arrangements of lines and of segments

We show that the total number of edges ofm faces of an arrangement ofn lines in the plane isO(m ^2/3– n ^2/3+2 +n) for any>0. The proof takes an algorithmic approach, that is, we describe an algorithm for the calculation of thesem faces and derive the upper bound from the analysis of the algorithm. The algorithm uses randomization and its expected time complexity isO(m ^2/3– n ^2/3+2 logn+n logn logm). If instead of lines we have an arrangement ofn line segments, then the maximum number of edges ofm faces isO(m ^2/3– n ^2/3+2 +n (n) logm) for any>0, where(n) is the functional inverse of Ackermann's function. We give a (randomized) algorithm that produces these faces and takes expected timeO(m ^2/3– n ^2/3+2 log+n(n) log² n logm).The first author is pleased to acknowledge partial support by the Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and the National Science Foundation under Grant CCR-8714565. Work on this paper by the third author has been supported by Office of Naval Research Grant N00014-82-K-0381, by National Science Foundation Grant DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD-the Israeli National Council for Research and Development. A preliminary version of this paper has appeared in theProceedings of the 4th ACM Symposium on Computational Geometry, 1988, pp. 44–55.     

A study on Markovian maximality,change of probability and regularity

LetE be a rigid separable Banach space andm a bounded Borel measure onE. Let Ext denote the family of all gradient type Dirichlet forms onL ²(E, m) such that the domain of their extended generators (cf. Definition 1.1) contain the smooth functions. We prove three results. First, we prove the existence of the maximum element in Ext whenever Ext is not empty. Secondly, let be the maximum element in Ext (when Ext Ø) and let be a positive function in D(). We define a new measure =²·m and we consider the family Ext associated with the measure . We prove that if is associated with a diffusion process, Ext is not empty and its maximum element is also associated with a diffusion process. Finally, whenm is a centered Gaussian measure onE, we can prove that Ext contains exactly one element.     

Isometries of symmetric operator spaces associated with AFD factors of typeII and symmetric vector-valued spaces

If is a surjective isometry of the separable symmetric operator spaceE(M, ) associated with the approximately finite-dimensional semifinite factorM and if · _E(M,) is not proportional to · _{L 2}, then there exist a unitary operatorUM and a Jordan automorphismJ ofM such that(x)=UJ(x) for allxME(M, ). We characterize also surjective isometries of vector-valued symmetric spacesF((0, 1), E(M, )).Research supported by the Australian Research Council