A partition relation for successors of Large Cardinals

We address partition problems of Erd?s and Hajnal by showing that for all , if and carries a -dense ideal. If is measurable we show that for where is a very large ordinal less than that is closed under all primitive recursive ordinal operations. Received: 27 June 2001 / Revised version: 5 December 2001 / Published online: 4 February 2003 The first author was partially supported by NSF grant DMS-0101155 and the Equipe d'Analyse Univ. of Paris 6. The second author was partially supported by NSF grants DMS-0072560 and DMS-9704477.     

Feedback stabilization of a class of evolution equations with delay

In this paper, we characterize the stabilization of some delay systems. The proof of the main result uses the method introduced in Ammari and Tucsnak (ESAIM COCV 6:361–386, 2001) where the exponential stability for the closed loop problem is reduced to an observability estimate for the corresponding uncontrolled system combined with a boundedness property of the transfer function of the associated open loop system. The author would like to thank the Institute of Research for Development of France (IRD) and LMDP, the Laboratory of Mathematics and Dynamic of Populations in Marrakesh, for supporting his visit.     

Loop coproducts in string topology and triviality of higher genus TQFT operations

Cohen and Godin constructed a positive boundary topological quantum field theory (TQFT) structure on the homology of free loop spaces of oriented closed smooth manifolds by associating certain operations called string operations to orientable surfaces with parametrized boundaries. We show that all TQFT string operations associated to surfaces of genus at least one vanish identically. This is a simple consequence of properties of the loop coproduct which will be discussed in detail. One interesting property is that the loop coproduct is nontrivial only on the degree d homology group of the connected component of LM consisting of contractible loops, where d=dimM, with values in the degree 0 homology group of constant loops. Thus the loop coproduct behaves in a dramatically simpler way than the loop product.     

Solution of a Differential Game Formulation of Military Air Operations by the Method of Characteristics

In this paper, we describe a zero-sum differential game formulation for the control of military air operations. The model consists of a system of nonlinear ordinary differential equations for the dynamics of the operations and a suitably chosen quadratic payoff function. The control variables are the engagement intensities and velocities, and there are constraints on the controls. The method of characteristics (based on the Pontryagin maximum principle) is used to solve the associated Hamilton-Jacobi equation. In this nonlinear formulation, the Hamiltonian can be optimized explicity with respect to the controls. Numerical simulations study the enforcement of constraints (a) by means of penalties in the payoff function or (b) explicitly. The numerical results show robustness with respect to various parameters.Effort sponsored by the Defense Advanced Research Projects Agency (DARPA) and Air Force Research Laboratory, Air Force Material Command, USAF, under Agreement F30602-99-2-0551. A shorter version of this paper appeared in the Proceedings of the 2001 American Control Conference, pp. 168--175, 2001.     

Quasilinear -equation on bordered Riemann surfaces

We consider the existence of solutions of a nonlinear Riemann-Hilbert problem for a quasilinear -equation on a bordered Riemann surface. The first author was supported in part by a grant ``Analiza in geometrija' P1-0291 from the Ministry of Higher Education, Science and Technology of the Republic of Slovenia. The second author was supported in part by grants from FEDER y Ministerio de Ciencia y Tecnología numbers BFM2001-3894 MTM 2004-05878 and Consejería de Educacion Cultura y Deportes del Gobierno de Canarias, PI 2001/091.     

Order-Value Optimization: Formulation and solution by means of a primal cauchy method

The Order-Value Optimization (OVO) problem is a generalization of the classical Minimax problem. Instead of the maximum of a set functions, the functional value that ranks in the p-th place is minimized. The problem seeks the application to (non-pessimistic) decision making and to model fitting in the presence of (perhaps systematic) outliers. A Cauchy-type method is introduced that solves the problem in the sense that every limit point satisfies an adequate optimality condition. Numerical examples are given.This author was supported by FAPESP (Grant 01/05492-1) and CNPq (Grant 301115/96-6)This author was supported by PRONEX, FAPESP (PT 2001-04597-4)     

