Computation of the Morse Spectrum

The Morse spectrum is a limit set of Lyapunov exponents of periodic pseudo-trajectories. This notion is especially important in the case where a dynamical system has infinitely many periodic trajectories of large period. A method for estimating the Morse spectrum was suggested by the first author in J. Math. Anal. Appl., 252 (2000). This method is based on ideas of symbolic dynamics which reduces the study of a dynamical system to the study of a certain graph, called a symbolic image. Within the framework of this method, the computation of the Morse spectrum is connected with searching simple closed paths and extracting contours with suitable characteristics. However, under iterations of the symbolic image, the number of such paths sharply increases, which leads to huge expenses of memory and time. We suggest an algorithm for constructing contours with the maximal and minimal mean values. This algorithm is based on a special version of the simplex method. Numerical tests are also described. Bibliography: 13 titles. Illustrations: 3 figures.     

Allocating energy in a first-to-n match

This paper models a decision where a player must allocate limitedenergy over a contest of uncertain length. The motivating exampleis a squash match where one of the players is not as fit asthe other. Should a player's energy be concentrated in the earlygames of the match? Should it be spread evenly over all possiblegames? Or should it be conserved for the end of the match? Wemodel this as a decision problem where, in each game, the decision-makermust determine how much energy to expend. We assume that thereare only a small number of discrete energy choices for eachgame and that the more energy the decision-maker expends, themore likely he is to win that game. We solve for the optimaldecision with dynamic programming. With only two possible energychoices for each game, we show that it does not matter how energyis expended. In the case where there are three or more energychoices, we show how to take advantage of the structure of theproblem to determine the optimal sequence of decisions. As forpractical advice, the model suggests that when the decision-makerfalls behind in a match, he ought to switch to a more conservativeapproach by dividing his remaining energy evenly among all thepossible remaining games. Received 14 May 2003. Revised 5 January 2004.     

Numerical Modeling of Solitons in a Low Birefringent Optical Fiber

A numerical investigation, based on the split-step Fourier transform algorithm of all optical switching of solitons in a low birefringent optical fiber is presented. The numerical algorithm is described in detail. This revised version was published online in August 2006 with corrections to the Cover Date.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Homogeneous quaternionic Kähler structures of linear type

A classification of homogeneous quaternionic Kähler structures by real tensors is given and related to Fino's representation theoretic decomposition. A relationship between the modules whose dimension grows linearly and quaternionic hyperbolic space is found. To cite this article: M. Castrillón López et al., C. R. Acad. Sci. Paris, Ser. I 338 (2004).     

Dynamics and crystal chemistry of tellurites. II. Composition- and temperature-dependence of the Raman spectra of x(Tl2O)+(1−x) Te2O glasses: evidence for a phase separation?

Immiscibility effects are suggested to be inherent in tellurite glasses with weak (low valence) cations. This hypothesis is used to explain the structural evolution of the x(Tl₂O)+(1−x)Te₂O glass system as a function of the x value and during temperature-induced crystallisation processes. The results of Raman measurements support the hypothesis.     

Intercomparison of retrieval codes used for the analysis of high-resolution, ground-based FTIR measurements

A rigorous and systematic intercomparison of codes used for the retrieval of trace gas profiles from high-resolution ground-based solar absorption FTIR measurements is presented for the first time. Spectra were analyzed with the two widely used independent, retrieval codes: SFIT2 and PROFFIT9. Vertical profiles of O₃, HNO₃, HDO, and N₂O were derived from the same set of typical observed spectra. Analysis of O₃ was improved by using updated line parameters. It is shown that profiles and total column amounts are in excellent agreement, when similar constraints are applied, and that the resolution kernel matrices are also consistent. Owing to the limited altitude resolution of ground-based observations, the impact of the constraints on the solution is not negligible. It is shown that the results are also compatible for independently chosen constraints. Perspectives for refined constraints are discussed. It can be concluded that the error budget introduced by the radiative transfer code and the retrieval algorithm on total columns deduced from high-resolution ground-based solar FTIR spectra is below 1%.     

Equilibrium States in the Quadruple–Kerr Solution

The extended quadruple–Kerr metric is used to consider equilibrium states of four collinear Kerr particles. We explain our previous failure to solve numerically the full set of the balance equations, and we derive a self–consistent system of the axis conditions leading to the equilibrium of all four constituents which can be black holes or hyperextreme objects. The equilibrium configurations obtained in this paper exhibit similar features with those occurring in the systems of two Kerr particles, for instance, the balance of four Kerr black holes with positive masses does not seem possible. Equilibrium states of two identical compound Kerr objects are also discussed.     

Letter: Models of Relativistic Particle with Curvature and Torsion Revisited

Models, describing relativistic particles, where Lagrangian densities depend linearly on both the curvature and the torsion of the trajectories, are revisited in D=3 space forms. The moduli spaces of trajectories are completely and explicitly determined using the Lancret program. The moduli subspaces of closed solitons in the three sphere are also determined.