Optimal inspection and perfect repair

Models are developed for decision making about monitoring andmaintenance of systems whose performance through time is describedby a general stochastic process. The system is monitored andpreventive and corrective maintenance actions are carried outin response to the observed system state. The decision processis simplified by using the maximum process as a decision variable.The models developed generalize age replacement models and othersimple maintenance strategies. The approach can deal with failuresthat prevent the system functioning further, and also failuresthat are defined by regulation or economic considerations. Attentionis restricted to perfect repair and inspection, but the structureprovides the framework for further developments.     

Recent developments in algebraic combinatorics

We survey three recent developments in algebraic combinatorics. The first is the theory of cluster algebras and the Laurent phenomenon of Sergey Fomin and Andrei Zelevinsky. The second is the construction of toric Schur functions and their application to computing three-point Gromov-Witten invariants, by Alexander Postnikov. The third development is the construction of intersection cohomology for nonrational fans by Paul Bressler and Valery Lunts and its application by Kalle Karu to the torich-vector of a nonrational polytope. We also briefly discuss the “half hard Lefschetz theorem” of Ed Swartz and its application to matroid complexes. Partially supported by NSF grant #DMS-9988459.     

The Linear Rational Pseudospectral Method with Preassigned Poles

We present a linear rational pseudospectral (collocation) method with preassigned poles for solving boundary value problems. It consists in attaching poles to the trial polynomial so as to make it a rational interpolant. Its convergence is proved by transforming the problem into an associated boundary value problem. Numerical examples demonstrate that the rational pseudospectral method is often more efficient than the polynomial method.     

The interlace polynomial of a graph

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable “interlace polynomial” for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and fuse reduction characterizing the Tutte polynomial.It emerges that the interlace graph polynomial may be viewed as a special case of the Martin polynomial of an isotropic system, which underlies its connections with the circuit partition polynomial and the Kauffman brackets of a link diagram. The graph polynomial, in addition to being perhaps more broadly accessible than the Martin polynomial for isotropic systems, also has a two-variable generalization that is unknown for the Martin polynomial. We consider extremal properties of the interlace polynomial, its values for various special graphs, and evaluations which relate to basic graph properties such as the component and independence numbers.     

Reagent concentration effects in the REM resin solid phase synthesis of tertiary amines

The use of reagent concentration has resulted in increased rates for all stages of the REM resin synthesis of tertiary amines. These increases in rate translate into faster reaction times, higher yields and lower reagent consumption. Of the methods examined, the most successful was the use of perfluorous solvents, either alone or with a small amount of organic co-solvent.     

Bundles, Handcuffs, and Local Freedom

We answer a question of J. Anderson's by producing infinitely many commensurability classes of fibered hyperbolic 3-manifolds whose fundamental groups contain subgroups that are locally free and not free. These manifolds are obtained by performing 0–surgery on a collection of knots with the same properties.     

Evaluation of Carboxen carbon molecular sieves for trapping replacement chlorofluorocarbons

A method has been developed for trapping and preconcentrating the very volatile replacement chlorofluorocarbons (hydrofluorocarbons and hydrochlorofluorocarbons) using microtraps filled with Carboxen, a carbon molecular sieve type material, without the need for extensive cryotrapping using liquid nitrogen. We present here the adsorption characteristics of four Carboxen materials, Carboxen 569, 1000, 1001, and 1002, used to trap a range of replacement chlorofluorocarbons varying in boiling point from −48.4 to −9.8°C. The application of these traps for the automated analysis of trace gases in atmospheric and environmental chemistry could prove extremely useful.     

Small Exotic Molecules with Bosonic Constituents

We study the stability and the properties of the ground state of neutral systems containing up to four positively charged bosons and their antiparticles. Examples are the di-pionium molecule (π ⁺ π ⁻)², which is almost identical to the positronium molecule (e ⁺ e ⁻)², the tri-pionium (π ⁺ π ⁻)³, and the quadri-pionium (π ⁺ π ⁻)⁴ molecules. We briefly compare our results on the energy to those on the large-N limit of (π ⁺ π ⁻) ^N . We also show that the annihilation probability can be calculated accurately with simple wave functions when one uses the generalized Schwinger rule. Received September 5, 1994; accepted for publication October 15, 1994