Determinacy and Weakly Ramsey sets in Banach spaces

We give a sufficient condition for a set of block subspaces in an infinite-dimensional Banach space to be weakly Ramsey. Using this condition we prove that in the Levy-collapse of a Mahlo cardinal, every projective set is weakly Ramsey. This, together with a construction of W. H. Woodin, is used to show that the Axiom of Projective Determinacy implies that every projective set is weakly Ramsey. In the case of co we prove similar results for a stronger Ramsey property. And for hereditarily indecomposable spaces we show that the Axiom of Determinacy plus the Axiom of Dependent Choices imply that every set is weakly Ramsey. These results are the generalizations to the class of projective sets of some theorems from W. T. Gowers, and our paper "Weakly Ramsey sets in Banach spaces."

On the stability of the optimal value and the optimal set in optimization problems

The paper develops a stability theory for the optimal value and the optimal set mapping of optimization problems posed in a Banach space. The problems considered in this paper have an arbitrary number of inequality constraints involving lower semicontinuous (not necessarily convex) functions and one closed abstract constraint set. The considered perturbations lead to problems of the same type as the nominal one (with the same space of variables and the same number of constraints), where the abstract constraint set can also be perturbed. The spaces of functions involved in the problems (objective and constraints) are equipped with the metric of the uniform convergence on the bounded sets, meanwhile in the space of closed sets we consider, coherently, the Attouch-Wets topology. The paper examines, in a unified way, the lower and upper semicontinuity of the optimal value function, and the closedness, lower and upper semicontinuity (in the sense of Berge) of the optimal set mapping. This paper can be seen as a second part of the stability theory presented in [17], where we studied the stability of the feasible set mapping (completed here with the analysis of the Lipschitz-like property).

Singularity-free space-time

We show that the solution published in the paper by Senovilla [Phys. Rev. Lett. 64, 2219 (1990)] is geodesically complete and singularity-free. We also prove that the solution satisfies the stronger energy and causality conditions, such as global hyperbolicity, the strong energy condition, causal symmetry, and causal stability. A detailed discussion about which assumptions in the singularity theorems are not satisfied is performed, and we show explicitly that the solution is in accordance with those theorems. A brief discussion of the results is given.

Cat(0) and Cat (-1) dimensions of torsion free

We show that a particular free-by-cyclic group has CAT(0) dimension equal to 2, but CAT(-1) dimension equal to 3. We also classify the minimal proper 2-dimensional CAT(0) actions of this group; they correspond, up to scaling, to a 1-parameter family of locally CAT(0) piecewise Euclidean metrics on a fixed presentation complex for the group. This information is used to produce an infinite family of 2-dimensional hyperbolic groups, which do not act properly by isometries on any proper CAT(0) metric space of dimension 2. This family includes a free-by-cyclic group with free kernel of rank 6.

A parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics

This paper discusses the use of probabilistic or randomized algorithms for solving combinatorial optimization problems. Our approach employs non-uniform probability distributions to add a biased random behavior to classical heuristics so a large set of alternative good solutions can be quickly obtained in a natural way and without complex conguration processes. This procedure is especially useful in problems where properties such as non-smoothness or non-convexity lead to a highly irregular solution space, for which the traditional optimization methods, both of exact and approximate nature, may fail to reach their full potential. The results obtained are promising enough to suggest that randomizing classical heuristics is a powerful method that can be successfully applied in a variety of cases.

Pairing in a two-component ultracold Fermi gas: Phases with broken-space symmetries

We explore the phase diagram of a two-component ultracold atomic Fermi gas interacting with zero-range forces in the limit of weak coupling. We focus on the dependence of the pairing gap and the free energy on the variations in the number densities of the two species while the total density of the system is held fixed. As the density asymmetry is increased, the system exhibits a transition from a homogenous Bardeen-Cooper-Schrieffer (BCS) phase to phases with spontaneously broken global space symmetries. One such realization is the deformed Fermi surface superfluidity (DFS) which exploits the possibility of deforming the Fermi surfaces of the species into ellipsoidal form at zero total momentum of Cooper pairs. The critical asymmetries at which the transition from DFS to the unpaired state occurs are larger than those for the BCS phase. In this precritical region the DFS phase lowers the pairing energy of the asymmetric BCS state. We compare quantitatively the DFS phase to another realization of superconducting phases with broken translational symmetry: the single-plane-wave Larkin-Ovchinnikov-Fulde-Ferrell phase, which is characterized by a nonvanishing center-of-mass momentum of the Cooper pairs. The possibility of the detection of the DFS phase in the time-of-flight experiments is discussed and quantified for the case of 6Li atoms trapped in two different hyperfine states.

