On the Countable Tightness of Product Spaces

In this paper, we discuss the countable tightness of products of spaces which are quotient simages of locally separable metric spaces, or k-spaces with a star-countable k-network. The main result is that the following conditions are equivalent： （1） b = ω1; （2） t（Sω×Sω1） 〉 ω; （3） For any pair （X, Y）, which are k-spaces with a point-countable k-network consisting of cosmic subspaces, t（X×Y）≤ω if and only if one of X, Y is first countable or both X, Y are locally cosmic spaces. Many results on the k-space property of products of spaces with certain k-networks could be deduced from the above theorem.     

可数Sober空间的若干性质北大核心

可数sober空间是sober空间的一种推广.本文讨论了可数sober空间的一些性质,特别地证明了以可数sober空间为对象、以连续映射为态射的范畴CSOB为完备范畴以及从任意空间到可数sober空间的连续映射空间为可数sober空间.     

关于具有局部可数sn-网的空间

In this paper,spaces with a locally countable sn-network are discussed.It is shown that a space with a locally countable sn-network iff it is an snf-countable space with a locally countable k-network.As its application,almost-open and closed mappings(or finite-to-one and closed mapping) preserve locally countable sn-networks,and a perfect preimage theorem on spaces with a locally countable sn-network is established.     

Mackey first countability and docile locally convex spaces

We define a generalization of Mackey first countability and prove that it is equivalent to being docile. A consequence of the main result is to give a partial affirmative answer to an old question of Mackey regarding arbitrary quotients of Mackey first countable spaces. Some applications of the main result to spaces such as inductive limits are also given.     

一类g-第一可数空间的刻画

本文引进了弱开映射,利用它把一类ｇ－第一可数空间刻画为度量空间在不同弱开映射下的象,特别地,本文肯定回答了Ｈｏｓｈｉｎａ的一个问题。     

德摩根一致代数可度量化的一个充要条件

讨论德摩根代数上的拟一致结构与度量之间的联系，给出德摩根一致代数可伪度量化的一个充分必要条件，所有结论均包含经典拓扑和模糊拓扑中的相应结果作为特例。     

关于弱拟第一可数空间的注记

给出一个弱拟第一可数空间成为弱第一可数空间的充要条件,证明了空间是弱第一可数空间当且仅当它是具有序列点Gδ性质的弱拟第一可数空间且不含Sw的闭拷贝.同时还证明了每一弱第一可数空间(弱拟第一可数空间)都是某个第一可数空间的商二到一映像(商可数到一映像),作为应用,部分回答了林寿(2007)的一个问题.     

关于一阶理论的型与可数模型的关系

引入了一类特殊的型的概念，较集中地论述了一阶理论的型与可数模型的关系．     

星可数网和局部S可数网

The concept of local s-countablity is introduced, and the relations between locally s-countable collections and star-countable collections are discussed.     

拟第一可数空间和弱拟第一可数空间

讨论了拟第一可数空间和弱拟第一可数空间的遗传性和可积性,给出了一些反例来说明这两类空间在某些拓扑运算下的不封闭性,同时研究了它们具有遗传性和可积性的充要条件.     

Number of infections suffered by a focal individual in a two‐strain SIS model with partial cross‐immunity

We study a stochastic model for the spread of two pathogen strains—termed type 1 and type 2—among a homogeneously mixing community consisting of a finite number of individuals. In the model, we assume partial cross‐immunity, exogenous streams of infection, and that the degree of severity of a newly infective individual depends on who this infective individual was infected by. The aim is to characterize the joint probability distribution of the numbers M₁ and M₂ of type‐1 and type‐2 infections suffered by a focal individual during an outbreak of the disease. We present iterative procedures for computing the probability mass function of (M₁,M₂) under the assumption that the initial state of the focal individual is known, and a numerical study of the model is performed to investigate the influence of certain key parameters on the spread of resistant bacteria in hospitals.     

Convergence in measure with respect to a matrix-valued measure and some matrix completion problems

For a matrix-valued measure M we introduce a notion of convergence in measure M, which generalizes the notion of convergence in measure with respect to a scalar measure and takes into account the matrix structure of M. Let S be a subset of the set of matrices of given size. It is easy to see that the set of S-valued measurable functions is closed under convergence in measure with respect to a matrix-valued measure if and only if S is a ρ-closed set, i.e. if and only if SP is closed for any orthoprojector P. We discuss the behaviour of ρ-closed sets under operations of linear algebra and the ρ-closedness of particular classes of matrices.     

On P-coherent endomorphism rings

