An arithmetical theorem for partially ordered sets

The simplest multiplicative systems in which arithmetical ideas can be defined are semigroups. For such systems irreducible (prime) elements can be introduced and conditions under which the fundamental theorem of arithmetic holds have been investigated (Clifford (3)). After identifying associates, the elements of the semigroup form a partially ordered set with respect to the ordinary division relation. This suggests the possibility of an analogous arithmetical result for abstract partially ordered sets. Although nothing corresponding to product exists in a partially ordered set, there is a notion similar to g.c.d. This is the meet operation, defined as greatest lower bound. Thus irreducible elements, namely those elements not expressible as meets of proper divisors can be introduced. The assumption of the ascending chain condition then implies that each element is representable as a reduced meet of irreducibles. The central problem of this thesis is to determine conditions on the structure of the partially ordered set in order that each element have a unique such representation.

Part I contains preliminary results and introduces the principal tools of the investigation. In the second part, basic properties of the lattice of ideals and the connection between its structure and the irreducible decompositions of elements are developed. The proofs of these results are identical with the corresponding ones for the lattice case (Dilworth (2)). The last part contains those results whose proofs are peculiar to partially ordered sets and also contains the proof of the main theorem.

Partially Ordered Preferences in Decision Trees: Computing Strategies with Imprecision in Probabilities

Partially ordered preferences generally lead to choices that do not abide by standard expected utility guidelines; often such preferences are revealed by imprecision in probability values. We investigate five criteria for strategy selection in decision trees with imprecision in probabilities: “extensive” Γ-maximin and Γ-maximax, interval dominance, maximality and E-admissibility. We present algorithms that generate strategies for all these criteria; our main contribution is an algorithm for Eadmissibility that runs over admissible strategies rather than over sets of probability distributions.

Combining adiabatic and Hartmann-Hahn cross-polarization for sensitivity enhancement in solid state separated local field 2D-NMR experiments of partially ordered systems

In this Letter, we examine magnetization in double- and zero-quantum reservoirs of an ensemble of spin-1/2 nuclei and describe their role in determining the sensitivity of a class of separated local field NMR experiments based on Hartmann-Hahn cross-polarization. We observe that for the liquid crystal system studied, a large dilute spin-polarization, obtained initially by the use of adiabatic cross-polarization, can enhance the sensitivity of the above experiment. The signal enhancement factors, however, are found to vary and depend on the local dynamics. The experimental results have been utilized to obtain the local order-parameters of the system. (C) 2012 Elsevier B. V. All rights reserved.

Reasoning with sorted-pareto dominance and other qualitative and partially ordered preferences in soft constraints

In decision making problems where we need to choose a particular decision or alternative from a set of possible choices, we often have some preferences which determine if we prefer one decision over another. When these preferences give us an ordering on the decisions that is complete, then it is easy to choose the best or one of the best decisions. However it often occurs that the preferences relation is partially ordered, and we have no best decision. In this thesis, we look at what happens when we have such a partial order over a set of decisions, in particular when we have multiple orderings on a set of decisions, and we present a framework for qualitative decision making. We look at the different natural notions of optimal decision that occur in this framework, which gives us different optimality classes, and we examine the relationships between these classes. We then look in particular at a qualitative preference relation called Sorted-Pareto Dominance, which is an extension of Pareto Dominance, and we give a semantics for this relation as one that is compatible with any order-preserving mapping of an ordinal preference scale to a numerical one. We apply Sorted-Pareto dominance to a Soft Constraints setting, where we solve problems in which the soft constraints associate qualitative preferences to decisions in a decision problem. We also examine the Sorted-Pareto dominance relation in the context of our qualitative decision making framework, looking at the relevant optimality classes for the Sorted-Pareto case, which gives us classes of decisions that are necessarily optimal, and optimal for some choice of mapping of an ordinal scale to a quantitative one. We provide some empirical analysis of Sorted-Pareto constraints problems and examine the optimality classes that result.

Three-machine shop scheduling with partially ordered processing routes

This paper considers the problem of sequencing n jobs in a three-machine shop with the objective of minimising the maximum completion time. The shop consists of three machines, M1,M2 and M_{3}. A job is first processed on M1 and then is assigned either the route (M2,M_{3}) or the route (M_{3},M2). Thus, for our model the processing route is given by a partial order of machines, as opposed to the linear order of machines for a job shop, or to an arbitrary sequence of machines for an open shop. The main result is on O(nlog n) time heuristic, which generates a schedule with the makespan that is at most 5/3 times the optimum value.

On effective linearly ordered sets of comparison functions

