129Xe NMR study of the homogeneity and the size distribution of small sodium metal particles in NaY zeolite

NaY zeolite samples loaded with sodium metal by vapor phase deposition have been investigated using¹²⁹Xe NMR spectroscopy. At low sodium concentration, the¹²⁹Xe NMR spectrum showed three resonance lines which clearly indicate the existence of distinct domains in the zeolite sample. Such an observation suggests that the diffusion of the xenon atoms into each domain only occurs with respect to the NMR time scale (2.9 ms). As the sodium concentration increases, observation of a single broad line indicate a macroscopic homogenization of the system. The shift of this line is explained in part due to a paramagnetic interaction between the xenon atoms and the unpaired electrons of particles containing an odd number of sodium atoms. The linewidth is due to the distribution of the local magnetic fields partially averaged by the rapid motion of the xenon atoms and to the statistical distribution of the sodium particles in the supercage cavities. The paramagnetic interaction vanishes with the oxidation of the sample leading to a narrowing and a shift of the line to higher magnetic fields.     

Searching for losers

We investigate the following process: N people select b losers by flipping coins. The 0-party continues until there are less than b losers; then the 1-party has to find the other losers by the same process. The average time for this process is about long₂ N, but this result requires rather advanced methods. Furthermore, the average size of a binary tree associated to this process and the average number of coin flippings are computed. The method used in this article can be used to give asympotical solutions of a special type of bivariate recurrences. © 1993 John Wiley & Sons, Inc.     

Spectral boundary controllability of networks of strings

In this Note we give a necessary and sufficient condition for the spectral controllability from one simple node of a general network of strings that undergoes transversal vibrations in a sufficiently large time. This condition asserts that no eigenfunction vanishes identically on the string that contains the controlled node. The proof combines the Beurling–Malliavin's theorem and an asymptotic formula for the eigenvalues of the network. The optimal control time may be characterized as twice the sum of the lengths of all the strings of the network. To cite this article: R. Dáger, E. Zuazua, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 545–550.     

Optical absorption bistability in quasi-one-dimensional peierls semiconductors

The optical absorption coefficient γ of a thin film of a Peierls semiconductor has been calculated in the dipole approximation for direct interband transitions as a function of intensity I and central frequency ω₀ of a quasi-monochromatic frequency spectrum near the lower optical transition edge. It is shown that the γ(I, ω₀) dependence is strongly nonlinear, and within a certain region of I and ω₀ variation, not single-valued, which indicates the onset of resonator-free optical bistability with increasing absorption.     

Analogue Models of and for Gravity

Condensed matter systems, such as acoustics in flowing fluids, light in moving dielectrics, or quasiparticles in a moving superfluid, can be used to mimic aspects of general relativity. More precisely these systems (and others) provide experimentally accessible models of curved-space quantum field theory. As such they mimic kinematic aspects of general relativity, though typically they do not mimic the dynamics. Although these analogue models are thereby limited in their ability to duplicate all the effects of Einstein gravity they nevertheless are extremely important—they provide black hole analogues (some of which have already been seen experimentally) and lead to tests of basic principles of curved-space quantum field theory. Currently these tests are still in the realm of gedanken-experiments, but there are plausible candidate models that should lead to laboratory experiments in the not too distant future.     

On Kauffman invariants for 6-valent graphs

An explicit way for producing invariants for 6-valent graphs with rigid vertices within the framework of Kauffman's approach to graph invariants is presented. These invariants can be used to detect the chirality of a 6-valent graph with rigid vertices. A relevant example is considered. Bibliography: 19 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 223, 1995, pp. 251–262. Translated by A. M. Nikitin     

3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects

We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λ_s(n)log³n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λ_s(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λ_s(n)log²n). The query time in the first problem is O(log⁴n), the query time in the second and third problems is O(log³n + klog²n), and the query time in the fourth problem is O(log³n).

We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K₁, K₂ and K₁ lies vertically above K₂, then K₁ precedes K₂.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm.