Séries trigonométriques à coefficients arithmétiques

Journal d'Analyse Mathématique -     

The preparation of 2-iodoamides from glucals and their further transformations into oxazolines

2-Deoxy-2-iodo-glycosylamides have been prepared from a variety of protected d-glucals by their reaction with N-iodosuccinimide and amides. Benzyl protected 2-iodoamides, when treated with sodium hydride and 15-crown-5, gave stable C1 N-linked 2-glycooxazolines as the major products. Silyl protected 2-iodoamides afforded the C1 O-linked 2-glycooxazolines; presumably by the rearrangement of unstable N-acylaziridine intermediates.     

Über eine Metrik im Siegelschen Halbraum

Ohne Zusammenfassung     

Bücherbesprechungen

Ohne Zusammenfassung     

On the continuation for variational inequalities depending on an eigenvalue parameter

In this paper we generalize recent theoretical results on the local continuation of parameter-dependent non-linear variational inequalities. The variational inequalities are rather general and describe, for example, the buckling of beams, plates or shells subject to obstacles. Under a technical hypothesis that is satisfied by the simply supported beam, we obtain the existence of a continuation of both the solution and the eigenvalue with respect to a local parameter. A numerical continuation method is presented that easily overcomes turning points. Numerical results are presented for the non-linear beam.     

On a compromise social choice correspondence

This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions are provided.     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.