Irreducible filters and sober spaces

A filterF on a convergence space is called irreducible, iff the set convF of convergence points ofF belongs toF. A space is sober, iff for every irreducible filterF there is a unique point x with convF=conv x. The categorySob-Conv of sober convergence spaces is a full productive, but not a reflective subcategory of the categoryConv of convergence spaces and continuous maps. For a topological space (X,t) the following are equivalent: (i) for every irreducible filterF on (X,t) there is a point x withF=x (ii) (X,t) is both sober and T_D (iii) every subspace of (X,t) is sober (iv) every topological space finer than (X,t) is sober (v) whenever (Y,s) is a T_o-space whose latticeO(Y,s) of open sets is isomorphic toO(x,t), then (Y,s)(X,t). The categorySob-T ₁ß of sober T₁-spaces is the greatest epi-reflective subcategory ofTop consisting of sober spaces, moreoverSob-T ₁ß is a dis-connectedness in the sense of Preuß- Arhangelskii-Wiegandt (generated by all irreducible spaces), henceSob-T ₁ is (extremal epi)-reflective inTop. It is strictly between T₁ and T₂ and different from various sorts of weak Hausdorffness discussed in the literature.     

Cut-elimination and interpolation for Ω-logic

In 1978, Girard introduced-logic to generalize-logic. The basic category of-logic is the categoryON of ordinals. For geometric structure reasons, Girard changed the basic categoryON into the more general categoryWF of well-founded orders (1983). The logic he obtained was called-logic. Here, we extend (unpublished) results of-logic to-logic.     

∑II∑ threshold formulas

A II formula has the form, where eachL is either a variable or a negated variable. In this paper we study the computation of threshold functions by II formulas. By combining the proof of the Fredman-Komlós bound [5, 10] and a counting argument, we show that fork andn large andkn/2, every II formula computing the threshold functionT _k ⁿ has size at least exp . Fork andn large andkn ^2/3, we show that there exist II formulas for computingT _k ⁿ with size at most exp .     

Limits of certain iterates of Post-Widder operators

The paper is a study of the limiting behaviour of the [n t]-th iterates of the well-known Post-Widder operatorsL _{n, x} used in the real inversion of the Laplace transform. It is shown that the limiting operators constitute a semigroup T _t;t0 of class (C ₀) on a family C _,; , >0 of Banach spaces. Applications of the semigroup structure lead to a pointwise saturation theorem forL _{n, x} and a characterization of convex functions inC _, through an inequality involving the action ofL _{n, x}.     

Mouvement moyen et système dynamique gaussien

Summary In the situation of the classical mean motion, we haven planets moving in the plane, planetk+1 being a satellite of planetk. A classcal result then states that planetn has a mean motion,i.e. its mean angular speed between time 0 and timet has a limit whent. We show in this article that any real gaussian dynamical system can be interpreted as the limit of this situation, whenn. From a given nonatomic probability measure on [0,], we construct a transformationT of the complex brownian path (B _u)_0u1 which preserves Wiener measure.T is defined as the limit of a sequenceT _n, whereT _n acts as the motion of 2ⁿ planets. In this way we get a real gaussian dynamical system, whose spectral measure is the symetric probability on [-,] obtained from . The transformationT can be inserted in a flow (T ^t) _t, and the orbitstZ _t=B ₁T ^t still have almost surely a mean motion, which is the mean of .     

Circle orders,N-gon orders and the crossing number

Let ={P ₁,...,P _m } be a family of sets. A partial order P(, <) on is naturally defined by the condition P _i <P _j iff P _i is contained in P _j . When the elements of are disks (i.e. circles together with their interiors), P(, <) is called a circle order; if the elements of are n-polygons, P(, <) is called an n-gon order. In this paper we study circle orders and n-gon orders. The crossing number of a partial order introduced in [5] is studied here. We show that for every n, there are partial orders with crossing number n. We prove next that the crossing number of circle orders is at most 2 and that the crossing number of n-gon orders is at most 2n. We then produce for every n4 partial orders of dimension n which are not circle orders. Also for every n>3, we prove that there are partial orders of dimension 2n+2 which are not n-gon orders. Finally, we prove that every partial order of dimension 2n is an n-gon order.This research was supported under Natural Sciences and Engineering Research Council of Canada (NSERC Canada) grant numbers A2507 and A0977.     

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 .     

