On the topology of black holes

We establish from local hypotheses some results concerning the final state topology of black holes. We show that the surface of a black hole must have 2-sphere topology and that the topology of space in its vicinity is simple.Dedicated to Ted FrankelThis work has been partially supported by NSF grants DMS-8802877 and DMS-9006678     

A comparative analysis of the total syntheses of the amphidinolide T natural products

In this article we compare and contrast the strategies and tactics used in the syntheses of the amphidinolide T family of natural products that have been reported by Fürstner, Ghosh and ourselves. Similar approaches to the trisubstituted THF ring present in the targets are utilized in all of the syntheses, but each strategy showcases a different means of macrocyclization.     

Structure of slope-critical configurations

In 1970, P. R. Scott conjectured, and recently P. Ungar proved, that n noncollinear points in the plane determine at least n–1 directions. The goal here is to obtain information on the structure of the critical sets where the minimum of n–1 is attained. Such a set is distributed in a rather regular way onto spokes radiating out from a centrex point. If the number of spoke-pairs is even, the set must be centrally symmetric. Moreover, some bounds on the number of points per spoke are obtained. These results lead to the characterization, for small n, of certain types of slope-critical configurations.Dedicated to M. S. Irani on his 90th birthday 25 February, 1984Research supported in part by NSF EPSCoR Grant IPS-80-11451.     

Graphs with only caterpillars as spanning trees

A connected graph G is caterpillar-pure if each spanning tree of G is a caterpillar. The caterpillar-pure graphs are fully characterized. Loosely speaking they are strings or necklaces of so-called pearls, except for a number of small exceptional cases. An upper bound for the number of edges in terms of the order is given for caterpillar-pure graphs, and those which attain the upper bound are characterized.     

Temperature dependence of luminescence lifetimes in quartz under pulsed blue light stimulation

Abstract

The effect of increased thermal exposure on lifetimes during optical stimulation of luminescence was investigated in quartz over the temperature range 20—200°C. It is shown using a series of constant and dynamic temperature experimental data that lifetimes are strongly affected by temperature. Lifetimes change from about 30 μs at 20°C to about 7 μs at 200°C.     

Weighted composition operators on Hilbert spaces of vector-valued functions

In this paper we investigate criterion for the hyponormality, cohyponormality, and normality of weighted composition operators acting on Hilbert spaces of vector-valued functions.

     

The spanning trees forced by the path and the star

A set S of trees of order n forces a tree T if every graph having each tree in S as a spanning tree must also have T as a spanning tree. A spanning tree forcing set for order n that forces every tree of order n. A spanning-tree forcing set S is a test set for panarboreal graphs, since a graph of order n is panarboreal if and only if it has all of the trees in S as spanning trees. For each positive integer n ≠ 1, the star belongs to every spanning tree forcing set for order n. The main results of this paper are a proof that the path belongs to every spanning-tree forcing set for each order n ∉ {1, 6, 7, 8} and a computationally tractable characterization of the trees of order n ≥ 15 forced by the path and the star. Corollaries of those results include a construction of many trees that do not belong to any minimal spanning tree forcing set for orders n ≥ 15 and a proof that the following related decision problem is NP-complete: an instance is a pair (G, T) consisting of a graph G of order n and maximum degree n - 1 with a hamiltonian path, and a tree T of order n; the problem is to determine whether T is a spanning tree of G. © 1996 John Wiley & Sons, Inc.