Structural verification of a tetrahydrotetrazole compound

Tetrahydrotetrazoles are five‐membered‐ring heterocycles containing four contiguous saturated nitrogen atoms. Very few examples of such compounds have been reported in the literature. Our previous attempt at the synthesis of a member of this class of compound suggested that the N—N bonds may be more labile than expected. This finding raised the question as to whether the structures of any of the previously reported tetrahydrotetrazoles had been properly assigned. We have reproduced the synthesis of a reported tetrahydrotetrazole, namely 1,2‐di‐tert‐butyl 3‐phenyl‐1H,2H,3H,10bH‐[1,2,3,4]tetrazolo[5,1‐a]isoquinoline‐1,2‐dicarboxylate, C₂₅H₃₀N₄O₄, and have now confidently confirmed its structure via X‐ray crystallography. However, while sufficiently stable in the crystal phase, we discovered that it remains very labile in solution (having a half‐life of only 15 min at 20 °C in CDCl₃). A tentative reaction pathway for its dissociation based on ¹H NMR spectral evidence is provided.     

Synthesis of β -Cyperone via Fungal Hydroxylation of thujone-derived tricyclic cyclopropanes

Synthesis of optically active sesquiterpenes with a eudesmane C-skeleton from the chiral starting material thujone involves transformation of a tricyclic intermediate (1R,2R,4S)-1,7-dimethyl-4-(1-methylethyl)tricyclo[4.4.0.0^2,4]dec-6-en-8-one ( 2 ) into the bicyclic compound β -cyperone ( 5 ). Hydroxylation of 2 at C(5) or C(11) permits subsequent opening of the cyclopropane ring and rearrangement to β -cyperone. In this publication, studies involving hydroxylation of 2 by fungal cultures are presented. The resultant products are useful intermediates in efficient synthesis of eudesmane sesquiterpenes. Of five fungi tested, Rhizopus oryzae ATCC 11145 proved most versatile. It hydroxylates at the exocyclic C(11) position in high yield (70%) and, to a lesser extent, at C(5) (5%). Enzymatic activity appears at the end of growth phase and at least 2.2 g of 2 per liter can be metabolized without significant loss of product yield. A second fungus, Cunninghamella echinulata ATCC 9244, proved most useful for hydroxylation of derivatives of 2 for the preparation of derivatives of β -cyperone, although product yields were low (2–20%), some derivatives were nonreactive, and hydroxylation at C(9) occurred. The relationship between precursor structure and enzyme affinity is discussed.     

Characterization of low molecular weight hydrocarbon oligomers by laser desorption/ionization time-of-flight mass spectrometry using a solvent-free sample preparation method.

A new solvent-free sample preparation method using silver trifluoroacetate (AgTFA) was developed for the analysis of low molecular weight paraffins and microcrystalline waxes by laser desorption/ionization time-of-flight mass spectrometry (LDI-TOFMS). Experiments show that spectral quality can be enhanced by dispersing AgTFA directly in liquid paraffins without the use of additional solvents. This preparation mixture is applied directly to the MALDI probe. Solid waxes could be examined by melting prior to analysis. The method also provides sufficiently reproducible spectra that peak area ratios between mono- and bicyclic alkane peaks indicated variations in the cycloalkane content of paraffin samples. Dehydrogenation of hydrocarbons observed during the desorption/ionization process was studied by analysis of alkane standards.     

Design of neutral, mono- or di-cationic water-soluble trihydrazidophosphoradamantanes

The versatile behavior of a trihydrazidophosphoradamantane allowing the synthesis of a variety of neutral, mono- or di-cationic water-soluble molecules of potential interest for biphasic catalysis is reported.     

On the geometry of infinite cyclic subgroups

In this paper we construct an example of a word metric on an infinite cyclic subgroup. This example shows that subexponential distortion does not obstruct non-trivial growth of connected radii. This answers a question of Gromov [6]. The constructed metric has other pathological properies. Specifically, its asymptotic cone depends on the choice of ultrafilter and scaling sequence. The work has been partially supported by the Swiss National Science Foundation.     

IFS attractors and Cantor sets

We build a metric space which is homeomorphic to a Cantor set but cannot be realized as the attractor of an iterated function system. We give also an example of a Cantor set K in R³ such that every homeomorphism f of R³ which preserves K coincides with the identity on K.     

Products of mixed covering arrays of strength two

A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006     

Integral Inequalities and Global Solutions of Semilinear Evolution Equations

A criterion for the nonexplosion of solutions to semilinear evolution equations on Banach spaces is proved. The result is obtained by applying a modification of the Bihari type inequality to the case of a weakly singular nonlinear integral inequality.     

Truncated Newton method for sparse unconstrained optimization using automatic differentiation

When solving large complex optimization problems, the user is faced with three major problems. These are (i) the cost in human time in obtaining accurate expressions for the derivatives involved; (ii) the need to store second derivative information; and (iii), of lessening importance, the time taken to solve the problem on the computer. For many problems, a significant part of the latter can be attributed to solving Newton-like equations. In the algorithm described, the equations are solved using a conjugate direction method that only needs the Hessian at the current point when it is multiplied by a trial vector. In this paper, we present a method that finds this product using automatic differentiation while only requiring vector storage. The method takes advantage of any sparsity in the Hessian matrix and computes exact derivatives. It avoids the complexity of symbolic differentiation, the inaccuracy of numerical differentiation, the labor of finding analytic derivatives, and the need for matrix store. When far from a minimum, an accurate solution to the Newton equations is not justified, so an approximate solution is obtained by using a version of Dembo and Steihaug's truncated Newton algorithm (Ref. 1).This paper was presented at the SIAM National Meeting, Boston, Massachusetts, 1986.