Arithmetic expressions of Selberg's zeta functions for congruence subgroups

In [P. Sarnak, Class numbers of indefinite binary quadratic forms, J. Number Theory 15 (1982) 229-247], it was proved that the Selberg zeta function for SL₂(Z) is expressed in terms of the fundamental units and the class numbers of the primitive indefinite binary quadratic forms. The aim of this paper is to obtain similar arithmetic expressions of the logarithmic derivatives of the Selberg zeta functions for congruence subgroups of SL₂(Z). As applications, we study the Brun-Titchmarsh type prime geodesic theorem and the asymptotic formula of the sum of the class number.     

A robust and efficient adaptive reweighted estimator of multivariate location and scatter

This article proposes a reweighted estimator of multivariate location and scatter, with weights adaptively computed from the data. Its breakdown point and asymptotic behavior under elliptical distributions are established. This adaptive estimator is able to attain simultaneously the maximum possible breakdown point for affine equivariant estimators and full asymptotic efficiency at the multivariate normal distribution. For the special case of hard-rejection weights and the MCD as initial estimator, it is shown to be more efficient than its non-adaptive counterpart for a broad range of heavy-tailed elliptical distributions. A Monte Carlo study shows that the adaptive estimator is as robust as its non-adaptive relative for several types of bias-inducing contaminations, while it is remarkably more efficient under normality for sample sizes as small as 200.     

An estimate for symmetric square <Emphasis Type="Italic">L</Emphasis>-functions on weight aspect

We establish a mean square estimate on the weight aspect for symmetric square L-functions at every point on the critical line. Received: 15 February 2002     

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     

Lagrangian skeletons,periodic geodesic flows and symplectic cuttings

In this paper, we investigate symplectic manifolds endowed with a Morse–Bott function with only two critical submanifolds, one of which is Lagrangian while the other one is symplectic.     

关于非光滑不变凸多目标规划的Wolfe型对偶

本文讨论定义在Banach空间上的,既具有等式约束又具有不等式约束的,非光滑(F,P)不变凸多目标规划的Wolfe对偶性,Mond-Weir型对偶性可类似讨论之。     

Echo planar imaging of perfluorocarbons

Emulsions of perfluorotributylamine (FTBA) and perflubron were evaluated for their utility in ¹⁹F echo planar imaging. Fluorine images of the emulsions were obtained in a phantom and two mice that had been predosed. Both agents, but particularly perflubron, show potential for fluorine echo planar studies because of the long spin-spin relaxation times of the CF₃ resonances. High resolution thin slice images obtained in as little as 26.6 ms are presented.     

Riccati-based preconditioner for computing invariant subspaces of large matrices

Summary. This paper introduces and analyzes the convergence properties of a method that computes an approximation to the invariant subspace associated with a group of eigenvalues of a large not necessarily diagonalizable matrix. The method belongs to the family of projection type methods. At each step, it refines the approximate invariant subspace using a linearized Riccati's equation which turns out to be the block analogue of the correction used in the Jacobi-Davidson method. The analysis conducted in this paper shows that the method converges at a rate quasi-quadratic provided that the approximate invariant subspace is close to the exact one. The implementation of the method based on multigrid techniques is also discussed and numerical experiments are reported. Received June 15, 2000 / Revised version received January 22, 2001 / Published online October 17, 2001     

Minimizing the number of transitions with respect to observation equivalence

Labeled transition systems (lts) provide an operational semantics for many specification languages. In order to abstract unrelevant details of lts's, manybehavioural equivalences have been defined; here observation equivalence is considered. We are interested in the following problem:Given a finite lts, which is the minimal observation equivalent lts corresponding to it? It is well known that the number of states of an lts can be minimized by applying arelational coarsest partition algorithm. However, the obtained lts is not unique (up to the renaming of the states): for an lts there may exist several observation equivalent lts's which have the minimal number of states but varying number of transitions. In this paper we show how the number of transitions can be minimized, obtaining a unique lts.