Correction to: Involutions of Type G2 over a Field of Characteristic Two

Algebras and Representation Theory - We would like to correct two errors in our paper Involutions of type G2 over a field of characteristic 2 [2].     

Bounds for rectilinear crossing numbers

A rectilinear drawing of a graph is one where each edge is drawn as a straight-line segment, and the rectilinear crossing number of a graph is the minimum number of crossings over all rectilinear drawings. We describe, for every integer k ≥ 4, a class of graphs of crossing number k, but unbounded rectilinear crossing number. This is best possible since the rectilinear crossing number is equal to the crossing number whenever the latter is at most 3. Further, if we consider drawings where each edge is drawn as a polygonal line segment with at most one break point, then the resulting crossing number is at most quadratic in the regular crossing number. © 1993 John Wiley & Sons, Inc.     

Mixing and sweeping out

A weakly mixing transformationT and a sequence (d _n) are constructed such thatT is uniformly mixing on (d _n),T is uniformly sweeping out on ([αd _n]) for allα∈(0, 1), and for all rationalα∈(0, 1)T is not mixing on ([αd _n]).     

Degradative chain transfer in vinyl acetate polymerizations using toluene as solvent

In this work, we propose that retardation in vinyl acetate polymerization rate in the presence of toluene is due to degradative chain transfer. The transfer constant to toluene (C_trs) determined using the Mayo method is equal to 3.8 × 10^?3, which is remarkably similar to the value calculated from the rate data, assuming degradative chain transfer (2.7 × 10^?3). Simulations, including chain‐length‐dependent termination, were carried out to compare our degradative chain transfer model with experimental results. The conversion–time profiles showed excellent agreement between experiment and simulation. Good agreement was found for the M_n data as a function of conversion. The experimental and simulation data strongly support the postulate that degradative chain transfer is the dominant kinetic mechanism. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 3620–3625, 2007     

The Ulam number of infinite graphs

The following is a conjecture of Ulam: In any partition of the integer lattice on the plane into uniformly bounded sets, there exists a set that is adjacent to at least six other sets. Two sets are adjacent if each contain a vertex of the same unit square. This problem is generalized as follows. Given any uniformly bounded partitionP of the vertex set of an infinite graphG with finite maximum degree, letP (G) denote the graph obtained by letting each set of the partition be a vertex ofP (G) where two vertices ofP (G) are adjacent if and only if the corresponding sets have an edge between them. The Ulam number ofG is defined as the minimum of the maximum degree ofP (G) where the minimum is taken over all uniformly bounded partitionsP. We have characterized the graphs with Ulam number 0, 1, and 2. Restricting the partitions of the vertex set to connected subsets, we obtain the connected Ulam number ofG. We have evaluated the connected Ulam numbers for several infinite graphs. For instance we have shown that the connected Ulam number is 4 ifG is an infinite grid graph. We have settled the Ulam conjecture for the connected case by proving that the connected Ulam number is 6 for an infinite triangular grid graph. The general Ulam conjecture is equivalent to proving that the Ulam number of the infinite triangular grid graph equals 6. We also describe some interesting geometric consequences of the Ulam number, mainly concerning good drawings of infinite graphs.     

Serial magnetic resonance imaging in patients following acute myocardial infarction.

The detection of serial changes in magnetic resonance (MR) signal intensity of the heart following acute myocardial infarction may provide a useful method of characterizing tissue healing. Fourteen patients with acute Q-wave infarction underwent T2-weighted, spin-echo cardiac imaging during hospitalization, followed by one or more additional MR studies (total 31) over a 6- to 27-wk period (mean: 3 mo). Visual assessment of the images demonstrated a gradual reduction in signal intensity and localization of the bright signal to the subendocardium of the infarction region over the three-mo study period. A quantitative measurement of signal intensity (infarction/normal myocardium) fell from 1.81 +/- 0.42 on the initial study to 1.34 +/- 0.37 (p less than 0.05) at a mean of 14 wk. Two patients had an increase in signal intensity on the follow-up study and both patients had been readmitted with acute coronary syndromes. In summary, characterization of changes in signal intensity may provide a useful method of assessing myocardial healing following acute myocardial infarction. Further studies are indicated to determine the prognostic significance of these parameters.     

Novel antibiotics: second generation macrocyclic peptides designed to trap Holliday junctions

Described are the syntheses of 15 macrocyclic peptides designed to trap Holliday junctions (HJs) in bacteria during site-specific and homologous recombination. This leads to inhibiting bacterial growth. These second generation macrocycles were based on the C-2 symmetrical HJ. They were synthesized using a strategy that permits elucidation of the amino acid role in binding HJs. The syntheses of these macrocycles are an important step in the development of a new class of antibiotics.     

Free radical-mediated vinyl amination: a mild, general pyrrolidinyl enamine synthesis

The complete scope of free radical-mediated vinyl amination is described, using 5-exo-trig cyclizations of vinyl radicals to the nitrogen of azomethines. The focus is primarily on N,N-dialkyl enamines since their nucleophilicity renders them the most challenging enamines to synthesize using redox conditions. These studies establish several encouraging precedents for the broader application of this strategy.