Fiberings with Fiber RP（κ）

Let κ be non-negative integer. The unoriented bordism classes, which can be represented as [RP（ξ^κ）] where ξ^κ is a k-plane bundle, form an ideal of the unoriented bordism ring MO.. A group of generators of this ideal expressed by a base of MO. and a necessary and sufficient condition for a bordism class to belong to this ideal are given.     

Representations of Positive Projections II

In this paper we obtain a number of Maharam-type slice integral representations, with respect to scalar measures, for positive projections in Dedekind complete vector lattices and f-algebras. AMS Classification: 47B65, 46A40, 06F25     

Propriétés statistiques des entiers friables

Let Ψ(x,y) (resp. Ψ_m(x,y)) denote the number of integers not exceeding x that are y-friable, i.e. have no prime factor exceeding y (resp. and are coprime to m). Evaluating the ratio Ψ_m(x/d,y)/Ψ(x,y) for 1≤slantd≤slantx, m≥slant 1, x≥slant y≥slant 2, turns out to be a crucial step for estimating arithmetic sums over friable integers. Here, it is crucial to obtain formulae with a very wide range of validity. In this paper, several uniform estimates are provided for the aforementioned ratio, which supersede all previously known results. Applications are given to averages of various arithmetic functions over friable integers which in turn improve corresponding results from the literature. The technique employed rests mainly on the saddle-point method, which is an efficient and specific tool for the required design.2000 Mathematics Subject Classification: Primary—11N25; Secondary—11K65, 11N37     

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.     

Combined supercritical-fluid chromatography/mass spectrometry in the analysis of diuron in plasma using on-line phase-system switching

On-line sample pretreatment by means of the phase-system switching approach is an interesting technique for the analysis of aqueous samples, e.g., plasma, by means of supercritical-fluid chromatography. In order to analyse plasma samples the following analytical procedure is used. The plasma sample is injected on to a short precolumn, which is washed with water and subsequently dried with nitrogen. Next, the solutes are desorbed with the supercritical mobile phase, analysed with packed-column supercritical-fluid chromatography and detected with either a UV detector or a mass spectrometer, equipped with a moving-belt interface. The herbicide diuron is selected as a test compound to study the feasibility of this approach. Using a selective detector the procedure is sufficiently sensitive to detect diuron in plasma, but not appropriate to detect the diuron metabolites in a post-mortem plasma sample. These have been identified with liquid chromatography/mass spectrometry. The detection limit of diuron in plasma using the procedure described is about 30 ng/mL.     

Local Minimizers of the Ginzburg-Landau Energy with Magnetic Field in Three Dimensions

We establish the existence of locally minimizing vortex solutions to the full Ginzburg-Landau energy in three dimensional simply-connected domains with or without the presence of an applied magnetic field. The approach is based upon the theory of weak Jacobians and applies to nonconvex sample geometries for which there exists a configuration of locally shortest line segments with endpoints on the boundary.Research partially supported by NSERC grant number 261955     

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.