Both the existence and the non-existence of a linearly ordered (by certain natural order relations) effective set of comparison functions (=dense comparison classes) are compatible with the ZFC axioms of set theory.

Sheaves, local homeomorphisms and local sets as Hilbert locale modules

We give a thorough account of the various equivalent notions for \sheaf" on a locale, namely the separated and complete presheaves, the local home- omorphisms, and the local sets, and to provide a new approach based on quantale modules whereby we see that sheaves can be identi¯ed with certain Hilbert modules in the sense of Paseka. This formulation provides us with an interesting category that has immediate meaningful relations to those of sheaves, local homeomorphisms and local sets. The concept of B-set (local set over the locale B) present in [3] is seen as a simetric idempotent matrix with entries on B, and a map of B-sets as de¯ned in [8] is shown to be also a matrix satisfying some conditions. This gives us useful tools that permit the algebraic manipulation of B-sets. The main result is to show that the existing notions of \sheaf" on a locale B are also equivalent to a new concept what we call a Hilbert module with an Hilbert base. These modules are the projective modules since they are the image of a free module by a idempotent automorphism On the ¯rst chapter, we recall some well known results about partially ordered sets and lattices. On chapter two we introduce the category of Sup-lattices, and the cate- gory of locales, Loc. We describe the adjunction between this category and the category Top of topological spaces whose restriction to spacial locales give us a duality between this category and the category of sober spaces. We ¯nish this chapter with the de¯nitions of module over a quantale and Hilbert Module. Chapter three concerns with various equivalent notions namely: sheaves of sets, local homeomorphisms and local sets (projection matrices with entries on a locale). We ¯nish giving a direct algebraic proof that each local set is isomorphic to a complete local set, whose rows correspond to the singletons. On chapter four we de¯ne B-locale, study open maps and local homeo- morphims. The main new result is on the ¯fth chapter where we de¯ne the Hilbert modules and Hilbert modules with an Hilbert and show this latter concept is equivalent to the previous notions of sheaf over a locale.

Fixed point theorems in partially ordered spaces and aplications

[ES]Recientemente, en la Teoría del punto fijo, han aparecido muchos resultados que obtienen condiciones suficientes para la existencia de un punto fijo si trabajamos con aplicaciones en un conjunto dotado de un orden parcial. Generalmente, estos resultados combinan dos teoremas del punto fijo fundamentales: el Teorema de la contracción de Banach y el Teorema de Knaster-Tarski.

Partially ordered classes of finite automata /

Vita.

Coincidence point theorems in quasi-metric spaces without assuming the mixed monotone property and consequences in G-metric spaces

In this paper, we present some coincidence point theorems in the setting of quasi-metric spaces that can be applied to operators which not necessarily have the mixed monotone property. As a consequence, we particularize our results to the field of metric spaces, partially ordered metric spaces and G-metric spaces, obtaining some very recent results. Finally, we show how to use our main theorems to obtain coupled, tripled, quadrupled and multidimensional coincidence point results.

Kleiner's theorem for unitary representations of posets

A subspace representation of a poset S = {s(1), ..., S-t} is given by a system (V; V-1, ..., V-t) consisting of a vector space V and its sub-spaces V-i such that V-i subset of V-j if s(i) (sic) S-j. For each real-valued vector chi = (chi(1), ..., chi(t)) with positive components, we define a unitary chi-representation of S as a system (U: U-1, ..., U-t) that consists of a unitary space U and its subspaces U-i such that U-i subset of U-j if S-i (sic) S-j and satisfies chi 1 P-1 + ... + chi P-t(t) = 1, in which P-i is the orthogonal projection onto U-i. We prove that S has a finite number of unitarily nonequivalent indecomposable chi-representations for each weight chi if and only if S has a finite number of nonequivalent indecomposable subspace representations; that is, if and only if S contains any of Kleiner's critical posets. (c) 2012 Elsevier Inc. All rights reserved.

Existence and uniqueness of positive and nondecreasing solutions for a class of singular fractional boundary value problems

[EN] We establish the existence and uniqueness of a positive and nondecreasing solution to a singular boundary value problem of a class of nonlinear fractional differential equation. Our analysis relies on a fixed point theorem in partially ordered sets.

Continued fractions built from convex sets and convex functions

In a partially ordered semigroup with the duality (or polarity) transform, it is pos- sible to define a generalisation of continued fractions. General sufficient conditions for convergence of continued fractions are provided. Two particular applications concern the cases of convex sets with the Minkowski addition and the polarity transform and the family of non-negative convex functions with the Legendre–Fenchel and Artstein-Avidan–Milman transforms.