Some strong limit theorems for -mixing sequences of random variables

In this paper, we study the almost sure convergence for -mixing sequences of random variables. As a result, the authors improve the corresponding results of Yang [Yang, Shanchao, 1998. Some moment inequalities for partial sums of random variables and their applications. Chinese Sci. Bull. 43 (17), 1823–1827], Gan [Gan, Shixin, 2004. Almost sure convergence for -mixing random variable sequences. Statist. Probab. Lett. 67, 289–298], and Wu [Wu, Qunying, 2001. Some convergence properties for -mixing sequences. J. Engng. Math. 18 (3), 58–64 (in Chinese)]. We extend the classical Khintchine–Kolmogorov convergence theorem, the Marcinkiewicz strong law of large numbers, and the three series theorem for independent sequences of random variables to -mixing sequences of random variables without necessarily adding any extra conditions.     

On the strong convergence rate for positively associated random variables

For sequences of the positively associated random variables which are strictly weaker than the classical associated random ones introduced by Esary et al. (1967) [7], strong convergence rate is obtained, which reaches the available one for independent random variables in terms of Berstein type inequality. Further, we give the corresponding precise asymptotics with respect to the rate mentioned above, which extend and improve the relevant results in Fu (2009) [8].     

Games with 1-backtracking

We associate with any game G another game, which is a variant of it, and which we call . Winning strategies for have a lower recursive degree than winning strategies for G: if a player has a winning strategy of recursive degree 1 over G, then it has a recursive winning strategy over , and vice versa. Through we can express in algorithmic form, as a recursive winning strategy, many (but not all) common proofs of non-constructive Mathematics, namely exactly the theorems of the sub-classical logic Limit Computable Mathematics (Hayashi (2006) [6], Hayashi and Nakata (2001) [7]).     

Effective codescent morphisms, amalgamations and factorization systems

The paper deals with the question whether it is sufficient, when investigating the problem of the effectiveness of a descent morphism, to restrict the consideration only to the descent data (C,γ,ξ), where γ lies in a certain morphism class. The notion of a factorization system and the dual to the amalgamation property in the sense of Kiss, Marki, Pröhle and Tholen play the key role in our discussion.It is shown that a category inherits from a category the property that all descent morphisms are effective if either is regular and is a full coreflective, closed under pullbacks of certain epimorphisms, subcategory of or is regular, has coequalizers and there exists a topological functor . This implies that in the category of topological spaces, all regular monomorphisms are effective codescent morphisms (the result of Mantovani). The same is shown to be valid also for the categories of compact Hausdorff topological spaces, normal topological spaces, Banach spaces, (quasi-)uniform spaces, and (quasi-)proximity spaces. Moreover, the effectiveness of all codescent morphisms is established for the categories of Hausdorff topological spaces and (complete) metric spaces. The internal characterization of such morphisms p:B→E is given for the category of Hausdorff topological spaces, in the case of compact B and regular E.     

Equivariant bifurcation index

We consider a bifurcation index defined in terms of the degree for G-equivariant gradient maps, see G?ba (1997) [21], Rybicki (1994) [22], Rybicki (2005) [23], where G is a real, compact, connected Lie group and U(G) is the Euler ring of G, see tom Dieck (1977) [29], tom Dieck (1987) [30].The main result of this article is the following:

     

Progressive Type II censored order statistics for multivariate observations

For a sequence of independent and identically distributed random vectors , i=1,2,…,n, we consider the conditional ordering of these random vectors with respect to the magnitudes of , where N is a p-variate continuous function defined on the support set of X₁ and satisfying certain regularity conditions. We also consider the Progressive Type II right censoring for multivariate observations using conditional ordering. The need for the conditional ordering of random vectors exists for example, in reliability analysis when a system has n independent components each consisting of p arbitrarily dependent and parallel connected elements. Let the vector of life lengths for the ith component of the system be , where denotes the life length of the jth element of the ith component. Then the first failure in the system occurs at time , and for this case . In this paper we introduce the conditionally ordered and Progressive Type II right-censored conditionally ordered statistics for multivariate observations and to study their distributional properties.     

Compactifications of rational maps, and the implicit equations of their images