Numerical Comparison of Augmented Lagrangian Algorithms for Nonconvex Problems

Augmented Lagrangian algorithms are very popular tools for solving nonlinear programming problems. At each outer iteration of these methods a simpler optimization problem is solved, for which efficient algorithms can be used, especially when the problems are large. The most famous Augmented Lagrangian algorithm for minimization with inequality constraints is known as Powell-Hestenes-Rockafellar (PHR) method. The main drawback of PHR is that the objective function of the subproblems is not twice continuously differentiable. This is the main motivation for the introduction of many alternative Augmented Lagrangian methods. Most of them have interesting interpretations as proximal point methods for solving the dual problem, when the original nonlinear programming problem is convex. In this paper a numerical comparison between many of these methods is performed using all the suitable problems of the CUTE collection.This author was supported by ProNEx MCT/CNPq/FAPERJ 171.164/2003, FAPESP (Grants 2001/04597-4 and 2002/00094-0 and 2003/09169-6) and CNPq (Grant 302266/2002-0).This author was partially supported by CNPq-Brasil and CDCHT-Venezuela.This author was supported by ProNEx MCT/CNPq/FAPERJ 171.164/2003, FAPESP (Grant 2001/04597-4) and CNPq.     

Primal-Dual Simplex Method for Multiobjective Linear Programming

We develop a primal-dual simplex algorithm for multicriteria linear programming. It is based on the scalarization theorem of Pareto optimal solutions of multicriteria linear programs and the single objective primal-dual simplex algorithm. We illustrate the algorithm by an example, present some numerical results, give some further details on special cases and point out future research. The paper was written during a visit of the first author to the University of Sevilla financed by a grant of the Andalusian Consejería de Educación. The research of the first author was partially supported by University of Auckland Grant 3602178/9275. The research of the second and third authors was partially financed by Spanish Grants BFM2001-2378, BFM2001-4028, MTM2004-0909 and HA2003-0121. We thank Anthony Przybylski for the implementation and making his results available. We thank the anonymous referees, whose comments have helped us to improve the presentation of the paper.     

Automorphism groups of differentiable double loops

In this paper, we study local and global topological loops as well as topological double loops having a differentiable structure such that the loop operations are differentiable. The main result states that the group of differentiable automorphisms of a differentiable double loop is compact with respect to the compact-open topology.Dedicated to Karl H. Hofmann, on the occasion of his 60th birthday     

THE UNIQUENESS OF BIFURCATION TO SEPARATRIX LOOPS IN SUPERCRITICAL CASES

ＴＨＥＵＮＩＱＵＥＮＥＳＳＯＦＢＩＦＵＲＣＡＴＩＯＮＴＯＳＥＰＡＲＡＴＲＩＸＬＯＯＰＳＩＮＳＵＰＥＲＣＲＩＴＩＣＡＬＣＡＳＥＳ￥ＳＵＮＪＩＡＮＨＵＡ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＮａｎｊｉｎｇＵｎｉｖｅｒｓｉｔｙ，Ｎａｎｊｉｎｇ２...     

Modeling the memory and performance impacts of loop fusion

On modern processors, data transfer exceeds floating-point operations as the predominant cost in many linear algebra computations. One tuning technique that focuses on reducing memory accesses is loop fusion. Determining the optimum amount of loop fusion to apply to a routine is difficult as fusion can both positively and negatively impact memory traffic. We present a model that accurately and efficiently evaluates how loop fusion choices affect data movement through the memory hierarchy. We show how to convert the model’s memory traffic predictions to runtime estimates that can be used to compare loop fusion variants.     

$L^p$ Approximation of maps by diffeomorphisms

It is shown that if then every map of class can be approximated in the -norm by a sequence of orientation-preserving diffeomorphims These conclusions hold provided that is open, bounded, and that In addition, is contained in the -neighborhood of the convex hull of All these conclusions fail for The main ingredients of the proof are the polar factorization of maps [4] and an approximation result for measure-preserving maps on the unit cube for which we provide a proof based on the concept of doubly stochastic measures (Corollary 1.1). Received: 25 My 2001 / Accepted: 25 October 2001 / Published online: 29 April 2002 RID="*" ID="*" en détachement de l'Université Paris 6, France The second author gratefully acknowledges the support of National Science Foundation grants DMS-99-70520, and DMS-00-74037     

