ON SPACES OF COMPACT OPERATORS ON C(K, X) SPACES

This paper concerns the spaces of compact operators kappa(E,F), where E and F are Banach spaces C([1, xi], X) of all continuous X-valued functions defined on the interval of ordinals [1, xi] and equipped with the supremun norm. We provide sufficient conditions on X, Y, alpha, beta, xi and eta, with omega <= alpha <= beta < omega 1 for the following equivalence: (a) kappa(C([1, xi], X), C([1, alpha], Y)) is isomorphic to kappa(C([1,eta], X), C([1, beta], Y)), (b) beta < alpha(omega). In this way, we unify and extend results due to Bessaga and Pelczynski (1960) and C. Samuel (2009). Our result covers the case of the classical spaces X = l(p) and Y = l(q) with 1 < p, q < infinity.

COUNTABLE GROUPS OF ISOMETRIES ON BANACH SPACES

A group G is representable in a Banach space X if G is isomorphic to the group of isometrics on X in some equivalent norm. We prove that a countable group G is representable in a separable real Banach space X in several general cases, including when G similar or equal to {-1,1} x H, H finite and dim X >= vertical bar H vertical bar or when G contains a normal subgroup with two elements and X is of the form c(0)(Y) or l(p)(Y), 1 <= p < +infinity. This is a consequence of a result inspired by methods of S. Bellenot (1986) and stating that under rather general conditions on a separable real Banach space X and a countable bounded group G of isomorphisms on X containing -Id, there exists an equivalent norm on X for which G is equal to the group of isometrics on X. We also extend methods of K. Jarosz (1988) to prove that any complex Banach space of dimension at least 2 may be renormed with an equivalent complex norm to admit only trivial real isometries, and that any complexification of a Banach space may be renormed with an equivalent complex norm to admit only trivial and conjugation real isometrics. It follows that every real Banach space of dimension at least 4 and with a complex structure may be renormed to admit exactly two complex structures up to isometry, and that every real Cartesian square may be renormed to admit a unique complex structure up to isometry.

POLAR ACTIONS ON CERTAIN PRINCIPAL BUNDLES OVER SYMMETRIC SPACES OF COMPACT TYPE

We study polar actions with horizontal sections on the total space of certain principal bundles G/K -> G/H with base a symmetric space of compact type. We classify such actions up to orbit equivalence in many cases. In particular, we exhibit examples of hyperpolar actions with cohomogeneity greater than one on locally irreducible homogeneous spaces with nonnegative curvature which are not homeomorphic to symmetric spaces.

Extremal problems on sum-free sets and coverings in tridimensional spaces

Given a prime power q, define c (q) as the minimum cardinality of a subset H of F 3 q which satisfies the following property: every vector in this space di ff ers in at most 1 coordinate from a multiple of a vector in H. In this work, we introduce two extremal problems in combinatorial number theory aiming to discuss a known connection between the corresponding coverings and sum-free sets. Also, we provide several bounds on these maps which yield new classes of coverings, improving the previous upper bound on c (q)

Sequential decision making with partially ordered preferences

This paper presents new insights and novel algorithms for strategy selection in sequential decision making with partially ordered preferences; that is, where some strategies may be incomparable with respect to expected utility. We assume that incomparability amongst strategies is caused by indeterminacy/imprecision in probability values. We investigate six criteria for consequentialist strategy selection: Gamma-Maximin, Gamma-Maximax, Gamma-Maximix, Interval Dominance, Maximality and E-admissibility. We focus on the popular decision tree and influence diagram representations. Algorithms resort to linear/multilinear programming; we describe implementation and experiments. (C) 2010 Elsevier B.V. All rights reserved.

Definition of priority areas for forest conservation through the ordered weighted averaging method

The general objective of this study was to evaluate the ordered weighted averaging (OWA) method, integrated to a geographic information systems (GIS), in the definition of priority areas for forest conservation in a Brazilian river basin, aiming at to increase the regional biodiversity. We demonstrated how one could obtain a range of alternatives by applying OWA, including the one obtained by the weighted linear combination method and, also the use of the analytic hierarchy process (AHP) to structure the decision problem and to assign the importance to each criterion. The criteria considered important to this study were: proximity to forest patches; proximity among forest patches with larger core area; proximity to surface water; distance from roads: distance from urban areas; and vulnerability to erosion. OWA requires two sets of criteria weights: the weights of relative criterion importance and the order weights. Thus, Participatory Technique was used to define the criteria set and the criterion importance (based in AHP). In order to obtain the second set of weights we considered the influence of each criterion, as well as the importance of each one, on this decision-making process. The sensitivity analysis indicated coherence among the criterion importance weights, the order weights, and the solution. According to this analysis, only the proximity to surface water criterion is not important to identify priority areas for forest conservation. Finally, we can highlight that the OWA method is flexible, easy to be implemented and, mainly, it facilitates a better understanding of the alternative land-use suitability patterns. (C) 2008 Elsevier B.V. All rights reserved.

