Abstract. We study a factorization of bounded linear maps from an operator space A to its dual space A∗. It is shown that T : A −→ A∗ factors through a pair of a column Hilbert spaces Hc and its dual space if and only if T is a bounded linear form on A ⊗ A by the canonical identification equipped with a numerical radius type Haagerup norm. As a consequence, we characterize a bounded linear map ...

We construct dual descriptions of (0, 2) gauged linear sigma models. In some cases, the dual is a (0, 2) Landau-Ginzburg theory, while in other cases, it is a non-linear sigma model. The duality map defines an analogue of mirror symmetry for (0, 2) theories. Using the dual description, we determine the instanton corrected chiral ring for some illustrative examples. This ring defines a (0, 2) ge...

In classical covering space theory, a covering map induces an injection of fundamental groups. This note reveals a dual property for quotient maps having connected fibers, with applications to orbit spaces of smooth vector fields and leaf spaces in general.

We consider the dual billiard map with respect to a smooth strictly convex closed hypersurface in linear 2m-dimensional symplectic space and prove that it has at least 2m distinct 3-periodic orbits. AMS Classi cation 37J45, 70H12

We develop in this article a geometric approach to duality in Multiple Objective Linear Programming. This approach is based on a very old idea, the duality of polytopes, which can be traced back to the old Greeks. We show that there is an inclusion reversing one-to-one map between the minimal faces of the image of the primal objective and the maximal faces of the image of the dual objective map.

Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for linear nonbinary block and convolutional codes over both extension elds GF(q = p a) and integer rings Z q are presented. Equivalent MAP decoding rules employing the dual code are given which are computationally more eecient for high-rate codes. The suitabil-ity of the proposed algorithms is demonstrated by applying them to a pa...

‎we present an application of the dual gabor frames to image‎ ‎processing‎. ‎our algorithm is based on finding some dual gabor‎ ‎frame generators which reconstructs accurately the elements of the‎ ‎underlying hilbert space‎. ‎the advantages of these duals‎ ‎constructed by a polynomial of gabor frame generators are compared‎ ‎with their canonical dual‎.

— The purpose of this article is to give formulas for Bloch-Kato’s exponential map and its dual for an absolutely crystalline p-adic representation V , in terms of the (φ,Γ)module associated to that representation. As a corollary of these computations, we can give a very simple (and slightly improved) description of Perrin-Riou’s exponential map (which interpolates Bloch-Kato’s exponentials for...

Landscapes can be modelled as sets of homogeneous objects (landscape elements) forming areas of characteristic patterns (landscape units). The common way to represent landscapes is by vector GIS data structures which do not provide a mechanism for storing the spatial relationships between the objects in explicit form. Also, they do not account for a multi-scale representation. Graphs can be use...