A Novel Biaryl Derivative from Hydrangea chinensis

Chemistry of Natural Compounds - A novel bibenzyl derivative, hydrangchinenin (1), was isolated from the stems of Hydrangea chinensis Maxim. (Hydrangeaceae). Its structure was determined on the...     

Uniform partition extensions,a generating functions perspective

In this paper, a bivariate generating function CF(x, y) =f(x)-yf(xy)1-yis investigated, where f(x)= n 0fnxnis a generating function satisfying the functional equation f(x) = 1 + r j=1 m i=j-1aij xif(x)j.In particular, we study lattice paths in which their end points are on the line y = 1. Rooted lattice paths are defined. It is proved that the function CF(x, y) is a generating function defined on some rooted lattice paths with end point on y = 1. So, by a simple and unified method, from the view of lattice paths, we obtain two combinatorial interpretations of this bivariate function and derive two uniform partitions on these rooted lattice paths.     

Diastereoselective Alkylation of (Diene-Aldehyde)Fe(CO)3 Complexes with Functionalized Zinc-Copper Reagents NuCu(CN)Znl

Addition of functionalized zinc-copper reagents to the title complexes proceeds in a highly diastereoselective fashion to afford dienol complexes. The relative configurations of adducts 3d were determined by single X-ray diffraction analysis.     

The Combinatorics of Laguerre,Charlier, and Hermite Polynomials

This paper describes several combinatorial models for Laguerre, Charlier, and Hermite polynomials, and uses them to prove combinatorially some classical formulas. The so-called “Italian limit formula” (from Laguerre to Hermite), the Appel identity for Hermite polynomials, and the two Sheffer identities for Laguerre and Charlier polynomials are proved. We also give bijective proofs of the three-term recurrences. These three families form the bottom triangle in R. Askey's chart classifying hypergeometric orthogonal polynomials.     

Oracle Inequalities for Efromovich–Pinsker Blockwise Estimates

Oracle inequality is a relatively new statistical tool for the analysis of nonparametric adaptive estimates. Oracle is a good pseudo-estimate that is based on both data and an underlying estimated curve. An oracle inequality shows how well an adaptive estimator mimics the oracle for a particular underlying curve. The most advanced oracle inequalities have been recently obtained by Cavalier and Tsybakov (2001) for Stein type blockwise estimates used in filtering a signal from a stationary white Gaussian process. The authors also conjecture that a similar result can be obtained for Efromovich–Pinsker (EP) type blockwise estimators where their approach, based on Stein's formula for risk calculation, does not work. This article proves the conjecture and extends it upon more general models which include not stationary and dependent processes. Other possible extensions, a discussion of practical implications and a numerical study are also presented.     

Efficient synthesis of an aldehyde‐capped polythiophene containing fluorinated electron‐withdrawing groups

To incorporate an acceptor type polythiophene segment onto a supramolecular block copolymer for potential light harvesting applications, effective synthetic routes for the end‐functionalized and acceptor‐substituted polythiophenes are critical. The Ullmann coupling reaction can be utilized to obtain electron‐deficient polythiophenes and to attach terminal thiophene units that carry functional groups. In this article, the reactions involving a 2,5‐dibromothiophene monomer containing an electron‐withdrawing fluorinated ester and 5‐bromo‐2‐thiophenecarboxaldehyde (the end‐capper) were studied in detail. It was found that the Ullmann coupling reaction of the dibromide is very fast (completed in a few minutes) and the terminal bromine group does not survive long under the reaction condition. These findings lead to the development of an effective procedure for aldehyde end‐capping of electron‐deficient polythiophenes. Polymers with molecular weights around 4000 Da are routinely obtained. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 41–47, 2007     

Square-free-preserving and primitive-preserving homomorphisms

The aim of this paper is to investigate homomorphisms which reserve square-free languages or primitive languages. A characterization of square-free-preserving homomorphisms is presented. We show that every square-free-preserving homomorphism is primitive-preserving. Strongly cube-free-preserving homomorphisms are also studied.     

Large Scale Linear Programs and Heuristics for the Design of Survivable Telecommunication Networks

We consider the problem of providing a minimum cost multi-service network subject to one link failure scenarios. We assume our network is fully meshed and demand is satisfied by using direct or two hop-paths. We provide a large scale linear programming formulation and propose and test two effective heuristics.