Nickel/Photoredox-Catalyzed Asymmetric Reductive Cross-Coupling of Racemic α-Chloro Esters with Aryl Iodides

A unique nickel/organic photoredox co-catalyzed asymmetric reductive cross-coupling between α-chloro esters and aryl iodides is developed. This cross-electrophile coupling reaction employs an organic reductant (Hantzsch ester), whereas most reductive cross-coupling reactions use stoichiometric metals. A diverse array of valuable α-aryl esters is formed under these conditions with high enantioselectivities (up to 94 %) and good yields (up to 88 %). α-Aryl esters represent an important family of nonsteroidal anti-inflammatory drugs. This novel synergistic strategy expands the scope of Ni-catalyzed reductive asymmetric cross-coupling reactions.     

Conformal Mappings of Riemannian Spaces onto Ricci Symmetric Spaces

Mathematical Notes -     

A Noninvasive, on Wafer Method to Determine the Intrinsic Stress of a Polymer Layer

The method described in this paper allows an investigator to determine the intrinsic stress of a polymer layer in a way that does not result in damage to devices or test structures. The method requires that a small area of the polymer be released from the substrate to form a diaphragm. The diaphragm is stimulated with acoustic white noise and the diaphragm movement is monitored with a laser vibrometer. The first few resonance frequencies of the diaphragm are obtained using a laser vibrometer and then those frequencies are used to calculate the membrane intrinsic bi-axial tension.     

Cyclic permutations and evolutionary trees

Given a tree with leaf set X, there are certain ways of arranging the elements of X in a circular order so that can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X.     

Counting unrooted maps on the plane

A planar map is a 2-cell embedding of a connected planar graph, loops and parallel edges allowed, on the sphere. A plane map is a planar map with a distinguished outside (“infinite”) face. An unrooted map is an equivalence class of maps under orientation-preserving homeomorphism, and a rooted map is a map with a distinguished oriented edge. Previously we obtained formulae for the number of unrooted planar n-edge maps of various classes, including all maps, non-separable maps, eulerian maps and loopless maps. In this article, using the same technique we obtain closed formulae for counting unrooted plane maps of all these classes and their duals. The corresponding formulae for rooted maps are known to be all sum-free; the formulae that we obtain for unrooted maps contain only a sum over the divisors of n. We count also unrooted two-vertex plane maps.     

Peeling phylogenetic ‘oranges’

We investigate the combinatorics of a topological space that is generated by the set of edge-weighted finite trees. This space arises by multiplying the weights of edges on paths in trees and is closely connected to tree reconstruction problems involving finite state Markov processes. We show that this space is a contractible finite CW-complex whose face poset can be described via a partial order on semilabelled forests. We then describe some combinatorial properties of this poset, showing that, for example, it is pure, thin and contractible.     

On the Curvature of the Central Path of Linear Programming Theory

We prove a linear bound on the average total curvature of the central path of linear programming theory in terms of the number of independent variables of the primal problem, and independent of the number of constraints.