Ultraslow phonon-assisted collapse of tubular image states

We predict ultraslow collapse of “tubular image states” (TIS) on material surfaces. TIS are bound Rydberg-like electronic states formed at large distances (∼30 nm) from the surfaces of suspended circularly-symmetric nanowires, such as metallic C nanotubes. The states are formed in potential wells, resulting from a combination of the TIS-electron attraction to image charges in the nanotube and its centrifugal repulsion, caused by spinning around the tube. We demonstrate that TIS can collapse on the tube surface by passing their angular momentum l to circularly polarized flexural phonons excited in the tube. Our analysis shows that for highly detached TIS with l ? 6 the relaxation lifetimes are of the order of 10 ns-1 μs, while for l < 6 these lifetimes are reduced by several orders of magnitude.     

Butyltins in california river and lake marina waters

Butyltins were analyzed in waters from California river and lake marinas and were detected at the part per trillion (ppt) level in most locations. The tributyltin:dibutyltin (TBT/DBT) ratios in the fresh waters were similar to those in their saline counterparts indicating like rates of degradation in the two salinity regimes.     

Information recovery from black holes

We argue that if black hole entropy arises from a finite number of underlying quantum states, then any particular such state can be identified from infinity. The finite density of states implies a discrete energy spectrum, and, in general, such spectra are non-degenerate except as determined by symmetries. Therefore, knowledge of the precise energy, and of other commuting conserved charges, determines the quantum state. In a gravitating theory, all conserved charges including the energy are given by boundary terms that can be measured at infinity. Thus, within any theory of quantum gravity, no information can be lost in black holes with a finite number of states. However, identifying the state of a black hole from infinity requires measurements with Planck scale precision. Hence observers with insufficient resolution will experience information loss. First Award in the 2006 Essay Competition of the Gravity Research Foundation.     

Solving a class of multiplicative programming problems via c-programming

In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques.     

Melting of heterogeneous vortex matter: The vortex ‘nanoliquid’

Disorder and porosity are parameters that strongly influence the physical behavior of materials, including their mechanical, electrical, magnetic and optical properties. Vortices in superconductors can provide important insight into the effects of disorder because their size is comparable to characteristic sizes of nanofabricated structures. Here we present experimental evidence for a novel form of vortex matter that consists of inter-connected nanodroplets of vortex liquid caged in the pores of a solid vortex structure, like a liquid permeated into a nanoporous solid skeleton. Our nanoporous skeleton is formed by vortices pinned by correlated disorder created by high-energy heavy ion irradiation. By sweeping the applied magnetic field, the number of vortices in the nanodroplets is varied continuously from a few to several hundred. Upon cooling, the caged nanodroplets freeze into ordered nanocrystals through either a first-order or a continuous transition, whereas at high temperatures a uniform liquid phase is formed upon delocalization-induced melting of the solid skeleton. This new vortex nanoliquid displays unique properties and symmetries that are distinct from both solid and liquid phases.     

Stable Subnorms II

In this paper we continue our study of stability properties of subnorms on subsets of finite-dimensional, power-associative algebras over the real or the complex numbers.     

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n ² m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467.