Monotone Nonincreasing Random Fields on Partially Ordered Sets. I

For an arbitrary poset H and measure ρ on H × _R (where _R is the real axis), we construct a monotone decreasing stochastic field η_ρ and compute its finite-dimensional distributions. In the case where H is a Λ-semilattice and the measure ρ satisfies additional conditions, we compute various characteristics of the field η_ρ such as the expectation of the field value at a point, variance of the field value at a point, and correlation function of the field. The described construction of random fields gives a new method for constructing positive definite functions on posets. Bibliography: 6 titles.__________Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 301, 2003, pp. 92–143.     

The Probability Content of Cones in Isotropic Random Fields

This paper provides computable representations for the evaluation of the probability content of cones in isotropic random fields. A decomposition of quadratic forms in spherically symmetric random vectors is obtained and a representation of their moments is derived in terms of finite sums. These results are combined to obtain the distribution function of quadratic forms in spherically symmetric or central elliptically contoured random vectors. Some numerical examples involving the sample serial covariance are provided. Ratios of quadratic forms are also discussed.     

Regulating Functions on Partially Ordered Sets

We study the so-called Skorokhod reflection problem (SRP) posed for real-valued functions defined on a partially ordered set (poset), when there are two boundaries, considered also to be functions of the poset. The problem is to constrain the function between the boundaries by adding and subtracting nonnegative nondecreasing (NN) functions in the most efficient way. We show existence and uniqueness of its solution by using only order theoretic arguments. The solution is also shown to obey a fixed point equation. When the underlying poset is a σ-algebra of subsets of a set, our results yield a generalization of the classical Jordan–Hahn decomposition of a signed measure. We also study the problem on a poset that has the structure of a tree, where we identify additional structural properties of the solution, and on discrete posets, where we show that the fixed point equation uniquely characterizes the solution. Further interesting posets we consider are the poset of real n-vectors ordered by majorization, and the poset of n × n positive semidefinite real matrices ordered by pointwise ordering of the associated quadratic forms. We say a function on a poset is of bounded variation if it can be written as the difference of two NN functions. The solution to the SRP when the upper and lower boundaries are the identically zero function corresponds to the most efficient or minimal such representation of a function of bounded variation. Minimal representations for several important functions of bounded variation on several of the posets mentioned above are determined in this paper. A version of this paper was presented at the Applied Probability Workshop, in the Mathematisches Forschungsinstitut Oberwolfach, December 2003 (organized by V. Schmidt, A. Hordijk and F. Baccelli); the authors are grateful for the invitation which gave them the opportunity to make substantial progress in finalizing this work in the uniquely wonderful research atmosphere at Oberwolfach. Research supported by DARPA grant N66001-00-C-8062, ONR grant N00014-1-0637 and NSF grant ECS 0123512. This work was supported in part by NSF grant ANI-9903495, the INTAS-00-265 project, and a Carathéodory research award.     

Splittability for Partially Ordered Sets

A topological space X is said to be splittable over a class P of spaces if for every AX there exists continuous f:XYP such that f(A)f(XA) is empty. A class P of topological spaces is said to be a splittability class if the spaces splittable over P are precisely the members of P. We extend the notion of splittability to partially ordered sets and consider splittability over some elementary posets. We identify precisely which subsets of a poset can be split along over an n-point chain. Using these results it is shown that the union of two splittability classes need not be a splittability class and a necessary condition for P to be a splittability class is given.     

Rogers Semilattices of Finite Partially Ordered Sets

It is proved that the principal sublattice of a Rogers semilattice of a finite partially ordered set is definable. For this goal to be met, we present a generalization of the Denisov theorem concerning extensions of embeddings of Lachlan semilattices to ideals of Rogers semilattices.     

Quasi-shadowing Property on Random Partially Hyperbolic Sets

In this paper we investigate the quasi-shadowing property for C~1 random dynamical systems on their random partially hyperbolic sets. It is shown that for any pseudo orbit {xk}_(-∞)~(+∞)on a random partially hyperbolic set there exists a "center" pseudo orbit {yk}_(-∞)~(+∞)shadowing it in the sense that yk+1 is obtained from the image of yk by a motion along the center direction. Moreover, when the random partially hyperbolic set has a local product structure, the above "center" pseudo orbit {yk}_(-∞)~(+∞)can be chosen such that yk+1 and the image of yk lie in their common center leaf.     

Fixed Point Theorems on Chain Complete Partially Ordered Sets

In this paper, we extend the results of Tarski, Abian and Brown on the completeness of lattices by fixed point theorems, to partially ordered sets or (Po sets) with chain completeness property. We also sharpen some of the existing results on completeness of lattices and fixed-point theorems. We also provide counter examples to some of the claims of R. Taskovic to disprove his theorem.Milan R. Taskovic claims to have proved this theorem but his proof is based on a false argument. In fact most of the contentions of Milan R. Taskovic in [4] are factually incorrect. Actually, reviewer of Taskovics paper has pointed out some of his inaccurate observations. See Mathematical Reviews No. 90b:06007, 06A10.     

Wishart Distributions on Homogeneous Cones

