Extension of bounded holomorphic functions¶in convex domains

The E. Amar and G. Henkin theorem on the bounded extendability of bounded holomorphic functions from certain closed complex submanifolds of strictly pseudoconvex domains to the whole domain is generalized to the case of finite type convex domains and their intersections with affine linear hyperplanes. Suitable integral operators of Berndtsson–Andersson type are constructed and estimated for this purpose. Received: 7 July 2000     

Division des distributions et applications à l'étude d'idéaux de fonctions holomorphes

In this Note, we construct residue currents without Hironaka's theorem. As an application, we obtain a representation formula for holomorphic function as in Passare (Math. Scand. 62 (1988) 75–152). To cite this article: E. Mazzilli, C. R. Acad. Sci. Paris, Ser. I 338 (2004).     

Construction of new soliton-like solutions of the (2 + 1) dimensional dispersive long wave equation

By using a improved extended tanh method with the aid of symbolic computation system, some new soliton-like solutions of the (2 + 1) dimensional spaces long wave equation are obtained.     

Extension des fonctions holomorphes dans les pseudo-ellipsoïdes

Sans résumé Received 17 April 1996; in final form 9 July 1996     

Multivariate Cramér-Rao inequality for prediction and efficient predictors

We derive and discuss a matricial Cramér-Rao type inequality for the quadratic prediction error matrix. A study of the attainment of the bound follows. Then we introduce an unbiased predictor for a bivariate Poisson process and prove that it is efficient, i.e. its quadratic error attains the Cramér-Rao bound.     

Détermination géométrique de la systole des groupes de triangles

In this Note we give an explicit formula for the length of the shortest geodesic loop for hyperbolic spheres with three singularities of order greater than 3.     

Mixing is an aggregation processLe mélange est un processus d'agrégation

With the aid of several demonstration experiments, it is shown how a stirred scalar mixture relaxes towards uniformity through an aggregation process. The elementary bricks are stretched sheets whose rates of diffusive smoothing and coalescence build up the overall mixture concentration distribution. The cases studied, in particular, include mixtures in two and three dimensions, with different stirring protocols, which all lead to a family of concentration distributions stable by self-convolution. To cite this article: E. Villermaux, J. Duplat, C. R. Mecanique 331 (2003).     

On the modular curves

Let denote an elliptic curve over and the modular curve classifying the elliptic curves over such that the representations of in the 7-torsion points of and of are symplectically isomorphic. In case is given by a Weierstraß equation such that the invariant is a square, we exhibit here nontrivial points of . From this we deduce an infinite family of curves for which has at least four nontrivial points.

     

Design Adaptive Nearest Neighbor Regression Estimation

This paper deals with nonparametric regression estimation under arbitrary sampling with an unknown distribution. The effect of the distribution of the design, which is a nuisance parameter, can be eliminated by conditioning. An upper bound for the conditional mean squared error of k−NN estimates leads us to consider an optimal number of neighbors, which is a random function of the sampling. The corresponding estimate can be used for nonasymptotic inference and is also consistent under a minimal recurrence condition. Some deterministic equivalents are found for the random rate of convergence of this optimal estimate, for deterministic and random designs with vanishing or diverging densities. The proposed estimate is rate optimal for standard designs.