In this paper, we give different compactifications for the domain and the codomain of an affine rational map f which parameterizes a hypersurface. We show that the closure of the image of this map (with possibly some other extra hypersurfaces) can be represented by a matrix of linear syzygies. We compactify into an (n−1)-dimensional projective arithmetically Cohen-Macaulay subscheme of some . One particular interesting compactification of is the toric variety associated to the Newton polytope of the polynomials defining f. We consider two different compactifications for the codomain of f: and . In both cases we give sufficient conditions, in terms of the nature of the base locus of the map, for getting a matrix representation of its closed image, without involving extra hypersurfaces. This constitutes a direct generalization of the corresponding results established by Laurent Busé and Jean-Pierre Jouanolou (2003) [12], Laurent Busé et al. (2009) [9], Laurent Busé and Marc Dohm (2007) [11], Nicolás Botbol et al. (2009) [5] and Nicolás Botbol (2009) [4].     

Multivariate stress-strength reliability model and its evaluation for coherent structures

Consider a system which has n independent components (or subsystems) each consisting of m dependent elements. Let , i=1,2,…,n denote the random strength vector of the ith component, where denotes the random strength of the jth element of the ith component. The elements of the components are subjected to a common random stress over time. In this paper, we setup a multivariate stress-strength model based on the conditional ordering between s and and evaluate the reliability of coherent structures in this setup.     

A supplement to precise asymptotics in the law of the iterated logarithm

Let be a sequence of real-valued i.i.d. random variables with E(X)=0 and E(X²)=1, and set , n?1. This paper studies the precise asymptotics in the law of the iterated logarithm. For example, using a result on convergence rates for probabilities of moderate deviations for obtained by Li et al. [Internat. J. Math. Math. Sci. 15 (1992) 481-497], we prove that, for every b∈(−1/2,1],

     

Cut elimination and strong separation for substructural logics: An algebraic approach

We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existing work on (associative) substructural logics over the full Lambek Calculus (see, for example, Ono (2003) [34], Galatos and Ono (2006) [18], Galatos et al. (2007) [17]). We present a Gentzen-style sequent system that lacks the structural rules of contraction, weakening, exchange and associativity, and can be considered a non-associative formulation of . Moreover, we introduce an equivalent Hilbert-style system and show that the logic associated with and is algebraizable, with the variety of residuated lattice-ordered groupoids with unit serving as its equivalent algebraic semantics.Overcoming technical complications arising from the lack of associativity, we introduce a generalized version of a logical matrix and apply the method of quasicompletions to obtain an algebra and a quasiembedding from the matrix to the algebra. By applying the general result to specific cases, we obtain important logical and algebraic properties, including the cut elimination of and various extensions, the strong separation of , and the finite generation of the variety of residuated lattice-ordered groupoids with unit.     

Multivariate order statistics via multivariate concomitants

Let denote a set of n independent identically distributed k-dimensional absolutely continuous random variables. A general class of complete orderings of such random vectors is supplied by viewing them as concomitants of an auxiliary random variable. The resulting definitions of multivariate order statistics subsume and extend orderings that have been previously proposed such as norm ordering and N-conditional ordering. Analogous concepts of multivariate record values and multivariate generalized order statistics are also described.     

Tree maps having chain movable fixed points

In this paper we discuss some basic properties of chain reachable sets and chain equivalent sets of continuous maps. It is proved that if f:T→T is a tree map which has a chain movable fixed point v, and the chain equivalent set CE(v,f) is not contained in the set P(f) of periodic points of f, then there exists a positive integer p not greater than the number of points in the set End([CE(v,f)])−Pv(f) such that fp is turbulent, and the topological entropy . This result generalizes the corresponding results given in Block and Coven (1986) [2], Guo et al. (2003) [6], Sun and Liu (2003) [10], Ye (2000) [11], Zhang and Zeng (2004) [12]. In addition, in this paper we also consider metric spaces which may not be trees but have open subsets U such that the closures are trees. Maps of such metric spaces which have chain movable fixed points are discussed.     

Ill-posedness of Kawahara equation and Kaup-Kupershmidt equation

In this paper we consider the Cauchy problems for the Kawahara equation and the Kaup-Kupershmidt equation. By using the general well-posedness principle introduced by I. Bejenaru and T. Tao (2006) [1], we prove that the Kawahara equation is ill-posed for the initial data in Hs(R) with and the Kaup-Kupershmidt equation is ill-posed for the initial data in Hs(R) with .     

Tail behavior of random sums of negatively associated increments

Let be a sequence of negatively associated random variables with a common distribution function and finite expectation and let τ be a nonnegative integer-valued random variable independent of . In this paper we give unified form for the asymptotic behavior of the random sums in the case of . The results extend the earlier results of Aleškevi?iené et al. (2008) [2].