Boron(iii) β-diketonate-based small molecules for functional non-fullerene polymer solar cells and organic resistive memory devices

A class of acceptor–donor–acceptor chromophoric small-molecule non-fullerene acceptors, 1–4, with difluoroboron(iii) β-diketonate (BF₂bdk) as the electron-accepting moiety has been developed. Through the variation of the central donor unit and the modification on the peripheral substituents of the terminal BF₂bdk acceptor unit, their photophysical and electrochemical properties have been systematically studied. Taking advantage of their low-lying lowest unoccupied molecular orbital energy levels (from −3.65 to −3.72 eV) and relatively high electron mobility (7.49 × 10⁻⁴ cm² V⁻¹ s⁻¹), these BF₂bdk-based compounds have been employed as non-fullerene acceptors in organic solar cells with maximum power conversion efficiencies of up to 4.31%. Moreover, bistable resistive memory characteristics with charge-trapping mechanisms have been demonstrated in these BF₂bdk-based compounds. This work not only demonstrates for the first time the use of a boron(iii) β-diketonate unit in constructing non-fullerene acceptors, but also provides more insights into designing organic materials with multi-functional properties.

Boron(iii) β-diketonates have been demonstrated to serve as multi-functional materials in NFA-based OPVs and organic resistive memories.     

The Effect of the Spacer of Bis(biurea) Ligands on the Structure of A2L3‐type (A=anion) Phosphate Complexes

By tuning the length and rigidity of the spacer of bis(biurea) ligands L, three structural motifs of the A₂L₃ complexes (A represents anion, here orthophosphate PO₄^3?), namely helicate, mesocate, and mono‐bridged motif, have been assembled by coordination of the ligand to phosphate anion. Crystal structure analysis indicated that in the three complexes, each of the phosphate ions is coordinated by twelve hydrogen bonds from six surrounding urea groups. The anion coordination properties in solution have also been studied. The results further demonstrate the coordination behavior of phosphate ion, which shows strong tendency for coordination saturation and geometrical preference, thus allowing for the assembly of novel anion coordination‐based structures as in transition‐metal complexes.     

Local linear convergence analysis of Primal–Dual splitting methods

In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.     

A generalized super AKNS hierarchy associated with orthosymplectic Lie superalgebra OSP(2,2) and its super bi-Hamiltonian structures

For the orthosymplectic Lie superalgebra $\text{◂⋅▸}OSP(2,2)$, we choose a set of basis matrices. A linear combination of those basis matrices presents a spatial spectral matrix. The compatible condition of the spatial part and the corresponding temporal parts of the spectral problem leads to a generalized super AKNS (GSAKNS) hierarchy. By making use of the supertrace identity, the obtained GSAKNS hierarchy can be written as the super bi-Hamiltonian structures.     

Uniform local well-posedness and inviscid limit for the Benjamin-Ono-Burgers equation

In this paper, we study the Cauchy problem for the Benjamin-Ono-Burgers equation \({\partial _t}u - \epsilon \partial _x^2u + {\cal H}\partial _x^2u + u{u_x} = 0\), where \({\cal H}\) denotes the Hilbert transform operator. We obtain that it is uniformly locally well-posed for small data in the refined Sobolev space \({\tilde H^\sigma }(\mathbb{R})\,\,(\sigma \geqslant 0)\), which is a subspace of L²(ℝ). It is worth noting that the low-frequency part of \({\tilde H^\sigma }(\mathbb{R})\) is scaling critical, and thus the small data is necessary. The high-frequency part of \({\tilde H^\sigma }(\mathbb{R})\) is equal to the Sobolev space H^σ (ℝ) (σ ⩾ 0) and reduces to L²(ℝ). Furthermore, we also obtain its inviscid limit behavior in \({\tilde H^\sigma }(\mathbb{R})\) (σ ⩾ 0).

     

Finding any given 2‐factor in sparse pseudorandom graphs efficiently

Given an $n$‐vertex pseudorandom graph $G$ and an $n$‐vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$, that is, an embedding $\phi :V\left(H\right)\to V\left(G\right)$ so that $\phi \left(u\right)\phi \left(v\right)\in E\left(G\right)$ for all $uv\in E\left(H\right)$. Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in $G$. Here, we provide a deterministic polynomial time algorithm that finds a given $H$ in any suitably pseudorandom graph $G$. The pseudorandom graphs we consider are $\left(p,\lambda \right)$‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, $\mathrm{\Omega }\left(pn\right)$. A $\left(p,\lambda \right)$‐bijumbled graph is characterised through the discrepancy property: $|e\left(A,B\right)?p|A||B||<\lambda \sqrt{|A||B|}$ for any two sets of vertices $A$ and $B$. Our condition $\lambda =O(p^{2}n/\log n)$ on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications.