Luminescent copolymers for applications in multicolor‐light‐emitting devices

Light‐emitting diodes based on organic materials [organic light‐emitting diodes (OLEDs)] have attracted much interest over the past decade. Several different attempts have been made to realize multicolor OLEDs. This article describes a new approach based on energy transfer in a donor/acceptor system. A copolymer containing both donor and acceptor compounds as comonomer units is prepared. The polymer consists of a derivative of a luminescent dye [4‐dicyanmethylene‐2‐methyl‐6‐4H‐pyran (DCM); acceptor compound], which is copolymerized with fluorene (donor compound) to combine the properties of an electroactive polymer with a highly luminescent dye. Photochemical processing is achieved by UV irradiation of this copolymer in the presence of gaseous trialkylsilanes. This reagent selectively saturates the C?C bonds in the DCM comonomer units while leaving the fluorene units essentially unaffected. As a result of the photochemical process, the red electroluminescence of the acceptor compound vanishes, and the blue‐green electroluminescence from the polyfluorene units is recovered. Compared with previous approaches based on polymer blends, this copolymer approach avoids problems associated with phase‐separation phenomena in the active layer of OLEDs. © 2006Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 4317–4327, 2006     

Algebraic properties of discrete box splines

The central objective of this paper is to discuss linear independence of translates of discrete box splines which we introduced earlier as a device for the fast computation of multivariate splines. The results obtained here allow us to draw conclusions about the structure of such discrete splines which have, in particular, applications to counting the number of nonnegative integer solutions of linear diophantine equations.     

A characterization of the \Sigma_1-definable functions of KP\omega + (uniform\; AC)

The subject of this paper is a characterization of the -definable set functions of Kripke-Platek set theory with infinity and a uniform version of axiom of choice: . This class of functions is shown to coincide with the collection of set functionals of type 1 primitive recursive in a given choice functional and . This goal is achieved by a G?del Dialectica-style functional interpretation of and a computability proof for the involved functionals. Received October 9, 1996     

Recognition of ring pairs in the data analysis of Cherenkov detectors

We present a new algorithm for the identification of ring pairs in Cherenkov detectors. The approach combines linear regression methods for the construction of an appropriate reference quantity, methods from statistics for the evaluation of hypotheses and Monte Carlo simulation runs for the tuning of threshold levels.