Beyond Stereoselectivity,Switchable Catalysis: Some of the Last Frontier Challenges in Ring‐Opening Polymerization of Cyclic Esters

Metal‐based catalysts and initiators have played a pivotal role in the ring‐opening polymerization (ROP) of cyclic esters, thanks to their high activity and remarkable ability to control precisely the architectures of the resulting polyesters in terms of molar mass, dispersity, microstructure, or tacticity. Today, after two decades of extensive research, the field is slowly reaching maturity. However, several challenges remain, while original concepts have emerged around new types or new applications of catalysis. This Review is not intended to comprehensively cover all of these aspects. Rather, it provides a personal overview of the very recent progress achieved in some selected, important aspects of ROP catalysis—stereocontrol and switchable catalysis. Hence, the first part addresses the development of new metal‐based catalysts for the isoselective ROP of racemic lactide towards stereoblock copolymers, and the use of syndioselective ROP metal catalysts to control the monomer sequence in copolymers. A second part covers the development of ROP catalysts—primarily metal‐based catalysts, but also organocatalysts—that can be externally regulated by the use of chemical or photo stimuli to switch them between two states with different catalytic abilities. Current challenges and opportunities are highlighted.     

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].     

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.

     

The 4D Klein-Gordon, Dirac and Quantization Equations from 5D Null Paths

Results from 5D induced-matter and membrane theory with null paths are extended to show that a particle obeys the 4D Klein-Gordon equation but with a variable mass. The Dirac equation also follows, but raises concerns about 4D quantization in the two natural 5D gauges, and reopens the question of a Regge-like trajectory for the spin angular momenta and squared masses of gravitationally-dominated systems.