In previous investigations into the subject ([4], [9], [1]), p 0 quasi-MV algebras have been mainly viewed as preordered structures w.r.t. the induced preorder relation of their quasi-MV term reducts. In this paper, we shall focus on a di¤erent relation which partially orders cartesian p 0 quasi-MV algebras. We shall prove that: a) every cartesian p 0 quasi-MV algebra is embeddable into an inte...

We consider a birth-death process {X(t), t ≥ 0} on the positive integers for which the origin is an absorbing state with birth coefficients λn, n ≥ 0 and death coefficients μn, n ≥ 0. We recall that the series A = ∑∞ n=1 1 λnπn and the series S = ∑∞ n=1 1 λnπn ∑∞ i=n+1 πi, where {πn, n ≥ 1} is the potential coefficients. It is well-known fact (see van Doorn [13]) that if the A = ∞ and S < ∞, th...

Quasi-random (also called low discrepancy) sequences are a deterministic alternative to random sequences for use in Monte Carlo methods, such as integration and particle simulations of transport processes. The error in uniformity for such a sequence of N points in the s-dimensional unit cube is measured by its discrepancy, which is of size (log N) N-Ifor large N, as opposed to discrepancy of si...

This article is to contribute to the classification of finite-dimensional complex pointed Hopf algebras with Weyl groups of E6, E7, F4, G2. Many papers are about the classification of finite dimensional pointed Hopf algebras, for example, [AS98, AS02, AS00, AS05, He06, AHS08, AG03, AFZ, AZ07, Gr00, Fa07, AF06, AF07, ZZC, ZC]. In these research ones need the centralizers and character tables of ...

Setting of this paper is Bishop's constructive mathematics. For a relation σ on a set with apartness is called quasi-antiorder if it is consistent and cotransitive. The quasi-antiorder σ is complete if holds . 0 1 / = σ σ − ∩ In this paper the following assertion ‘A quasi-antiorder is the intersection of a collection of quasi-antiorders.’ is given.

For a T3.s-ordered space, certain families of maps are designated as "defining families." For each such defining family we construct the smallest T=-ordered compactification such that each member of the family can be extended to the compactification space. Each defining family also generates a quasi-uniformity on the space whose bicompletion produces the same T=-ordered

We show that for even quasi-concave objective functions the worst-case distribution, with respect to a family of unimodal distributions, of a stochastic programming problem is a uniform distribution. This extends the so-called “Uniformity Principle” of Barmish and Lagoa (1997) where the objective function is the indicator function of a convex symmetric set.