Synthesis of Novel Monomeric Dyes with Anthraquinone Residue

Two novel polymerizable dyes with anthraquinone residue have been prepared, and their structures were characterized by FTIR, ^1HNMR and EA.     

Synthesis of paramagnetic BODIPY dyes as new double (spin and fluorescence) sensors

Paramagnetic pyrroline and 1,2,3,6-tetrahydropyridine derivatives of BODIPY and their diamagnetic analogs have been synthesized and characterized as novel redox double sensor and cation sensitive reagents.     

Algebraic representation of the linear problem as a method to construct the Darboux-Bäcklund transformation

An effective algorithm to construct the Darboux matrix based on the dressing method is proposed. Our approach consists in representing the linear problem as a system of algebraic constraints on two matrices. The Darboux matrix is determined from the requirement that the Darboux-Bäcklund transformation preserves these constraints. A non-isospectral deformation of the derivative nonlinear Schrödinger equation is discussed as an example.     

Tablet disintegration monitored by magnetic resonance imaging

The disintegration of bromhexin tablets was monitored by magnetic resonance imaging. The fast imaging method FLASH with spoiling gradients was used to obtain images of the tablets in short time intervals. The rate of the disintegration depends on the preparation method, kind and percentage of the carrier (polyethylene glycol, lactose). Solid dispersion with slow evaporation of solvent yields materials with decreased dissolution rate. Increasing molecular mass of polyethylene glycol and its percentage content also hampers disintegration.     

The capacity of parabolic julia sets

Supported by SFB 170 “Geometrie und Analysis” at the University of G?ttingen     

The complete grapht-packings andt-coverings

The aim of this paper is to introduce the notions of floor and ceiling functions related to graph edge-decompositions intot mutually isomorphic parts. It is shown that, given any natural numbert, uniform and extremal t-packing andt-covering exist for each complete graph and each complete bipartite graph. Extremal in this context means that both a remainder and a surplus are absolutely minimum. In proofs, decompositions of multigraphs into matchings are involved. Open problems and conjectures are stated.     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.     

Semigroups of matrices of intermediate growth

Finitely generated linear semigroups over a field K that have intermediate growth are considered. New classes of such semigroups are found and a conjecture on the equivalence of the subexponential growth of a finitely generated linear semigroup S and the nonexistence of free noncommutative subsemigroups in S, or equivalently the existence of a nontrivial identity satisfied in S, is stated. This ‘growth alternative’ conjecture is proved for linear semigroups of degree 2, 3 or 4. Certain results supporting the general conjecture are obtained. As the main tool, a new combinatorial property of groups is introduced and studied.