Time-Dependent Density Functional Molecular Orbital and Excited State Calculations on Bis(porphyrinyl)butadiynes in the Monocationic, Neutral, Monoanionic, and Dianionic Oxidation States

We report a theoretical study of the multiple oxidation states (1+, 0, 1−, and 2−) of a meso,meso-linked diporphyrin, namely bis[10,15,20-triphenylporphyrinatozinc(II)-5-yl]butadiyne (4), using Time-Dependent Density Functional Theory (TDDFT). The origin of electronic transitions of singlet excited states is discussed in comparison to experimental spectra for the corresponding oxidation states of the close analogue bis{10,15,20-tris[3‘,5‘-di-tert-butylphenyl]porphyrinatozinc(II)-5-yl}butadiyne (3). The latter were measured in previous work under in situ spectroelectrochemical conditions. Excitation energies and orbital compositions of the excited states were obtained for these large delocalized aromatic radicals, which are unique examples of organic mixed-valence systems. The radical cations and anions of butadiyne-bridged diporphyrins such as 3 display characteristic electronic absorption bands in the near-IR region, which have been successfully predicted with use of these computational methods. The radicals are clearly of the “fully delocalized” or Class III type. The key spectral features of the neutral and dianionic states were also reproduced, although due to the large size of these molecules, quantitative agreement of energies with observations is not as good in the blue end of the visible region. The TDDFT calculations are largely in accord with a previous empirical model for the spectra, which was based simplistically on one-electron transitions among the eight key frontier orbitals of the C4 (1,4-butadiyne) linked diporphyrins.

On Ordinal VC-Dimension and Some Notions of Complexity

We generalize the classical notion of Vapnik–Chernovenkis (VC) dimension to ordinal VC-dimension, in the context of logical learning paradigms. Logical learning paradigms encompass the numerical learning paradigms commonly studied in Inductive Inference. A logical learning paradigm is defined as a set W of structures over some vocabulary, and a set D of first-order formulas that represent data. The sets of models of ϕ in W, where ϕ varies over D, generate a natural topology W over W. We show that if D is closed under boolean operators, then the notion of ordinal VC-dimension offers a perfect characterization for the problem of predicting the truth of the members of D in a member of W, with an ordinal bound on the number of mistakes. This shows that the notion of VC-dimension has a natural interpretation in Inductive Inference, when cast into a logical setting. We also study the relationships between predictive complexity, selective complexity—a variation on predictive complexity—and mind change complexity. The assumptions that D is closed under boolean operators and that W is compact often play a crucial role to establish connections between these concepts. We then consider a computable setting with effective versions of the complexity measures, and show that the equivalence between ordinal VC-dimension and predictive complexity fails. More precisely, we prove that the effective ordinal VC-dimension of a paradigm can be defined when all other effective notions of complexity are undefined. On a better note, when W is compact, all effective notions of complexity are defined, though they are not related as in the noncomputable version of the framework.