Subdifferentiability of the norm and the Banach-Stone theorem for real and complex JB*-triples

We study the points of strong subdifferentiability for the norm of a real JB*-triple. As a consequence we describe weakly compact real JB*-triples and rediscover the Banach-Stone Theorem for complex JB*-triples.Authors Partially supported by I+D MCYT projects no. BFM2002-01529 and BFM2002-01810, and Junta de Andalucía grant FQM 0199Mathematics Subject Classification (2000): 46B04, 46L05, 46L70Revised version: 2 May 2004Acknowledgements. The authors would like to thank A. Rodr{\i}guez Palacios for fruitful comments and discussions during the preparation of this paper and to the referee for his or her interesting suggestions.     

An improved algorithm for selecting <Emphasis Type="Italic">p</Emphasis> items with uncertain returns according to the minmax-regret criterion

We consider the problem of selecting a subset of p investments of maximum total return out of a set of n available investments with uncertain returns, where uncertainty is represented by interval estimates for the returns, and the minmax regret objective is used. We develop an algorithm that solves this problem in O(min{p,n–p}n) time. This improves the previously known complexity O(min{p,n–p}²n).This research has been supported by the Spanish Science and Technology Ministry and FEDER Grant No. BFM2002-04525-C02-02.Received: October 2002 / Accepted: September 2003     

Closed stability index of excellent henselian local rings

We show that the closed stability index of an excellent henselian local ring of real dimension d2 with real closed residue field is When d=2 it is shown that the value of can be either 2 or 3 and give characterizations of each of these values in terms of the relation of A with its normalization and in terms of the real spectrum of A.Mathematics Subject Classification (2000): 14P15, 32B10, 13J15, 13J25Partially supported by DGES BFM2002-04797 and EC contract HPRN-CT-2001-00271in final form: 15 October 2003     

Splitting graphs when calculating Myerson value for pure overhead games

A communication situation consists of a coalitional game and a graph, the nodes of the graph corresponding to the players of the game. To calculate the Myerson value for such situations, we obtain results which extend those well known for trees and cycle-complete graphs. On the other hand, in order to reduce the associated calculus for communication situations with a pure overhead game, the possibility of splitting the graph in several subgraphs is analyzed. For each fixed decomposition of the graph, a subspace of games compatible with this decomposition is given.     

On Graphs Determined by Their Tutte Polynomials

We say that a graph G is T-unique if any other graph having the same Tutte polynomial as G is necessarily isomorphic to G. In this paper we show that several well-known families of graphs are T-unique: wheels, squares of cycles, complete multipartite graphs, ladders, Möbius ladders, and hypercubes. In order to prove these results, we show that several parameters of a graph, like the number of cycles of length 3, 4 and 5, and the edge-connectivity are determined by its Tutte polynomial.Research partially supported by projects BFM2001-2340 and by CUR Gen. Cat. 1999SGR00356Final version received: January 10, 2003     

The static bike relocation problem with multiple vehicles and visits

This paper introduces the static bike relocation problem with multiple vehicles and visits, the objective of which is to rebalance at minimum cost the stations of a bike sharing system using a fleet of vehicles. The vehicles have identical capacities and service time limits, and are allowed to visit the stations multiple times. We present an integer programming formulation, implemented under a branch-and-cut scheme, in addition to an iterated local search metaheuristic that employs efficient move evaluation procedures. Results of computational experiments on instances ranging from 10 to 200 vertices are provided and analyzed. We also examine the impact of the vehicle capacity and of the number of visits and vehicles on the performance of the proposed algorithms.     

The Vectorial Ribaucour Transformation for Submanifolds of Constant Sectional Curvature

We obtain a reduction of the vectorial Ribaucour transformation that preserves the class of submanifolds of constant sectional curvature of space forms, which we call the L-transformation. It allows to construct a family of such submanifolds starting with a given one and a vector-valued solution of a system of linear partial differential equations. We prove a decomposition theorem for the L-transformation, which is a far-reaching generalization of the classical permutability formula for the Ribaucour transformation of surfaces of constant curvature in Euclidean three space. As a consequence, we derive a Bianchi-cube theorem, which allows to produce, from k initial scalar L-transforms of a given submanifold of constant curvature, a whole k-dimensional cube all of whose remaining \(2^k-(k+1)\) vertices are submanifolds with the same constant sectional curvature given by explicit algebraic formulae. We also obtain further reductions, as well as corresponding decomposition and Bianchi-cube theorems, for the classes of n-dimensional flat Lagrangian submanifolds of \({\mathbb {C}}^n\) and n-dimensional Lagrangian submanifolds with constant curvature c of the complex projective space \({\mathbb {C}}{\mathbb {P}}^n(4c)\) or the complex hyperbolic space \({\mathbb {C}}{\mathbb {H}}^n(4c)\) of complex dimension n and constant holomorphic curvature 4c.     

Flatness implies smoothness for solutions of the porous medium equation

One of the major problems in the theory of the porous medium equation \(\partial _t\rho =\Delta _x\rho ^m,\,m > 1\), is the regularity of the solutions \(\rho (t,x)\ge 0\) and the free boundaries \(\Gamma =\partial \{(t,x): \rho >0\}\). Here we assume flatness of the solution and derive \(C^\infty \) regularity of the interface after a small time, as well as \(C^\infty \) regularity of the solution in the positivity set and up to the free boundary for some time interval. The proof starts from Caffarelli’s blueprint of an improvement of flatness by rescaling, and combines it with the Carleson measure approach applied to the degenerate subelliptic equation satisfied by the pressure of the porous medium equation in transformed coordinates. The improvement of flatness finally hinges on Gaussian estimates for the subelliptic problem. We use these facts to prove the following eventual regularity result: solutions defined in the whole space with compactly supported initial data are smooth after a finite time \(T_r\) that depends on \(\rho _0\). More precisely, we prove that for \(t \ge T_r\) the pressure \(\rho ^{m-1}\) is \(C^\infty \) in the positivity set and up to the free boundary, which is a \(C^\infty \) hypersurface. Moreover, \(T_r\) can be estimated in terms of only the initial mass and the initial support radius. This regularity result eliminates the assumption of non-degeneracy on the initial data that has been carried on for decades in the literature. Let us recall that regularization for small times is false, and that as \(t\rightarrow \infty \) the solution increasingly resembles a Barenblatt function and the support looks like a ball.