Twisted conjugacy classes in symplectic groups, mapping class groups and braid groups (with an appendix written jointly with Francois Dahmani)

We prove that the symplectic group Sp(2n, Z) and the mapping class group Mod(S) of a compact surface S satisfy the R(infinity) property. We also show that B(n)(S), the full braid group on n-strings of a surface S, satisfies the R(infinity) property in the cases where S is either the compact disk D, or the sphere S(2). This means that for any automorphism phi of G, where G is one of the above groups, the number of twisted phi-conjugacy classes is infinite.

On a formula for the spectral flow and its applications

We consider a continuous path of bounded symmetric Fredholm bilinear forms with arbitrary endpoints on a real Hilbert space, and we prove a formula that gives the spectral flow of the path in terms of the spectral flow of the restriction to a finite codimensional closed subspace. We also discuss the case of restrictions to a continuous path of finite codimensional closed subspaces. As an application of the formula, we introduce the notion of spectral flow for a periodic semi-Riemannian geodesic, and we compute its value in terms of the Maslov index. (C) 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

Noncommutative Jordan superalgebras of degree n > 2

We prove a coordinatization theorem for noncommutative Jordan superalgebras of degree n > 2, describing such algebras. It is shown that the symmetrized Jordan superalgebra for a simple finite-dimensional noncommutative Jordan superalgebra of characteristic 0 and degree n > 1 is simple. Modulo a ""nodal"" case, we classify central simple finite-dimensional noncommutative Jordan superalgebras of characteristic 0.

Pseudo Focal Points Along Lorentzian Geodesics and Morse Index

Given a Lorentzian manifold (M,g), a geodesic gamma in M and a timelike Jacobi field Y along gamma, we introduce a special class of instants along gamma that we call Y-pseudo conjugate (or focal relatively to some initial orthogonal submanifold). We prove that the Y-pseudo conjugate instants form a finite set, and their number equals the Morse index of (a suitable restriction of) the index form. This gives a Riemannian-like Morse index theorem. As special cases of the theory, we will consider geodesics in stationary and static Lorentzian manifolds, where the Jacobi field Y is obtained as the restriction of a globally defined timelike Killing vector field.

Boutet de Monvel`s calculus and groupoids I

Can Boutet de Monvel`s algebra on a compact manifold with boundary be obtained as the algebra Psi(0)(G) of pseudodifferential operators on some Lie groupoid G? If it could, the kernel G of the principal symbol homomorphism would be isomorphic to the groupoid C*-algebra C*(G). While the answer to the above question remains open, we exhibit in this paper a groupoid G such that C*(G) possesses an ideal I isomorphic to G. In fact, we prove first that G similar or equal to Psi circle times K with the C*-algebra Psi generated by the zero order pseudodifferential operators on the boundary and the algebra K of compact operators. As both Psi circle times K and I are extensions of C(S*Y) circle times K by K (S*Y is the co-sphere bundle over the boundary) we infer from a theorem by Voiculescu that both are isomorphic.

Nonhomogeneous subalgebras of Lie and special Jordan superalgebras

We consider polynomial identities satisfied by nonhomogeneous subalgebras of Lie and special Jordan superalgebras: we ignore the grading and regard the superalgebra as an ordinary algebra. The Lie case has been studied by Volichenko and Baranov: they found identities in degrees 3, 4 and 5 which imply all the identities in degrees <= 6. We simplify their identities in degree 5, and show that there are no new identities in degree 7. The Jordan case has not previously been studied: we find identities in degrees 3, 4, 5 and 6 which imply all the identities in degrees <= 6, and demonstrate the existence of further new identities in degree 7. our proofs depend on computer algebra: we use the representation theory of the symmetric group, the Hermite normal form of an integer matrix, the LLL algorithm for lattice basis reduction, and the Chinese remainder theorem. (C) 2009 Elsevier Inc. All rights reserved.

GENERICITY OF NONDEGENERATE GEODESICS WITH GENERAL BOUNDARY CONDITIONS

Let M be a possibly noncompact manifold. We prove, generically in the C(k)-topology (2 <= k <= infinity), that semi-Riemannian metrics of a given index on M do not possess any degenerate geodesics satisfying suitable boundary conditions. This extends a result of L. Biliotti, M. A. Javaloyes and P. Piccione [6] for geodesics with fixed endpoints to the case where endpoints lie on a compact submanifold P subset of M x M that satisfies an admissibility condition. Such condition holds, for example, when P is transversal to the diagonal Delta subset of M x M. Further aspects of these boundary conditions are discussed and general conditions under which metrics without degenerate geodesics are C(k)-generic are given.

Financial time series analysis : Chaos and neurodynamics approach

