Design and investigation of UV image detectors

The results of investigation of optical image detectors designed for the largest problem, near-VUV, range of the spectrum are presented. The possibility of using a dual-stage image detection system to appreciably lower the sensitivity threshold and make computer data processing feasible is considered. The integration of a UV module into a wideband image detector is studied.     

Iodine(III)‐Catalyzed Rearrangements of Imides: A Versatile Route to α,α‐Dialkylated α‐Hydroxy Carboxylamides

A tertiary hydroxy group α to a carboxyl moiety comprises a key structural motif in many bioactive substances. With the herein presented metal‐free rearrangement of imides triggered by hypervalent λ³‐iodane, an easy and selective way to gain access to such a compound class, namely α,α‐disubstituted‐α‐hydroxy carboxylamides, was established. Their additional methylene bromide side chain constitutes a useful handle for rapid diversification, as demonstrated by a series of further functionalizations. Moreover, the in situ formation of an iodine(III) species under the reaction conditions was proven. Our findings clearly corroborate that hypervalent λ³‐benziodoxolones are involved in these organocatalytic reactions.     

Conjugation effects and optical spectra of 1,2-diphosphole cycloadducts

Russian Chemical Bulletin - Quantum chemical calculations and a comparative analysis of Raman spectra of 3,4,5-triphenyl-1-propyl-1,2-diphosphole (1),...     

Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.