Bayesian Sampling Plans for Exponential Distribution Based on Type I Censoring Data

We study variable sampling plans for the exponential distribution based on type I censoring data. Using a suitable loss function, a Bayesian variable sampling plan (n _B , t _B , _B ) is derived. For certain prior distributions and loss functions, the numerical values of the Bayesian sampling plans and the associated minimum Bayes risks are tabulated. In terms of Bayes risks, comparisons between the proposed Bayesian sampling plans (n _B , t _B , _B ) and the Bayesian variable sampling plans (n ₀, t ₀, ^L _{T 0}) of Lam (1994, Ann. Statist., 22, 696–711) have been made. The numerical results indicate that under the same conditions, the proposed Bayesian sampling plan is superior to that of Lam in the sense that the Bayes risk of (n _B , t _B , _B ) is less than that of (n ₀, t ₀, ^L _{T 0}).     

Cyclic Ostrom Spreads

We call a transitive permutation group G stable if every non-trivial orbit B, of a point stabilizerG _O , is such that some element of G-G _O leaves invariant B {O}. We characterize all finite affine planes of order n that admit a collineation group G that acts, on the points of , as a stable 3/2-transitive permutation group of rank n+2 . The planes obtained are precisely what we have called cyclic Ostrom planes; these are translation planes whose associated spreads are obtained from the Desarguesian spread , of order n=p^r , by replacing a partial subspread of by another consisting of GF(p) subspaces that are unions of kern orbits. All André spreads, as well as many other spreads, are examples of cyclic Ostrom spreads.     

Convergence of epigraphs and of sublevel sets

Let LSC(X) be the set of the proper lower semicontinuous extended real-valued functions defined on a metric spaceX. Given a sequence f _n in LSC(X) and a functionf LSC(X), we show that convergence of f _n tof in several variational convergence modes implies that for each , the sublevel set at height off is the limit, in the same variational sense, of an appropriately chosen sequence of sublevel sets of thef _n, at height _n approaching . The converse holds true whenever a form of stability of the sublevel sets of the limit function is verified. The results are obtained by regarding a hyperspace topology as the weakest topology for which each member of an appropriate family of excess functionals is upper semicontinuous, and each member of an appropriate family of gap functionals is lower semicontinuous. General facts about the representation of hyperspace topologies in this manner are given.     

Compact groups having almost discrete orbit hypergroups

LetG be a compact group of automorphism acting continuously on a compact groupH. Then the orbit spaceH ^G is a compact hypergroup. We characterize, all solvable groupsH and compact automorphism groupsG for whichH ^G is almost discrete, i.e.,H ^G is homeomorphic to the one-point-compactification of . It turns out that thenH is isomorphic either to the infinite direct product (p) of the cyclic groups (p) or to _p ⁿ ( _p the group of allp-adic numbers) for some primep and some . The almost discrete orbit hypergroupsH ^G are determined explicitly for some examples.     

Injective Hulls of T0 Topological Fibre Spaces

We investigate the existence of injective hulls (with respect to the class of embeddings) in the categories Top ₀/B of T₀ topological fibre spaces over B. We prove that, if f:AB has a restriction to the image injective in Top ₀/f(A), (A,f) has an injective hull in Top ₀/B if and only if f(A) is locally closed in B, where A denotes the union of non-indiscrete fibres of f.     

Opérateurs différentiels associés à certaines représentations unitaires d'un groupe de Lie résoluble exponentiel

Soient G = exp g un groupe de Lie résoluble exponentiel et H = exp h un sous-groupe connexe de G. Soient un caractère unitaire de H et = Ind_H ^G. Soit D(G/H) l'algèbre des opérateurs différentiels G-invariants sur G/H. Une question posée par Duflo et Corwin-Greenleaf consiste à voir si la finitude des multiplicités de est équivalente à la commutativité de D (G/H). Nous répondons positivement à cette question quand H est normal dans G. Lorsque H n'est pas normal, nous préparons le terrain pour d'espaces homogènes nilpotents et nous répondons à la question dans différents cas. Nous étudions finalement l'algèbre D (G) ^H , des opérateurs différentiels qui laissent l'espace des vecteurs C de invariant et qui commuttent avec l'action de H sur cet espace.     

Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice

