相关论文: A half-space approach to order dimension
This chapter discusses a general design approach to planning computer experiments, which seeks design points that fill a bounded design region as uniformly as possible. Such designs are broadly referred to as space-filling designs.
Matrix configurations define noncommutative spaces endowed with extra structure including a generalized Laplace operator, and hence a metric structure. Made dynamical via matrix models, they describe rich physical systems including…
A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…
The Pareto dominance relation of a preference profile is (the asymmetric part of) a partial order. For any integer n, the problem of the existence of an n-agent preference profile that generates the given Pareto dominance relation is to…
Some concepts, such as non-compactness measure and condensing operators, defined on metric spaces are extended to uniform spaces. Such extensions allow us to locate, in the context of uniform spaces, some classical results existing in…
The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…
In the present paper we propose a new approach on `distributed systems': the processes are represented through total orders and the communications are characterized by means of biorders. The resulting distributed systems capture situations…
If $(X, \le_X)$ is a partially ordered set satisfying certain necessary conditions for $X$ to be order-isomorphic to the spectrum of a Noetherian domain of dimension two, we describe a new poset $(\text{str } X, \le_{\text{str } X})$ that…
We investigate the generalisation of quantum search of unstructured and totally ordered sets to search of partially ordered sets (posets). Two models for poset search are considered. In both models, we show that quantum algorithms can…
Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…
We propose a notion of a generalized order, which can be used for the notion of a strict partial order. We introduce a weak order to replace the usual weak order defined from a strict partial order. In a constructive setting, that usual…
We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite…
A coarse space $X$, endowed with a linear order compatible with the coarse structure of $X$, is called linearly ordered. We prove that every linearly ordered coarse space $X$ is locally convex and the asymptotic dimension of $X$ is either…
This paper studies three natural pre-orders of increasing generality on the set of all completely non-unitary partial isometries with equal defect indices. We show that the problem of determining when one partial isometry is less than…
Apparently, all partial differential equations that describe physical phenomena in space-time can be cast into a universal quasilinear, first-order form. In this paper, we do two things. First, we describe some broad features of systems of…
Linearizing two partial orders to maximize the number of adjacencies and minimize the number of breakpoints is APX-hard. This holds even if one of the two partial orders is already a linear order and the other is an interval order, or if…
We say that two partial orders on $[n]$ are compatible if there exists a partial order that refines both of them. This compatibility relation induces a natural set system structure between the collection $\mathcal{F}$ of all partial orders…
Sorting algorithms have attracted a great deal of attention and study, as they have numerous applications to Mathematics, Computer Science and related fields. In this thesis, we first deal with the mathematical analysis of the Quicksort…
Linear topological spaces with partial ordering (linear kinematics) are studied. They are defined by a set of 8 axioms implying that topology, linear structure and ordering are compatible with each other. Most of the results are valid for…
A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…