The focusing problem for the Eikonal equation

We study the focusing problem for the eikonal equation¶¶ ?_tu=| ?u| ², \partial _{t}u=\left| \nabla u\right| ^{2}, ¶¶i.e., the initial value problem in which the support of the initial datum is outside some compact set in R^d \mathbf{R}^{d} . The hole in the support will be filled in finite time and we are interested in the asymptotics of the hole as it closes. We show that in the radially symmetric case there are self-similar asymptotics, while in the absence of radial symmetry essentially any convex final shape is possible. However in R² \mathbf{R}^2 , for generic initial data the asymptotic shape will be either a vanishing triangle or the region between two parabolas moving in opposite directions (a closing eye). We compare these results with the known results for the porous medium pressure equation which approaches the eikonal equation in the limit as m? 1 m\rightarrow 1 .     

Continuous modified Newton’s-type method for nonlinear operator equations

A nonlinear operator equation F(x)=0, F:H→H, in a Hilbert space is considered. Continuous Newton’s-type procedures based on a construction of a dynamical system with the trajectory starting at some initial point x ₀ and becoming asymptotically close to a solution of F(x)=0 as t→+∞ are discussed. Well-posed and ill-posed problems are investigated. Received: June 29, 2001; in final form: February 26, 2002?Published online: February 20, 2003 This paper was finished when AGR was visiting Institute for Theoretical Physics, University of Giessen. The author thanks DAAD for support     

CM-triviality and generic structures

 We show that any relational generic structure whose theory has finite closure and amalgamation over closed sets is stable CM-trivial with weak elimination of imaginaries. Received: 21 December 2001 / Published online: 5 November 2002 Mathematics Subject Classification (2000): 03C45 Key words or phrases: CM-triviality – Generic structures – Stability     

Upper and lower bounds for the fixed spectrum frequency assignment problem

A survey of the results described in the authors PhD thesis (Montemanni 2001) is presented. The thesis, which was supervised by Prof. Derek H. Smith and Dr. Stuart M. Allen, has been defended in January 2002 at the University of Glamorgan (U.K.). The thesis proposes new heuristic algorithms, based on well-known meta-heuristic paradigms, and new lower bounding techniques, based on linear programming, for the fixed spectrum frequency assignment problem.Received: May 2003, Revised: May 2003, AMS classification: 90C27, 90C59,05C90, 90C05Roberto Montemanni: Present address: Istituto Dalle Molle di Studi sullIntelligenza Artificiale (IDSIA), Galleria 2, 6928 Manno-Lugano, Switzerland (e-mail: roberto@idsia.ch)     

A Bitangential Interpolation Problem on the Closed Unit Ball for Multipliers of the Arveson Space

We solve a bitangential interpolation problem for contractive multipliers on the Arveson space with an arbitrary interpolating set in the closed unit ball . The solvability criterion is established in terms of positive kernels. The set of all solutions is parametrized by a Redheffer transform. Submitted: February 2, 2002.