This work aims at combining the Chaos theory postulates and Artificial Neural Networks classification and predictive capability, in the field of financial time series prediction. Chaos theory, provides valuable qualitative and quantitative tools to decide on the predictability of a chaotic system. Quantitative measurements based on Chaos theory, are used, to decide a-priori whether a time series, or a portion of a time series is predictable, while Chaos theory based qualitative tools are used to provide further observations and analysis on the predictability, in cases where measurements provide negative answers. Phase space reconstruction is achieved by time delay embedding resulting in multiple embedded vectors. The cognitive approach suggested, is inspired by the capability of some chartists to predict the direction of an index by looking at the price time series. Thus, in this work, the calculation of the embedding dimension and the separation, in Takens‘ embedding theorem for phase space reconstruction, is not limited to False Nearest Neighbor, Differential Entropy or other specific method, rather, this work is interested in all embedding dimensions and separations that are regarded as different ways of looking at a time series by different chartists, based on their expectations. Prior to the prediction, the embedded vectors of the phase space are classified with Fuzzy-ART, then, for each class a back propagation Neural Network is trained to predict the last element of each vector, whereas all previous elements of a vector are used as features.

Analysis of response to enteral infusion of levodopa in patients with Parkinson's disease

Objective: We present a new evaluation of levodopa plasma concentrations and clinical effects during duodenal infusion of a levodopa/carbidopa gel (Duodopa ) in 12 patients with advanced Parkinson s disease (PD), from a study reported previously (Nyholm et al, Clin Neuropharmacol 2003; 26(3): 156-163). One objective was to investigate in what state of PD we can see the greatest benefits with infusion compared with corresponding oral treatment (Sinemet CR). Another objective was to identify fluctuating response to levodopa and correlate to variables related to disease progression. Methods: We have computed mean absolute error (MAE) and mean squared error (MSE) for the clinical rating from -3 (severe parkinsonism) to +3 (severe dyskinesia) as measures of the clinical state over the treatment periods of the study. Standard deviation (SD) of the rating was used as a measure of response fluctuations. Linear regression and visual inspection of graphs were used to estimate relationships between these measures and variables related to disease progression such as years on levodopa (YLD) or unified PD rating scale part II (UPDRS II).Results: We found that MAE for infusion had a strong linear correlation to YLD (r2=0.80) while the corresponding relation for oral treatment looked more sigmoid, particularly for the more advanced patients (YLD>18).

A home environment test battery for status assessment in patients with motor fluctuations

Background and aims Evaluating status in patients with motor fluctuations is complex and occasional observations/measurements do not give an adequate picture as to the time spent in different states. We developed a test battery to assess advanced Parkinson patients' status consisting of diary assessments and motor tests. This battery was constructed and implemented on a handheld computer with built-in mobile communication. In fluctuating patients, it should typically be used several times daily in the home environment, over periods of about one week. The aim of this battery is to provide status information in order to evaluate treatment effects in clinical practice and research, follow up treatments and disease progression and predict outcome to optimize treatment strategy. Methods Selection of diary questions was based on a previous study with Duodopa® (DIREQT). Tapping tests (with and without visual cueing) and a spiral drawing test were added. Rapid prototyping was used in development of the user interface. An evaluation with two pilot patients was performed before and after receiving new treatments for advanced disease (one received Duodopa® and one received DBS). Speed and proportion missed taps were calculated for the tapping tests and entropy of the radial drawing velocity was calculated for the spiral tests. Test variables were evaluated using non-parametric statistics. Results Post-treatment improvement was detected in both patients in many of the test variables. Conclusions Although validation work remains, preliminary results are promising and the test battery is currently being evaluated in a long-term health economics study with Duodopa® (DAPHNE).

Fred: An approach to generating real, correct, reusable programs from proofs

In this paper we describe our system for automatically extracting "correct" programs from proofs using a development of the Curry-Howard process. Although program extraction has been developed by many authors, our system has a number of novel features designed to make it very easy to use and as close as possible to ordinary mathematical terminology and practice. These features include 1. the use of Henkin's technique to reduce higher-order logic to many-sorted (first-order) logic; 2. the free use of new rules for induction subject to certain conditions; 3. the extensive use of previously programmed (total, recursive) functions; 4. the use of templates to make the reasoning much closer to normal mathematical proofs and 5. a conceptual distinction between the computational type theory (for representing programs)and the logical type theory (for reasoning about programs). As an example of our system we give a constructive proof of the well known theorem that every graph of even parity, which is non-trivial in the sense that it does not consist of isolated vertices, has a cycle. Given such a graph as input, the extracted program produces a cycle as promised.

Protocols between programs and proofs

In this paper we describe a new protocol that we call the Curry-Howard protocol between a theory and the programs extracted from it. This protocol leads to the expansion of the theory and the production of more powerful programs. The methodology we use for automatically extracting “correct” programs from proofs is a development of the well-known Curry-Howard process. Program extraction has been developed by many authors, but our presentation is ultimately aimed at a practical, usable system and has a number of novel features. These include 1. a very simple and natural mimicking of ordinary mathematical practice and likewise the use of established computer programs when we obtain programs from formal proofs, and 2. a conceptual distinction between programs on the one hand, and proofs of theorems that yield programs on the other. An implementation of our methodology is the Fred system. As an example of our protocol we describe a constructive proof of the well-known theorem that every graph of even parity can be decomposed into a list of disjoint cycles. Given such a graph as input, the extracted program produces a list of the (non-trivial) disjoint cycles as promised.