Totally ordered uncertain sets

It is known that some uncertain sets have membership functions, and some do not. How do we judge whether an uncertain set has a membership function? In order to answer this question, this paper presents a concept of totally ordered uncertain set, and shows that totally ordered uncertain sets always have membership functions if they are defined on a continuous uncertainty space. In addition, some criteria for judging the existence of membership functions for uncertain sets are provided. Several inspiring examples and counterexamples are also documented in this paper.     

Implementations of special ordered sets in MP software

Special ordered sets (SOS) have been introduced as a practical device for efficiently handling special classes of nonconvex optimization problems. They are now implemented in most commercial codes for mathematical programming (MP software). The paper gives a survey of possible applications as multiple choice restrictions, conditional multiple choice restrictions, discrete variables, discontinuous variables and piecewise linear functions, global optimization of separable programming problems, alternative right-hand sides, overlapping special ordered sets and the solution of quadratic programming problems. Alternative problem formulations are discussed. Since special ordered sets are not defined uniquely modelling facilities depend on the definition of a special orderedset in a code. The paper demonstrates the superiority of SOS to the application of binary variables if they are treated judiciously.     

Ultrafilters and non-Cantor minimal sets in linearly ordered dynamical systems

It is well known that infinite minimal sets for continuous functions on the interval are Cantor sets; that is, compact zero dimensional metrizable sets without isolated points. On the other hand, it was proved in Alcaraz and Sanchis (Bifurcat Chaos 13:1665–1671, 2003) that infinite minimal sets for continuous functions on connected linearly ordered spaces enjoy the same properties as Cantor sets except that they can fail to be metrizable. However, no examples of such subsets have been known. In this note we construct, in ZFC, non-metrizable infinite pairwise non-homeomorphic minimal sets on compact connected linearly ordered spaces.      

Multifunctions and the fixed point property for products of ordered sets

Sufficient conditions for the fixed point property for products of two partially ordered sets are proved. These conditions are formulated in terms of multifunctions (functions with non-empty sets as values).     

The arity gap of order-preserving functions and extensions of pseudo-Boolean functions

The aim of this paper is to classify order-preserving functions according to their arity gap. Noteworthy examples of order-preserving functions are the so-called aggregation functions. We first explicitly classify the Lovász extensions of pseudo-Boolean functions according to their arity gap. Then we consider the class of order-preserving functions between partially ordered sets, and establish a similar explicit classification for this function class.     

Boolean and distributive ordered sets: Characterization and representation by sets

Boolean ordered sets generalize Boolean lattices, and distributive ordered sets generalize distributive lattices. Ideals, prime ideals, and maximal ideals in ordered sets are defined, and some well-known theorems on Boolean lattices, such as the Glivenko-Stone theorem and the Stone representation theorem, are generalized to Boolean ordered sets. A prime ideal theorem for distributive ordered sets is formulated, and the Birkhoff representation theorem is generalized to distributive ordered sets. Fundamental are the embedding theorems for Boolean ordered sets and for distributive ordered sets.Financial support of the Grant Agency of the Czech Republic under the grant No. 201/93/0950 is gratefully acknowledged.     

Stieltjes integral equations in partially ordered sets

Stieltjes integral equations are considered in partially ordered sets of real valued functions, and connections are made using integral inequalities to the existence and uniqueness problems of hereditary systems which are not Lipschitz.     

A generalization of a theorem of Arrow,Barankin and Blackwell to a nonconvex case

The paper presents a generalization of a known density theorem of Arrow, Barankin, and Blackwell for properly efficient points defined as support points of sets with respect to monotonically increasing sublinear functions. This result is shown to hold for nonconvex sets of a partially ordered reflexive Banach space.     

Classes of functions of the <Emphasis Type="Italic">k</Emphasis>-valued logic monotone with respect to sets of width two

A criterion of the property of being finitely generated is obtained for precomplete classes of functions monotone with respect to sets from the family of all partially ordered sets of width two with the greatest and the least elements.     

Regularizations in abelian complete ordered groups

Notions about Φ-convexity are extended to abelian complete partially ordered group-valued mappings in an attempt to unify in a general theory notions of Φ-convex sets and Φ-convex mappings. We obtain some group specific results and particularly a characterization of support functions.     