A ring is called right P-coherent if every principal right ideal is finitely presented. Let M _R be a right R-module. We study the P-coherence of the endomorphism ring S of M _R . It is shown that S is a right P-coherent ring if and only if every endomorphism of M _R has a pseudokernel in add M _R ; S is a left P-coherent ring if and only if every endomorphism of M _R has a pseudocokernel in add M _R . Some applications are given.     

Divisibility among power GCD matrices and among power LCM matrices on three coprime divisor chains

Let h be a positive integer and S?=?{x ₁,?…?,?x _h } be a set of h distinct positive integers. We say that the set S is a divisor chain if x _σ(1) ∣?…?∣ x _σ(h) for a permutation σ of {1,?…?,?h}. If the set S can be partitioned as S?=?S ₁?∪?S ₂?∪?S ₃, where S ₁, S ₂ and S ₃ are divisor chains and each element of S _i is coprime to each element of S _j for all 1?≤?i?<?j?≤?3, then we say that the set S consists of three coprime divisor chains. The matrix having the ath power (x _i , x _j ) ^a of the greatest common divisor of x _i and x _j as its i, j-entry is called the ath power greatest common divison (GCD) matrix on S, denoted by (S ^?a ). The ath power least common multiple (LCM) matrix [S ^?a ] can be defined similarly. In this article, let a and b be positive integers and let S consist of three coprime divisor chains with 1?∈?S. We show that if a?∣?b, then the ath power GCD matrix (S ^?a ) (resp., the ath power LCM matrix [S ^?a ]) divides the bth power GCD matrix (S ^?b ) (resp., the bth power LCM matrix [S ^?b ]) in the ring M _h (Z) of h?×?h matrices over integers. We also show that the ath power GCD matrix (S ^?a ) divides the bth power LCM matrix [S ^?b ] in the ring M _h (Z) if a?∣?b. However, if a???b, then such factorizations are not true. Our results extend Hong's and Tan's theorems and also provide further evidences to the conjectures of Hong raised in 2008.     

Factorization of Markov Chains

Existence of following factorization is proved:

Geometric Convergence Rates for Time-Sampled Markov Chains

We consider time-sampled Markov chain kernels, of the form P = _n n P ⁿ . We prove bounds on the total variation distance to stationarity of such chains. We are motivated by the analysis of near-periodic MCMC algorithms.     

Minimal entropy and collapsing with curvature bounded from below

We show that if a closed manifold M admits an ℱ-structure (not necessarily polarized, possibly of rank zero) then its minimal entropy vanishes. In particular, this is the case if M admits a non-trivial S ¹-action. As a corollary we obtain that the simplicial volume of a manifold admitting an ℱ-structure is zero.?We also show that if M admits an ℱ-structure then it collapses with curvature bounded from below. This in turn implies that M collapses with bounded scalar curvature or, equivalently, its Yamabe invariant is non-negative.?We show that ℱ-structures of rank zero appear rather frequently: every compact complex elliptic surface admits one as well as any simply connected closed 5-manifold.?We use these results to study the minimal entropy problem. We show the following two theorems: suppose that M is a closed manifold obtained by taking connected sums of copies of S ⁴, ℂP ², ²,S ²×S ²and the K3 surface. Then M has zero minimal entropy. Moreover, M admits a smooth Riemannian metric with zero topological entropy if and only if M is diffeomorphic to S ⁴,ℂP ²,S ²×S ²,ℂP ²#  ² or ℂP ²# ℂP ². Finally, suppose that M is a closed simply connected 5-manifold. Then M has zero minimal entropy. Moreover, M admits a smooth Riemannian metric with zero topological entropy if and only if M is diffeomorphic to S ⁵,S ³×S ², then on trivial S ³-bundle over S ² or the Wu-manifold SU(3)/SO(3). Oblatum 13-III-2002 & 12-VIII-2002?Published online: 8 November 2002 G.P. Paternain was partially supported by CIMAT, Guanajuato, México.?J. Petean is supported by grant 37558-E of CONACYT.     

Strong Stability of Queues with Multiple Vacation of the Server

Abstract

The main purpose of this article is to use the strong stability method to approximate the characteristics of the M/G/1//N queue with server vacation by those of the classical M/G/1//N queue, when the rate of the vacations is sufficiently small. This last queue is simpler and more exploitable in practice. For this, we proof the stability conditions and next obtain quantitative stability estimates with an exact computation of constants. From these theoretical results, we can develop an algorithm in order to check the conditions of approximation. These results of approximation have a great practical and economic interest in reliability systems and maintenance optimization policy, when we consider elements with constant failure rate.