Ueber den Stand der Herausgabe von Gauss' Werken

Ohne ZusammenfassungAbgedruckt aus den Nachrichten der K. Gesellschaft der Wissenschaften zu Göttingen, Geschäftliche Mittheilungen, 1898, Heft I. (Oeffentliche Sitzung vom 30. April 1898.)     

Regioregular poly(3‐alkanoylthiophene): Synthesis and electrochemical,photophysical, charge transport,and photovoltaic properties

Head‐to‐tail regioregular poly(3‐heptanoylthiophene) (PHOT) was synthesized by Ni‐catalyzed polycondensation of the 2,2‐dimethyl‐1,3‐propanediol‐protected Grignard monomer followed by deprotection. Cyclic voltammetric (CV) study demonstrates that the highest occupied molecular orbital (HOMO) and lowest unoccupied molecular orbital (LUMO) of PHOT are 0.5 eV lower in energy than those of the head‐to‐tail poly(3‐hexylthiophene) (HT‐P3HT). Their optical band gaps are essentially the same. Incomplete photoluminescence (PL) quenching was observed in thin films of the 1:1 blend of PHOT and HT‐P3HT. PHOT displayed a glass transition at ～269 °C and decomposed at ～300 °C according to differential scanning calorimetry (DSC) and thermogravimetric analysis (TGA). Wide‐angle X‐ray diffraction (WAXD) study showed that PHOT exists in a not highly ordered state in solid films especially in the π‐stacking direction. Only p‐channel activity was observed in field‐effect transistors (FETs) for PHOT. The hole mobility was on the order of 10^?4 cm² V^?1 s^?1. Photovoltaic devices with an active layer of 1:1 blend of PHOT and PC₇₁BM had a power conversion efficiency (PCE) of ～0.5%. © 2010 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem, 2010     

Lubrication approximation with prescribed nonzero contact anggle

We prove long existence for a weak solutions ss(t,x)≥0 of the lubrication approximation ?_t+?_x(s?s)=0 in{s>0> with prescribed contact anglo of, say,(?_xs)²=1 on ?{s>0}     

Computing the minimal covering set

We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm exists for two variants of the minimal covering set–the minimal upward covering set and the minimal downward covering set–unless P equals NP. Finally, we observe a strong relationship between von Neumann–Morgenstern stable sets and upward covering on the one hand, and the Banks set and downward covering on the other.     

An effective route for the synthesis of cationic palladium complexes of general formula [(Acac)PdLL]A

A series of palladium complexes of general formula [(Acac)PdL¹L²]⁺A⁻, where L¹, L² = phosphines and A = BF₄, CF₃SO₃, were synthesized. Preliminary studies show that the complexes are active in selective dimerization of styrene and addition polymerization of norbornene.