Mechanistic Aspects of a Highly Active Dinuclear Zinc Catalyst for the Co‐polymerization of Epoxides and CO2

The dinuclear zinc complex reported by us is to date the most active zinc catalyst for the co‐polymerization of cyclohexene oxide (CHO) and carbon dioxide. However, co‐polymerization experiments with propylene oxide (PO) and CO₂ revealed surprisingly low conversions. Within this work, we focused on clarification of this behavior through experimental results and quantum chemical studies. The combination of both results indicated the formation of an energetically highly stable intermediate in the presence of propylene oxide and carbon dioxide. A similar species in the case of cyclohexene oxide/CO₂ co‐polymerization was not stable enough to deactivate the catalyst due to steric repulsion.     

Compactness and convergence rates in the combinatorial integral approximation decomposition

The combinatorial integral approximation decomposition splits the optimization of a discrete-valued control into two steps: solving a continuous relaxation of the discrete control problem, and computing a discrete-valued approximation of the relaxed control. Different algorithms exist for the second step to construct piecewise constant discrete-valued approximants that are defined on given decompositions of the domain. It is known that the resulting discrete controls can be constructed such that they converge to a relaxed control in the \(\hbox {weak}^*\) topology of \(L^\infty \) if the grid constant of this decomposition is driven to zero. We exploit this insight to formulate a general approximation result for optimization problems, which feature discrete and distributed optimization variables, and which are governed by a compact control-to-state operator. We analyze the topology induced by the grid refinements and prove convergence rates of the control vectors for two problem classes. We use a reconstruction problem from signal processing to demonstrate both the applicability of the method outside the scope of differential equations, the predominant case in the literature, and the effectiveness of the approach.

     

Nitrostyrene Derivatives of Adenosine 5′-Glutarates Modified with an Alkyl Spacer and their inhibitory activity on epidermal growth factor receptor protein tyrosine kinase

β-Nitrostyrene derivatives of adenosine 5′-glutarates are potent and selective bisubstrate-type inhibitors of the epidermal growth factor receptor protein tyrosine kinase (EGF-R PTK). In an attempt to improve the inhibitory activity, this type of compounds was modified with alkyl spacers of varying length between the nitrostyrene and the glutaryl units. The spacers consisted of 1, 3, 4, and 5 atoms to give compounds of the benzyl, oxyethyl, oxypropyl, and oxybutyl series, respectively (Schemes 1 and 2). Adenosine 5′-esters were prepared in the benzyl and oxypropyl series only. Compared to the compounds in the parent series without spacer (IC₅₀ = 0.7–12 μM ), most of the modified compounds inhibited the EGF-R PTK only marginally or were inactive (IC₅₀ ≥ 100 μM ). The only exceptions were the free acids 19 and 20 with IC₅₀ values of ca. 5 μM . It is noteworthy that esterification of these two hydrogen glutarates with either MeOH or adenosine yielded inactive compounds, which is in contrast to the corresponding substances without spacers.     

The Hahn–Banach Theorem for Partially Ordered Totally Convex, Positively Convex and Superconvex Modules

The Hahn–Banach Theorem for partially ordered totally convex modules [3] and a necessary and sufficient condition for the existence of an extension of a morphism from a submodule C ₀ of a partially ordered totally convex module C (with the ordered unit ball of the reals as codomain) to C, are proved. Moreover, the categories of partially ordered positively convex and superconvex modules are introduced and for both categories the Hahn–Banach Theorem is proved.     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.