Let _i(L), _i(L^*) denote the successive minima of a latticeL and its reciprocal latticeL ^*, and let [b₁,..., b _n ] be a basis ofL that is reduced in the sense of Korkin and Zolotarev. We prove that and, where and _j denotes Hermite's constant. As a consequence the inequalities are obtained forn7. Given a basisB of a latticeL in ^m of rankn andx ^m , we define polynomial time computable quantities(B) and(x,B) that are lower bounds for ₁(L) and(x,L), where(x,L) is the Euclidean distance fromx to the closest vector inL. If in additionB is reciprocal to a Korkin-Zolotarev basis ofL ^*, then ₁(L) _n ^* (B) and.The research of the second author was supported by NSF contract DMS 87-06176. The research of the third author was performed at the University of California, Berkeley, with support from NSF grant 21823, and at AT&T Bell Laboratories.     

Tests for a given linear structure of the mean direction of the langevin distribution

This paper deals with Watson statistic T _w and likelihood ratio (LR) statistic T _l for testing hypothesis H _0s: V (a given s-dimensional subspace) based on a sample of size n from a p-variate Langevin distribution M _p(, ). Asymptotic expansions of the null and non-null distributions of T _w and T _l are obtained when n is large. Asymptotic expressions of those powers are also obtained. It is shown that the powers of them are coincident up to the order n ^-1 when is unknown.     

On the existence of wave operators for the Klein-Gordon equation

The problem of existence of wave operators for the Klein-Gordon equation ( _t ² –+²+iV_1t+V₂)u(x,t)=0 (x R ⁿ,t R, n3, >0) is studied where V₁ and V₂ are symmetric operators in L₂(R ⁿ) and it is shown that conditions similar to those of Veseli-Weidmann (Journal Functional Analysis 17, 61–77 (1974)) for a different class of operators are also sufficient for the Klein-Gordon equation.     

On the lowest eigenvalue of the Laplacian for the intersection of two domains

IfA andB are two bounded domains in _n and (A), (B) are the lowest eigenvalues of – with Dirichlet boundary conditions then there is some translate,B _x, ofB such that (AB _x)<(A)+(B). A similar inequality holds for .There are two corollaries of this theorem: (i) A lower bound for sup _x {volume (AB _x)} in terms of (A), whenB is a ball; (ii) A compactness lemma for certain sequences inW ^1,p ( _n ).Work partially supported by U.S. National Science Foundation grant PHY-8116101 A01. AMS(MOS) Classification: 35P15     

Future independent times and Markov chains

Summary A random timeT is a future independent time for a Markov chain (X _n ) ₀ ifT is independent of (X _T+n ) _n ^/ =0 and if (X _T+n ) _n ^/ =0 is a Markov chain with initial distribution and the same transition probabilities as (X _n ) ₀ . This concept is used (with the conditional stationary measure) to give a new and short proof of the basic limit theorem of Markov chains, improving somewhat the result in the null-recurrent case.This work was supported by the Swedish Natural Science Research Council and done while the author was visiting the Department of Statistics, Stanford University     

Matrix functions with arbitrarily prescribed left and right partial indices

We prove that ifn2 and , are two given vectors inZ ⁿ, then there exists a matrix function inL ^n×n (T) which has a right Wiener-Hopf factorization inL ² with the partial indices and a left Wiener-Hopf factorization inL ² with the partial indices .     

Blow-up rates for parabolic systems

Let ⁿ be a bounded domain andB _R be a ball in ⁿ of radiusR. We consider two parabolic systems: ut=u +f(), i= +g(u) in × (0,T) withu=v=0 on × (0,T) andu _t =u, v _t =v inB _r × (0,T) withe/v=f (v), e/v=g(u) onB _R × (0,T). Whenf(v) andg(u) are power law or exponential functions, we establish estimates on the blow-up rates for nonnegative solutions of the systems.