Single electron tunneling rates in multijunction circuits

The rate of electron tunneling through normal metal tunnel junctions is calculated for the case of ultrasmall junction capacitances. The so-called Coulomb blockade of electron tunneling at low temperatures is shown to be strongly affected by the external electrical circuit. Under the common experimental condition of a low impedance environment the Coulomb blockade is suppressed for single tunnel junctions. However, a Coulomb gap structure emerges for junctions embedded in a high impedance environment. For a double junction setup a Coulomb blockade of tunneling arises even for low impedance environments due to the charge quantization on the metallic island between the junctions. An approach using circuit analysis is presented which allows to reduce the calculation of tunneling rates in multijunction circuits to those of a single junction in series with an effective capacitance. The range of validity of the socalled local rule and global rule rates is clarified. It is found that the tunneling rate tends towards the global rule rate as the number of junctions is increased. Some specific results are given for a one-dimensional array of tunnel junctions.     

Groupes vectoriels et schéma de Picard

This Note contains slight variations on a well known theme: linear sub-groups of the Picard functor of a proper scheme over a field k. In particular, we give exemples of a field k, with positive characteristic, and a projective k-scheme X, normal, but not geometrically reduced, such that the neutral component of its Picard functor is representable by a nonzero vectorial group scheme. To cite this article: M. Raynaud, C. R. Acad. Sci. Paris, Ser. I 338 (2004).     

On the performance of peeling algorithms

The peeling of a d-dimensional set of points is usually performed with successive calls to a convex hull algorithm; the optimal worst-case convex hull algorithm, known to have an O(n^˙ Log (n)) execution time, may give an O(n^˙n^˙ Log (n)) to peel all the set; an O(n^˙n) convex hull algorithm, m being the number of extremal points, is shown to peel every set with an O(n-n) time, and proved to be optimal; an implementation of this algorithm is given for planar sets and spatial sets, but the latter give only an approximate O(n^˙n) performance.     

Synthesis,properties, and crystal structure of a novel 3-hydroxy-(4<Emphasis Type="Italic">H</Emphasis>)-benzopyran-4-one containing copper(II) complex,and its oxygenation and relevance to quercetinase

The preparation, spectroscopic properties, and crystal structure of [Cu(ind)(mco)] [ind is the anion of 1,3-bis(2-pyridylimino)isoindoline and mco is the anion of 3-hydroxy-(4H)-benzopyran-4-one] are reported. The complex exhibits a distorted square pyramidal geometry. The oxygenation of the title compound results in oxidative cleavage of the heterocyclic ring to give the (acetylsalicylato)copper(II) complex [Cu(asp)(ind)] (asp is the anion of acetylsalicylic acid) and CO as primary products, which reaction resembles the enzymatic reaction of quercetinase.     

Contractivity and Analyticity in l p of Some Approximation of the Heat Equation

We consider the lumped mass method with piecewise linear finite elements in two dimensions. When the triangulation is of Delaunay type it is known that the discrete scheme satisfies a maximum principle. In this work we pursue the analysis and prove that the discrete semi-group is l ^p contractive in a sector, which implies smoothing effects and provide some resolvent estimates.     

New Results on the Queens_n 2 Graph Coloring Problem

For the Queens_n ² graph coloring problems no chromatic numbers are available for n > 9 except where n is not a multiple of 2 or 3. In this paper we propose an exact algorithm that takes advantage of the particular structure of these graphs. The algorithm works on the independent sets of the graph rather than on the vertices to be colored. It combines branch and bound, for independent set assignment, with a clique based filtering procedure. A first experimentation of this approach provided the coloring number values ranging for n = 10 to n = 14.     

Error Bounds and Implicit Multifunction Theorem in Smooth Banach Spaces and Applications to Optimization

In this paper we provide an error bound estimate and an implicit multifunction theorem in terms of smooth subdifferentials and abstract subdifferentials. Then, we derive a subdifferential calculus and Fritz–John type necessary optimality conditions for constrained minimization problems.     

On the asymptotic behaviour of elliptic problems with periodic data

We study the asymptotic behaviour of the solution of elliptic problems with periodic data when the size of the domain on which the problem is set becomes unbounded. To cite this article: M. Chipot, Y. Xie, C. R. Acad. Sci. Paris, Ser. I 339 (2004).