Related papers: The quantale of order-preserving maps
We prove the conjecture that the higher Tamari orders of Dimakis and M\"uller-Hoissen coincide with the first higher Stasheff--Tamari orders. To this end, we show that the higher Tamari orders may be conceived as the image of an…
Three quantitative measures of the spatiotemporal behavior of the coupled map lattices: reduced density matrix, reduced wave function, and an analog of particle number, have been introduced. They provide a quantitative meaning to the…
We describe how self-adjoint ordered operator spaces, also called non-unital operator systems in the literature, can be understood as $*$-vector spaces equipped with a matrix gauge structure. We explain how this perspective has several…
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…
Collective operations on a network of spatially-separated quantum systems can be carried out using local quantum (LQ) operations, classical communication (CC) and shared entanglement (SE). Such operations can also be used to communicate…
Collective versions of order convergences and corresponding types of collectively qualified sets of operators in vector lattices are investigated. It is proved that collectively order to norm bounded sets are bounded in the operator norm…
Let ${\cal T}_n$ be the full symmetric semigroup on $X_n = \{1, 2,..., n\}$ and let ${\cal OCT}_n$ and ${\cal ORCT}_n$ be its subsemigroups of order-preserving and order-preserving or order-reversing full contraction mappings of $X_n$,…
In this paper we determine the number of the meaningful compositions of higher order of the differential operations and Gateaux directional derivative.
The objective of this manuscript is to understand the structure of an invertible linear map on the space of real symmetric matrices $\mathcal{S}^n$ that leaves invariant the closed convex cones of copositive and completely positive matrices…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi\'{c}'s and Winkler's relations play an important role in the theory of partial cubes. These structures are employed in the…
We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…
We show that every complemented modular lattice can be converted into a left residuated lattice where the binary operations of multiplication and residuum are term operations. The concept of an operator left residuated poset was introduced…
It is known, by Gelfand theory, that every commutative JB$^*$-triple admits a representation as a space of continuous functions of the form $$C_0^{\mathbb{T}}(L) = \{ a\in C_0(L) : a(\lambda t ) = \lambda a(t), \ \forall \lambda\in…
We define extension maps as maps that extend a system (through adding ancillary systems) without changing the state in the original system. We show, using extension maps, why a completely positive operation on an initially entangled system…
Given a strictly positive measure, we characterize inner semicontinuous solid convex-valued mappings for which continuous functions which are selections almost everywhere are selections. This class contains continuous mappings as well as…
Based on both the fundamental theorem of affine geometry in regular $L^0$-modules and the recent progress in random convex analysis, this paper characterizes the stable fully order preserving and order reversing operators acting on the…
The boundedness (continuity) of composition operators from some function space to another one is significant, though there are few results about this problem. Thus, in this study, we provide necessary and sufficient conditions on the…
Lexicographic composition is a natural way to build an aggregate choice function from component choice functions. As the name suggests, the components are ordered and choose sequentially. The sets that subsequent components select from are…
Following on from the notion of (first-order) causality, which generalises the notion of being tracepreserving from CP-maps to abstract processes, we give a characterization for the most general kind of map which sends causal processes to…