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."

A new compact linear programming formulation for choice network revenue management

The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.

Implementation, elimination of weakly dominated strategies and evolutionary dynamics

This paper is concerned with the realism of mechanisms that implementsocial choice functions in the traditional sense. Will agents actually playthe equilibrium assumed by the analysis? As an example, we study theconvergence and stability properties of Sj\"ostr\"om's (1994) mechanism, onthe assumption that boundedly rational players find their way to equilibriumusing monotonic learning dynamics and also with fictitious play. Thismechanism implements most social choice functions in economic environmentsusing as a solution concept the iterated elimination of weakly dominatedstrategies (only one round of deletion of weakly dominated strategies isneeded). There are, however, many sets of Nash equilibria whose payoffs maybe very different from those desired by the social choice function. Withmonotonic dynamics we show that many equilibria in all the sets ofequilibria we describe are the limit points of trajectories that havecompletely mixed initial conditions. The initial conditions that lead tothese equilibria need not be very close to the limiting point. Furthermore,even if the dynamics converge to the ``right'' set of equilibria, it stillcan converge to quite a poor outcome in welfare terms. With fictitious play,if the agents have completely mixed prior beliefs, beliefs and play convergeto the outcome the planner wants to implement.

Carleson Measures and Logvinenko-Sereda sets on compact manifolds

Given a compact Riemannian manifold $M$ of dimension $m \geq 2$, we study the space of functions of $L^2(M)$generated by eigenfunctions ofeigenvalues less than $L \geq 1$ associated to the Laplace-Beltrami operator on $M$. On these spaces we give a characterization of the Carleson measures and the Logvinenko-Sereda sets.

Beurling-Landau densities of weighted Fekete sets and correlation kernel estimates

Let $Q$ be a suitable real function on $C$. An $n$-Fekete set corresponding to $Q$ is a subset ${Z_{n1}},\dotsb, Z_{nn}}$ of $C$ which maximizes the expression $\Pi^n_i_{compact set $S$ known as the 'droplet' such that the measures $\mu_n n^{-1} (\delta_{zn1}+\dots+\delta_{znn})$ converges to the equilibrium measure $\Delta Q.1 _S$d$A$ as $n \rightarrow \infty$. In this note we prove that Fekete sets are, in a sense, maximally spread out with respect to the equilibrium measure. In general, our results apply only to a part of the Fekete set, which is at a certain distance away from the boundary of the droplet. However, for the potential $Q=|Z|^2$ we obtain results which hold globally, and we conjecture that such global results are true for a wide range of potentials.

On the Connectivity of the Julia sets of meromorphic functions

We prove that every transcendental meromorphic map $f$ with disconnected Julia set has a weakly repelling fixed point. This implies that the Julia set of Newton's method for finding zeroes of an entire map is connected. Moreover, extending a result of Cowen for holomorphic self-maps of the disc, we show the existence of absorbing domains for holomorphic self-maps of hyperbolic regions, whose iterates tend to a boundary point. In particular, the results imply that periodic Baker domains of Newton's method for entire maps are simply connected, which solves a well-known open question.

Non compact euclidean cone 3-manifolds with cone angles less than 2∏

We study of noncompact Euclidean cone manifolds with cone angles less than c&2π and singular locus a submanifold. More precisely, we describe its structure outside a compact set. As a corol lary we classify those with cone angles & 2π/3 and those with cone angles = 2π/3.

Lipschitz harmonic capacity and Bilipschitz images of cantor sets

For bilipschitz images of Cantor sets in Rd we estimate the Lipschitz harmonic capacity and show this capacity is invariant under bilipschitz homeomorphisms.

Parametric analysis of different compact tension specimens for fracture toughness characterisation in woven composite materials

Estudi elaborat a partir d’una estada a l’ Imperial College London, entre juliol i novembre de 2006. En aquest treball s’ha investigat la geometria més apropiada per a la caracterització de la tenacitat a fractura intralaminar de materials compòsits laminats amb teixit. L’objectiu és assegurar la propagació de l’esquerda sense que la proveta falli abans per cap altre mecanisme de dany per tal de permetre la caracterització experimental de la tenacitat a fractura intralaminar de materials compòsits laminats amb teixit. Amb aquesta fi, s’ha dut a terme l’anàlisi paramètrica de diferents tipus de provetes mitjançant el mètode dels elements finits (FE) combinat amb la virtual crack closure technique (VCCT). Les geometries de les provetes analitzades corresponen a la proveta de l’assaig compact tension (CT) i diferents variacions com la extended compact tension (ECT), la proveta widened compact tension (WCT), tapered compact tension (TCT) i doubly-tapered compact tension (2TCT). Com a resultat d’aquestes anàlisis s’han derivat diferents conclusions per obtenir la geometria de proveta més apropiada per a la caracterització de la tenacitat a fractura intralaminar de materials compòsits laminats amb teixit. A més, també s’han dut a terme una sèrie d’assaigs experimentals per tal de validar els resultats de les anàlisis paramètriques. La concordança trobada entre els resultats numèrics i experimentals és bona tot i la presència d’efectes no previstos durant els assaigs experimentals.

Developing discontinuous Galerkin methods for the resolution of the incompressible Navier-Stokes equations

Informe de investigación elaborado a partir de una estancia en el Laboratorio de Diseño Computacional en Aeroespacial en el Massachusetts Institute of Technology (MIT), Estados Unidos, entre noviembre de 2006 y agosto de 2007. La aerodinámica es una rama de la dinámica de fluidos referida al estudio de los movimientos de los líquidos o gases, cuya meta principal es predecir las fuerzas aerodinámicas en un avión o cualquier tipo de vehículo, incluyendo los automóviles. Las ecuaciones de Navier-Stokes representan un estado dinámico del equilibrio de las fuerzas que actúan en cualquier región dada del fluido. Son uno de los sistemas de ecuaciones más útiles porque describen la física de una gran cantidad de fenómenos como corrientes del océano, flujos alrededor de una superficie de sustentación, etc. En el contexto de una tesis doctoral, se está estudiando un flujo viscoso e incompresible, solucionando las ecuaciones de Navier- Stokes incompresibles de una manera eficiente. Durante la estancia en el MIT, se ha utilizado un método de Galerkin discontinuo para solucionar las ecuaciones de Navier-Stokes incompresibles usando, o bien un parámetro de penalti para asegurar la continuidad de los flujos entre elementos, o bien un método de Galerkin discontinuo compacto. Ambos métodos han dado buenos resultados y varios ejemplos numéricos se han simulado para validar el buen comportamiento de los métodos desarrollados. También se han estudiado elementos particulares, los elementos de Raviart y Thomas, que se podrían utilizar en una formulación mixta para obtener un algoritmo eficiente para solucionar problemas numéricos complejos.

Persistent bundles over a two dimensional compact set

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

Maximal operators and differentiation theorems for sparse sets

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

Calderón-Zygmund capacities and Wolff potentials on Cantor sets

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

Generic optimality conditions for semi-algebraic convex programs

We consider linear optimization over a nonempty convex semi-algebraic feasible region F. Semidefinite programming is an example. If F is compact, then for almost every linear objective there is a unique optimal solution, lying on a unique \active" manifold, around which F is \partly smooth", and the second-order sufficient conditions hold. Perturbing the objective results in smooth variation of the optimal solution. The active manifold consists, locally, of these perturbed optimal solutions; it is independent of the representation of F, and is eventually identified by a variety of iterative algorithms such as proximal and projected gradient schemes. These results extend to unbounded sets F.

Beurling-Landau densities of weighted Fekete sets and correlation kernel estimates

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