(1) Let S, T be up-complete Scott top-lattices and M be a subset of SCMaps(S,T ). Then ⊔ SCMaps(S,T ) M is a continuous map from S into T . Let S be a non empty relational structure and let T be a non empty reflexive relational structure. One can verify that every map from S into T which is constant is also monotone. Let S be a non empty relational structure, let T be a reflexive non empty rela...

Suppose n > 1 is an odd integer, f is a smooth function supported in a ball B with boundary S, and u is the solution of the initial value problem utt −4xu = 0, (x, t) ∈ R × [0,∞); u(x, t=0) = 0, ut(x, t=0) = f(x), x ∈ R. We characterize the range of the map f 7→ u|S×[0,∞) and give a stable scheme for the inversion of this map. This also characterizes the range of the map sending f to its mean v...

We prove that the bicanonical map of a surfaces of general type S with pg = q = 0 is non birational if there exists a pencil |F | on S whose general member is an hyperelliptic curve of genus 3. Let S be a minimal surface of general type and let fg : S 99K B be a rational map onto a smooth curve such that the normalization of the general fibre is an hyperelliptic curve of genus g. Then the hyper...

The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. In this paper we propose a memetic algorithm for MAP that is a combination of a genetic algorithm with a local search procedure. The main contr...

The multidimensional assignment problem (MAP) (abbreviated s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. In this paper we consider four fast construction heuristics for MAP. One of the heuristics is new. A modification of the heuristics ...

The Multidimensional Assignment Problem (MAP) (abbreviated sAP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. We consider several known and new MAP local search heuristics for MAP as well as their combinations. Computational experiments with t...

Every continuous map X → S defines, by composition, a homomorphism between the corresponding algebras of real-valued continuous functions C(S) → C(X). This paper deals with algebraic properties of the homomorphism C(S)→ C(X) in relation to topological properties of the map X → S. The main result of the paper states that a continuous map X → S between topological manifolds is a finite (branched)...

For abstract operator spaces V and W , a linear map φ : V → W provides another linear map φn : Mn(A) → Mn(B) defined by φn((ai,j)) = (φ(ai,j)) where n = 1, 2, ···. If a sequence {‖φn‖} ∞ n=1 belongs to l , then φ is said to be a completely bounded map. W. Stinespring [7] and W. Arveson [1] started operator space theory related to complete boundedness for a map φ : S → B(K) where S ⊂ B(H) and H ...

The Multidimensional Assignment Problem (MAP) (abbreviated sAP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. We consider several known and new MAP local search heuristics for MAP as well as their combinations. Computational experiments with t...