Baker＇s Yeast Mediated Reduction of Optically Active Diketone

Baker‘s yeast mediated reduction of optically active diketone is described. The two keto groups are efficiently differentiated and the ee value of the recovered material is considerably raised. It affords highly optically active key intermediates efficiently for the synthesis of natural polyhydroxylated agarofuran products.     

Synthesis of Novel Monomeric Dyes with Anthraquinone Residue

Two novel polymerizable dyes with anthraquinone residue have been prepared, and their structures were characterized by FTIR, ^1HNMR and EA.     

The First and Facile Synthesis of (±) Syringaresinol

The first and facile synthesis of (±)syringaresinol was described.     

Synthesis of paramagnetic BODIPY dyes as new double (spin and fluorescence) sensors

Paramagnetic pyrroline and 1,2,3,6-tetrahydropyridine derivatives of BODIPY and their diamagnetic analogs have been synthesized and characterized as novel redox double sensor and cation sensitive reagents.     

Boundedness of Multilinear Operators on Herz Type Spaces： Extreme Cases

In this paper, two classes of closely related multilinear singular and fractional integrals,which include the commutators as special cases, are studied and their boundedness on Herz type spaces is discussed. In fact, it is proved that these operators are actually not bounded in certain extreme cases.     

Analytic Feynman integrals of transforms of variation of cylinder type functions over Wiener paths in abstract Wiener space

In this paper, we evaluate various analytic Feynman integrals of first variation, conditional first variation, Fourier-Feynman transform and conditional Fourier-Feynman transform of cylinder type functions defined over Wiener paths in abstract Wiener space. We also derive the analytic Feynman integral of the conditional Fourier-Feynman transform for the product of the cylinder type functions which define the functions in a Banach algebra introduced by Yoo, with n linear factors.     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.