Nucleation rates in flat and curved space

Nucleation rates for tunneling processes in Minkowski and de Sitter space are investigated, taking into account one loop prefactors. In particular, we consider the creation of membranes by an antisymmetric tensor field, analogous to Schwinger pair production. This can be viewed as a model for the decay of a false (or true) vacuum at zero temperature in the thin wall limit. Also considered is the spontaneous nucleation of strings, domain walls, and monopoles during inflation. The instantons for these processes are spherical world sheets or world lines embedded in flat or de Sitter backgrounds. We find the contribution of such instantons to the semiclassical partition function, including the one loop corrections due to small fluctuations around the spherical world sheet. We suggest a prescription for obtaining, from the partition function, the distribution of objects nucleated during inflation. This can be seen as an extension of the usual formula, valid in flat space, according to which the nucleation rate is twice the imaginary part of the free energy. For the case of pair production, the results reproduce those that can be obtained using second quantization methods, confirming the validity of instanton techniques in de Sitter space. Throughout the paper, both the gravitational field and the antisymmetric tensor field are assumed external.

Exact solution to the mean exit time problem for free inertial processes driven by Gaussian white noise

We obtain the exact analytical expression, up to a quadrature, for the mean exit time, T(x,v), of a free inertial process driven by Gaussian white noise from a region (0,L) in space. We obtain a completely explicit expression for T(x,0) and discuss the dependence of T(x,v) as a function of the size L of the region. We develop a new method that may be used to solve other exit time problems.

Exact solution to the exit-time problem for an undamped free particle driven by Gaussian white noise

In a recent paper [Phys. Rev. Lett. 75, 189 (1995)] we have presented the exact analytical expression for the mean exit time, T(x,v), of a free inertial process driven by Gaussian white noise out of a region (0,L) in space. In this paper we give a detailed account of the method employed and present results on asymptotic properties and averages of T(x,v).

Real interpolation for families of Banach spaces (II)

In this paper, we study the dual space and reiteration theorems for the real method of interpolation for infinite families of Banach spaces introduced in [2]. We also give examples of interpolation spaces constructed with this method.

Contracting with free software communities

Industry and large Agencies needs ¿agile¿ programming resources, to reinforce their own development staff and take advantage of innovative approaches produced by ¿fresh minds¿ all over the world. At the same time they may be reluctant to engage in classical software development call for tenders and contracts. Such contracts are often ¿trusted¿ by large ICT firms, which will deliver according to their own rigid frameworks (often based on alliances with proprietary software vendors), may propose comfortable quality assurances, but will cover their (real) risks and liability with high contingency costs and will charge for any change request in case the original specifications have not fixed all possible issues. Introducing FLOSS in business implies a new contracting philosophy, based on incentives rather than penalties and liability. Based on 2011 experience with a large Space Agency, Patrice-Emmanuel Schmitz pictures the needed legal instruments for a novel approach.

Examples of retracts in a free group that are not the fixed subgroup of any group of automorphisms

Let F be a free group of rank at least three. We show that some retracts of F previously studied by Martino-Ventura are not equal to the fixed subgroup of any group of automorphisms of F. This shows that, in F, there exist subgroups that are equal to the fixed subgroup of some set of endomorphisms but are not equal to the fixed subgroup of any set of automorphisms. Moreover, we determine the Galois monoids of these retracts, where, by the Galois monoid of a subgroup H of F, we mean the monoid consisting of all endomorphisms of F that fix H.

The automorphism group of a free-by-cyclic group in rank 2

Vegeu el resum a l'inici del document del fitxer adjunt

Polynomial-time complexity for instances of the endomorphism problem in free groups

We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F, there is an endomorphism Φ of F sending W to U. This work analyzes an approach due to C. Edmunds and improved by C. Sims. Here we prove that the approach provides an efficient algorithm for solving the endomorphism problem when W is a two- generator word. We show that when W is a two-generator word this algorithm solves the problem in time polynomial in the length of U. This result gives a polynomial-time algorithm for solving, in free groups, two-variable equations in which all the variables occur on one side of the equality and all the constants on the other side.