On S-asymptotically omega-periodic functions on Banach spaces and applications

This paper is devoted to the study of the class of continuous and bounded functions f : [0, infinity] -> X for which exists omega > 0 such that lim(t ->infinity) (f (t + omega) - f (t)) = 0 (in the sequel called S-asymptotically omega-periodic functions). We discuss qualitative properties and establish some relationships between this type of functions and the class of asymptotically omega-periodic functions. We also study the existence of S-asymptotically omega-periodic mild solutions of the first-order abstract Cauchy problem in Banach spaces. (C) 2008 Elsevier Inc. All rights reserved.

Existence Results for Second Order Differential Equations with Nonlocal Conditions in Banach Spaces

This work is concerned with implicit second order abstract differential equations with nonlocal conditions. Assuming that the involved operators satisfy sonic compactness properties, we establish the existence of local mild solutions, the existence of global mild solutions and the existence of asymptotically almost periodic solutions.

Controllability of Volterra-Fredholm type systems in Banach spaces

We show the results in Chalishajar [Controllability of mixed Volterra-Fredholm-type integro-differential systems in Banach space, J. Franklin Inst. 344(1) (2007) 12-21] and Chang and Chalishajar [Controllability of mixed Volterra-Fredholm type integro-differential systems in Banach space, J. Franklin Inst., doi:10.1016/j. jfranklin.2008.02.002] are only valid for ordinary differential control systems. As a result the examples provided cannot be recovered as applications of the abstract results. (C) 2008 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

Slicing the metric space to provide quick indexing of complex data in the main memory

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.

Efficient bulk-loading on dynamic metric access methods

This paper presents a new technique and two algorithms to bulk-load data into multi-way dynamic metric access methods, based on the covering radius of representative elements employed to organize data in hierarchical data structures. The proposed algorithms are sample-based, and they always build a valid and height-balanced tree. We compare the proposed algorithm with existing ones, showing the behavior to bulk-load data into the Slim-tree metric access method. After having identified the worst case of our first algorithm, we describe adequate counteractions in an elegant way creating the second algorithm. Experiments performed to evaluate their performance show that our bulk-loading methods build trees faster than the sequential insertion method regarding construction time, and that it also significantly improves search performance. (C) 2009 Elsevier B.V. All rights reserved.

Finite-dimensional global attractors in Banach spaces

We provide bounds on the upper box-counting dimension of negatively invariant subsets of Banach spaces, a problem that is easily reduced to covering the image of the unit ball under a linear map by a collection of balls of smaller radius. As an application of the abstract theory we show that the global attractors of a very broad class of parabolic partial differential equations (semilinear equations in Banach spaces) are finite-dimensional. (C) 2010 Elsevier Inc. All rights reserved.

The analytic torsion of a cone over a sphere

We compute the analytic torsion of a cone over a sphere of dimensions 1, 2, and 3, and we conjecture a general formula for the cone over an odd dimensional sphere. (C) 2009 Elsevier Masson SAS. All rights reserved.

Horo-tight spheres in hyperbolic space

We study horo-tight immersions of manifolds into hyperbolic spaces. The main result gives several characterizations of horo-tightness of spheres, answering a question proposed by Cecil and Ryan. For instance, we prove that a sphere is horo-tight if and only if it is tight in the hyperbolic sense. For codimension bigger than one, it follows that horo-tight spheres in hyperbolic space are metric spheres. We also prove that horo-tight hyperspheres are characterized by the property that both of its total absolute horospherical curvatures attend their minimum value. We also introduce the notion of weak horo-tightness: an immersion is weak horo-tight if only one of its total absolute curvature attends its minimum. We prove a characterization theorem for weak horo-tight hyperspheres.

Benders, metric and cutset inequalities for multicommodity capacitated network design

Solving multicommodity capacitated network design problems is a hard task that requires the use of several strategies like relaxing some constraints and strengthening the model with valid inequalities. In this paper, we compare three sets of inequalities that have been widely used in this context: Benders, metric and cutset inequalities. We show that Benders inequalities associated to extreme rays are metric inequalities. We also show how to strengthen Benders inequalities associated to non-extreme rays to obtain metric inequalities. We show that cutset inequalities are Benders inequalities, but not necessarily metric inequalities. We give a necessary and sufficient condition for a cutset inequality to be a metric inequality. Computational experiments show the effectiveness of strengthening Benders and cutset inequalities to obtain metric inequalities.