Minimal varieties and quasivarieties of semilattices with one automorphism

We describe all minimal quasivarieties and all minimal varieties of semilattices with one automorphism (considered as algebras with one binary and two unary operations). While working on this paper, the first author was supported by CRDF grant KYM1-2852-BI-07, the second author was supported by the institutional grant MSM0021620839 financed by MSMT, and the third author was partially supported by the Hungarian National Foundation for Scientific Research (OTKA), grant nos. T 48809 and K 60148.     

An analogue of Hajós' Theorem for the circular chromatic number

This paper designs a set of graph operations and proves that starting from , by repeatedly applying these operations, one can construct all graphs with (for ). This can be viewed as an analogue of Hajós' Theorem for the circular chromatic number.

     

Soft Ideals and Arithmetic Mean Ideals

This article investigates the soft-interior (se) and the soft-cover (sc) of operator ideals. These operations, and especially the first one, have been widely used before, but making their role explicit and analyzing their interplay with the arithmetic mean operations is essential for the study in [10] of the multiplicity of traces. Many classical ideals are ‘soft’, i.e., coincide with their soft interior or with their soft cover, and many ideal constructions yield soft ideals. Arithmetic mean (am) operations were proven to be intrinsic to the theory of operator ideals in [6, 7] and arithmetic mean operations at infinity (am-∞) were studied in [10]. Here we focus on the commutation relations between these operations and soft operations. In the process we characterize the am-interior and the am-∞ interior of an ideal. Both authors were partially supported by grants of the Charles Phelps Taft Research Center; the second named author was partially supported by NSF Grants DMS 95-03062 and DMS 97-06911.     

Strategies of loop recombination in ciliates

The concept of breakpoint graph, known from the theory of sorting by reversal, has been successfully applied in the theory of gene assembly in ciliates. We further investigate its usage for gene assembly, and show that the graph allows for an efficient characterization of the possible orders of loop recombination operations (one of the three types of molecular operations that accomplish gene assembly) for a given gene during gene assembly. The characterization is based on spanning trees within a graph built upon the connected components in the breakpoint graph. We work in the abstract and more general setting of so-called legal strings.     

Hankel and Toeplitz–Schur multipliers

We study the problem of characterizing Hankel–Schur multipliers and Toeplitz–Schur multipliers of Schatten–von Neumann class for . We obtain various sharp necessary conditions and sufficient conditions for a Hankel matrix to be a Schur multiplier of . We also give a characterization of the Hankel–Schur multipliers of whos e symbols have lacunary power series. Then the results on Hankel–Schur multipliers are used to obtain a characterization of the Toeplitz–Schur multipliers of . Finally, we return to Hankel–Schur multipliers and obtain new results in the case when the symbol of the Hankel matrix is a complex measure on the unit circle. Received: 16 February 2001 / revised version: 2 December 2001 / Published online: 27 June 2002 The first author is partially supported by Grant 99-01-00103 of Russian Foundation of Fundamental Studies and by Grant 326.53 of Integration. The second author is partially supported by NSF grant DMS 9970561.     

Perturbed closed geodesics are periodic orbits: Index and transversality

We study the classical action functional ${\cal S}_V$ on the free loop space of a closed, finite dimensional Riemannian manifold M and the symplectic action on the free loop space of its cotangent bundle. The critical points of both functionals can be identified with the set of perturbed closed geodesics in M. The potential $V\in C^\infty(M\times S^1,\mathbb{R})$ serves as perturbation and we show that both functionals are Morse for generic V. In this case we prove that the Morse index of a critical point x of equals minus its Conley-Zehnder index when viewed as a critical point of and if is trivial. Otherwise a correction term +1 appears. Received: 21 May 2001; in final form: 10 October 2001 / Published online: 4 April 2002