Photorefractive properties of ruthenium-doped potassium niobate

Photoconductivities and photovoltaic currents of ruthenium-doped KNbO₃ are orders of magnitude larger than that of undoped and ion-doped crystals. KNbO₃:Ru is very sensitive for holographic recording with red light and the photovoltaic current increases sublinearly with light intensity.     

A matrix integral solution to [P,Q]=P and matrix laplace transforms

In this paper we solve the following problems: (i) find two differential operatorsP andQ satisfying [P, Q]=P, whereP flows according to the KP hierarchy P/t _n =[(P ^n/p )₊,P], withp:=ordP2; (ii) find a matrix a integral representation for the associated -function. First we construct an infinite dimensional spaceW= span{ ₀(z, ₁(z,...)} of functions ofz invariant under the action of two operators, multiplication byz ^p andA _c :=z/z–z+c. This requirement is satisfied, for arbitraryp, if ₀ is a certain function generalizing the classical Hänkel function (forp=2); our representation of the generalized Hänkel function as adouble Laplace transform of a simple function, which was unknown even for thep=2 case, enables us to represent the -function associated with the KP time evolution of the spaceW as a double matrix Laplace transform in two different ways. One representation involves an integration over the space of matrices whose spectrum belongs to a wedge-shaped contour ^-+ ^- defined by ^± = ₊e^±i/p. The new integrals above relate to matrix Laplace transforms, in contrast with matrix Fourier transforms, which generalize the Kontsevich integrals and solve the operator equation [P, Q]=1.The support of a National Science Foundation grant #DMS-95-4-51179 is gratefully acknowledged.The hospitality of the Volterra Center at Brandeis University is gratefully acknowledged.The hospitality of the University of Louvain and Brandeis University is gratefully acknowledged.The support of a National Science Foundation grant #DMS-95-4-51179, a Nato, an FNRS and a Francqui Foundation grant is gratefully acknowledged.     

Finding the αn-th largest element

We describe an algorithm for selecting the n-th largest element (where 0<<1), from a totally ordered set ofn elements, using at most (1+(1+o(1))H())·n comparisons whereH() is the binary entropy function and theo(1) stands for a function that tends to 0 as tends to 0. For small values of this is almost the best possible as there is a lower bound of about (1+H())·n comparisons. The algorithm obtained beats the global 3n upper bound of Schönhage, Paterson and Pippenger for <1/3.