High harmonic generation of soft X-rays by carbon nanotubes

We extend the method for the formulation of selection rules for high harmonic generation spectra [Phys. Rev. Lett. 80, 3743 (1998)] beyond the dipole approximation and apply it to single-walled carbon nanotubes interacting with a circularly polarized laser field. Our results show that the carbon nanotubes can be excellent systems for a selective generation of high harmonics, up to the soft x-ray regime.     

Unified view on multiconfigurational time propagation for systems consisting of identical particles

We show that the successful and formally exact multiconfigurational time-dependent Hartree method (MCTDH) takes on a unified and compact form when specified for systems of identical particles (MCTDHF for fermions MCTDHB for bosons). In particular the equations of motion for the orbitals depend explicitly and solely on the reduced one- and two-body density matrices of the system's many-particle wave function. We point out that this appealing representation of the equations of motion opens up further possibilities for approximate propagation schemes.     

Embedding nearly-spanning bounded degree trees

We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − ε)n vertices, in terms of the expansion properties of G. As a result we show that for fixed d ≥ 2 and 0 < ε < 1, there exists a constant c = c(d, ε) such that a random graph G(n, c/n) contains almost surely a copy of every tree T on (1 − ε)n vertices with maximum degree at most d. We also prove that if an (n, D, λ)-graph G (i.e., a D-regular graph on n vertices all of whose eigenvalues, except the first one, are at most λ in their absolute values) has large enough spectral gap D/λ as a function of d and ε, then G has a copy of every tree T as above. Research supported in part by a USA-Israeli BSF grant, by NSF grant CCR-0324906, by a Wolfensohn fund and by the State of New Jersey. Research supported in part by USA-Israel BSF Grant 2002-133, and by grants 64/01 and 526/05 from the Israel Science Foundation. Research supported in part by NSF CAREER award DMS-0546523, NSF grant DMS-0355497, USA-Israeli BSF grant, and by an Alfred P. Sloan fellowship.     

Stopping paramagnetic supersonic beams: the advantage of a co-moving magnetic trap decelerator

The long standing goal of chemical physics is finding a convenient method to create slow and cold beams intense enough to observe chemical reactions in the temperature range of a few Kelvin. We present an extensive numerical analysis of our moving magnetic trap decelerator showing that a 3D confinement throughout the deceleration process enables deceleration of almost all paramagnetic particles within the original supersonic expansion to stopping velocities. We show that the phase space region containing the decelerating species is larger by two orders of magnitude as compared to other available deceleration methods.     

Diffraction from a moving grating

A first-principles tutorial account is given for the diffraction of either light or free, non-relativistic, massive particles from a moving grating. Discussion on the properties of the moving grating including non-reciprocity is followed by considering both Raman-Nath (thin grating) diffraction and Bragg (thick grating) diffraction in either transmission or reflection geometry. Use of four-momentum conservation with dispersion relations yield the angles of diffraction. The increase in the angle of diffraction for grazing incident by using a moving grating relative to using a static grating is calculated. It is shown that this increase is possible only for Raman-Nath geometry.     

Sulfur isotope fractionation during incorporation of sulfur nucleophiles into organic compounds

(34)S enrichment is shown to occur during sulfurization reactions and for the first time conclusively attributed to an isotope equilibrium effect rather than selective addition of (34)S enriched nucleophiles.     

The maximum edit distance from hereditary graph properties

For a graph property , the edit distance of a graph G from , denoted , is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying . What is the largest possible edit distance of a graph on n vertices from ? Denote this distance by .A graph property is hereditary if it is closed under removal of vertices. In a previous work, the authors show that for any hereditary property, a random graph essentially achieves the maximal distance from , proving: with high probability. The proof implicitly asserts the existence of such , but it does not supply a general tool for determining its value or the edit distance.In this paper, we determine the values of and for some subfamilies of hereditary properties including sparse hereditary properties, complement invariant properties, (r,s)-colorability and more. We provide methods for analyzing the maximum edit distance from the graph properties of being induced H-free for some graphs H, and use it to show that in some natural cases G(n,1/2) is not the furthest graph. Throughout the paper, the various tools let us deduce the asymptotic maximum edit distance from some well studied hereditary graph properties, such as being Perfect, Chordal, Interval, Permutation, Claw-Free, Cograph and more. We also determine the edit distance of G(n,1/2) from any hereditary property, and investigate the behavior of as a function of p.The proofs combine several tools in Extremal Graph Theory, including strengthened versions of the Szemerédi Regularity Lemma, Ramsey Theory and properties of random graphs.     

Process-Dependent Solute Transport in Porous Media

Transport in Porous Media - Solute transport under single-phase flow conditions in porous micromodels was studied using high-resolution optical imaging. Experiments examined loading (injection of...