TWO POROSITY RESULTS IN MONOTONIC ANALYSIS

ABSTRACT

In this work we consider spaces of increasing functions defined on a subset of an ordered normed space. We equip each of these spaces with a natural metric and show that the complement of the subset of all strictly increasing functions is σ-porous. We also discuss some properties of normal sets and strictly normal sets.     

Characterizations of totally ordered sets by their various endomorphisms

We characterize totally ordered sets within the class of all ordered sets containing at least three-element chains using a simple relationship between their isotone transformations and the so called 2-, 3-, 4-endomorphisms which are introduced in the paper. Another characterization of totally ordered sets within the class of ordered sets of a locally finite height with at least four-element chains in terms of the regular semigroup theory is also given.     

On Ordered Sets with Isomorphic Marked Maximal Cards

We prove a necessary condition for two nonisomorphic ordered sets to have two isomorphic marked maximal cards. This condition is used to prove that ordered sets of width 3 with 2 maximal elements are reconstructible and that ordered sets of width 3 are reconstructible if we can reconstruct the marked maximal deck.     

A flexible model and efficient solution strategies for discrete location problems

Flexible discrete location problems are a generalization of most classical discrete locations problems like p-median or p-center problems. They can be modeled by using so-called ordered median functions. These functions multiply a weight to the cost of fulfilling the demand of a customer, which depends on the position of that cost relative to the costs of fulfilling the demand of other customers.In this paper a covering type of model for the discrete ordered median problem is presented. For the solution of this model two sets of valid inequalities, which reduces the number of binary variables tremendously, and several variable fixing strategies are identified. Based on these concepts a specialized branch & cut procedure is proposed and extensive computational results are reported.     

Generalized Dini theorems for nets of functions on arbitrary sets

We characterize the uniform convergence of pointwise monotonic nets of bounded real functions defined on arbitrary sets, without any particular structure. The resulting condition trivially holds for the classical Dini theorem. Our vector-valued Dini-type theorem characterizes the uniform convergence of pointwise monotonic nets of functions with relatively compact range in Hausdorff topological ordered vector spaces. As a consequence, for such nets of continuous functions on a compact space, we get the equivalence between the pointwise and the uniform convergence. When the codomain is locally convex, we also get the equivalence between the uniform convergence and the weak-pointwise convergence; this also merges the Dini-Weston theorem on the convergence of monotonic nets from Hausdorff locally convex ordered spaces. Most of our results are free of any structural requirements on the common domain and put compactness in the right place: the range of the functions.     

Near Equality in the Riesz–Sobolev Inequality

The Riesz–Sobolev inequality provides a sharp upper bound for a trilinear expression involving convolution of indicator functions of sets. Equality is known to hold only for indicator functions of appropriately situated intervals. We characterize ordered triples of subsets of R~1 that nearly realize equality, with quantitative bounds of power law form with the optimal exponent.     

Special ordered sets and an application to gas supply operations planning

Special Ordered Sets provide a powerful means of modeling nonconvex functions and discrete requirements, though there has been a tendency to think of them only in terms of multiple-choice zero-one programming. This paper emphasizes the origins and generality of the special ordered set concept, and describes an application in which type 2 sets are used in several forms to model both logical conditions and nonlinear functions.Now at IBM Almaden Research Center, San Jose, CA 95120.     

Complex monodromy and the topology of real algebraic sets

A relation between the Euler characteristics of the Milnorfibres of a real analytic function is derived from a simple identity involvingcomplex monodromy and complex conjugation. A corollary is the result of Costeand Kurdyka that the Euler characteristic of the local link of an irreduciblealgebraic subset of a real algebraic set is generically constant modulo 4. Asimilar relation for iterated Milnor fibres of ordered sets of functions isused to define topological invariants of ordered collections of algebraicsubsets.     

Evaluation codes defined by finite families of plane valuations at infinity

We construct evaluation codes given by weight functions defined over polynomial rings in m ≥ 2 indeterminates. These weight functions are determined by sets of m?1 weight functions over polynomial rings in two indeterminates defined by plane valuations at infinity. Well-suited families in totally ordered commutative groups are an important tool in our procedure.