The classical family of Wishart distributions on a cone of positive definite matrices and its fundamental features are extended to a family of generalized Wishart distributions on a homogeneous cone using the theory of exponential families. The generalized Wishart distributions include all known families of Wishart distributions as special cases. The relationships to graphical models and Bayesian statistics are indicated.     

Generalized Monotone Operators on Dense Sets

In the present work we show that the local generalized monotonicity of a lower semicontinuous set-valued operator on some certain type of dense sets ensures the global generalized monotonicity of that operator. We achieve this goal gradually by showing at first that the lower semicontinuous set-valued functions of one real variable, which are locally generalized monotone on a dense subsets of their domain are globally generalized monotone. Then, these results are extended to the case of set-valued operators on arbitrary Banach spaces. We close this work with a section on the global generalized convexity of a real valued function, which is obtained out of its local counterpart on some dense sets.     

Bitopologies on Totally Ordered Sets

We study the category of ray bispaces, that is, the category whose objects are totally ordered sets with two topologies, each having a subbase of rays and so that the resulting bitopological space is pairwise weakly symmetric, and whose morphisms are the pairwise continuous functions. In contrast with the purely topological results of [5], we show that, (1) such spaces are utterly normal and hence monotonically normal (in the sense of [6]), and (2) (Intermediate Value Theorem) the pairwise continuous image of a pairwise connected bitopological space in a selective ray bispace is an interval. We also obtain conditions for the equality of the de Groot dual (see [4]) and the ray dual (see [5]) of a ray topology and show that a selective ray topology is compact if and only if it is skew compact.     

Definability in Substructure Orderings,II: Finite Ordered Sets

Let \({{\uppercase {\mathcal{p}}}} \) be the ordered set of isomorphism types of finite ordered sets (posets), where the ordering is by embeddability. We study first-order definability in this ordered set. We prove among other things that for every finite poset P, the set \(\{p,p^{\partial}\}\) is definable, where p and \(p^{\partial}\) are the isomorphism types of P and its dual poset. We prove that the only non-identity automorphism of \({{\uppercase {\mathcal{p}}}}\) is the duality map. Then we apply these results to investigate definability in the closely related lattice of universal classes of posets. We prove that this lattice has only one non-identity automorphism, the duality map; that the set of finitely generated and also the set of finitely axiomatizable universal classes are definable subsets of the lattice; and that for each member K of either of these two definable subsets, \(\{K,K^{\partial}\}\) is a definable subset of the lattice. Next, making fuller use of the techniques developed to establish these results, we go on to show that every isomorphism-invariant relation between finite posets that is definable in a certain strongly enriched second-order language \(\textup{\emph L}_2\) is, after factoring by isomorphism, first-order definable up to duality in the ordered set \({{\uppercase {\mathcal{p}}}}\). The language \(\textup{\emph L}_2\) has different types of quantifiable variables that range, respectively, over finite posets, their elements and order-relation, and over arbitrary subsets of posets, functions between two posets, subsets of products of finitely many posets (heteregenous relations), and can make reference to order relations between elements, the application of a function to an element, and the membership of a tuple of elements in a relation.     

适合无限维实零点定理的序域之结构II

在本文的第二部分中,我们研究了适合无限维实零点定理的序域的结构。通过嵌入,我们证明了,一个序域适合无限维实零点定理,当且仅当它的实闭包同构于域Ｒ｛Γ｝的某个具有无限维逼近性质的子域。这里Γ是一个无裂缝的可除序群,Ｒ｛Γ｝是指数在Γ中,系数为实数的形式幂级数域。     

On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets

We study which infinite posets have simple cofinal subsets such as chains, or decompose canonically into such subsets. The posets of countable cofinality admitting such a decomposition are characterized by a forbidden substructure; the corresponding problem for uncountable cofinality remains open.     

Group Codes Defined on Totally Ordered Sets

ＧｒｏｕｐＣｏｄｅｓＤｅｆｉｎｅｄｏｎＴｏｔａｌｌｙＯｒｄｅｒｅｄＳｅｔｓＷａｎＺｈｅｘｉａｎ（万哲先）（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｓＳｃｉｅｎｃｅ，ＡｃａｄｅｍｉａＳｉｎｉｃａ，Ｂｅｉｊｉｎｇ，１０００８０ａｎｄＤｅｐａｒｔｍｅｎｔｏｆＩｎ...     

L-拟序集上的广义Alexandroff拓扑

在一类特殊的 L -拟序集上定义广义 Alexandroff拓扑 ,限制到通常的拟序集上就是 Alexandroff拓扑 ,并且该拓扑可以由其上的一族 Alexandroff拓扑取并得到。还证明任意一个拓扑空间的拓扑都可以表示为某个 L-拟序集上的广义 Alexandroff拓扑。     

A Result on Vector Variational Inequalities with Polyhedral Constraint Sets

In this note, by using some well-known results on properly efficient solutions of vector optimization problems, we show that the Pareto solution set of a vector variational inequality with a polyhedral constraint set can be expressed as the union of the solution sets of a family of (scalar) variational inequalities.