Photoisomerisation in Aminoazobenzene‐Substituted Ruthenium(II) Tris(bipyridine) Complexes: Influence of the Conjugation Pathway

Transition‐metal complexes containing stimuli‐responsive systems are attractive for applications in optical devices, photonic memory, photosensing, as well as luminescence imaging. Amongst them, photochromic metal complexes offer the possibility of combining the specific properties of the metal centre and the optical response of the photochromic group. The synthesis, the electrochemical properties and the photophysical characterisation of a series of donor–acceptor azobenzene derivatives that possess bipyridine groups connected to a 4‐dialkylaminoazobenzene moiety through various linkers are presented. DFT and TD‐DFT calculations were performed to complement the experimental findings and contribute to their interpretation. The position and nature of the linker (ethynyl, triazolyl, none) were engineered and shown to induce different electronic coupling between donor and acceptor in ligands and complexes. This in turn led to strong modulations in terms of photoisomerisation of the ligands and complexes.     

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.

     

On Series of Ordinals and Combinatorics

This paper deals mainly with generalizations of results in finitary combinatorics to infinite ordinals. It is well-known that for finite ordinals ∑_bT<αβ is the number of 2-element subsets of an α-element set. It is shown here that for any well-ordered set of arbitrary infinite order type α, ∑_bT<αβ is the ordinal of the set M of 2-element subsets, where M is ordered in some natural way. The result is then extended to evaluating the ordinal of the set of all n-element subsets for each natural number n ≥ 2. Moreover, series ∑_β<αf(β) are investigated and evaluated, where α is a limit ordinal and the function f belongs to a certain class of functions containing polynomials with natural number coefficients. The tools developed for this result can be extended to cover all infinite α, but the case of finite α appears to be quite problematic.