A note on Hadwiger’s conjecture for W5-free graphs with independence number two

The Hadwiger number of a graph $G$, denoted $h\left(G\right)$, is the largest integer $t$ such that $G$ contains $K_t$ as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph $G$, $h\left(G\right)\ge \chi \left(G\right)$, where $\chi \left(G\right)$ denotes the chromatic number of $G$. Let $\alpha \left(G\right)$ denote the independence number of $G$. A graph is $H$-free if it does not contain the graph $H$ as an induced subgraph. In 2003, Plummer, Stiebitz and Toft proved that $h\left(G\right)\ge \chi \left(G\right)$ for all $H$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $H$ is any graph on four vertices with $\alpha \left(H\right)\le 2$, $H=C_5$, or $H$ is a particular graph on seven vertices. In 2010, Kriesell subsequently generalized the statement to include all forbidden subgraphs $H$ on five vertices with $\alpha \left(H\right)\le 2$. In this note, we prove that $h\left(G\right)\ge \chi \left(G\right)$ for all $W_5$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $W_5$ denotes the wheel on six vertices.     

Compactness and convergence rates in the combinatorial integral approximation decomposition

The combinatorial integral approximation decomposition splits the optimization of a discrete-valued control into two steps: solving a continuous relaxation of the discrete control problem, and computing a discrete-valued approximation of the relaxed control. Different algorithms exist for the second step to construct piecewise constant discrete-valued approximants that are defined on given decompositions of the domain. It is known that the resulting discrete controls can be constructed such that they converge to a relaxed control in the \(\hbox {weak}^*\) topology of \(L^\infty \) if the grid constant of this decomposition is driven to zero. We exploit this insight to formulate a general approximation result for optimization problems, which feature discrete and distributed optimization variables, and which are governed by a compact control-to-state operator. We analyze the topology induced by the grid refinements and prove convergence rates of the control vectors for two problem classes. We use a reconstruction problem from signal processing to demonstrate both the applicability of the method outside the scope of differential equations, the predominant case in the literature, and the effectiveness of the approach.

     

Onset of crater formation during short pulse laser ablation

We report morphologic changes of metallic surfaces at the onset of ablation, starting from gentle ablation to the emergence of ablation craters. The evolution of both observed melting zones and of ablation craters therein are investigated in dependence of the ablation laser fluence for nanosecond ultraviolet laser pulses. Further, consequences of crater formation for cluster synthesis within the released atomic vapor are pointed out. PACS 52.38.Mf; 79.20.Ds; 65.40.De     

Sur les surfaces lisses de ℙ4

Sans résuméEspace projectif sur un corps algébriquement clos de caractéristique zéro     

Molecular dynamics and information on possible sites of interaction of intramyocellular metabolites in vivo from resolved dipolar couplings in localized H NMR spectra

Proton NMR resonances of the endogenous metabolites creatine and phosphocreatine ((P)Cr), taurine (Tau), and carnosine (Cs, β-alanyl-l-histidine) were studied with regard to residual dipolar couplings and molecular mobility. We present an analysis of the direct ¹H–¹H interaction that provides information on motional reorientation of subgroups in these molecules in vivo. For this purpose, localized ¹H NMR experiments were performed on m. gastrocnemius of healthy volunteers using a 1.5-T clinical whole-body MR scanner. We evaluated the observable dipolar coupling strength SD₀ (S = order parameter) of the (P)Cr-methyl triplet and the Tau-methylene doublet by means of the apparent line splitting. These were compared to the dipolar coupling strength of the (P)Cr-methylene doublet. In contrast to the aliphatic protons of (P)Cr and Tau, the aromatic H2 (δ = 8 ppm) and H4 (δ = 7 ppm) protons of the imidazole ring of Cs exhibit second-order spectra at 1.5 T. This effect is the consequence of incomplete transition from Zeeman to Paschen-Back regime and allows a determination of SD₀ from H2 and H4 of Cs as an alternative to evaluating the multiplet splitting which can be measured directly in high-resolution ¹H NMR spectra. Experimental data showed striking differences in the mobility of the metabolites when the dipolar coupling constant D₀ (calculated with the internuclear distance known from molecular geometry in the case of complete absence of molecular dynamics and motion) is used for comparison. The aliphatic signals involve very small order parameters S ≈ (1.4 − 3) × 10⁻⁴ indicating rapid reorientation of the corresponding subgroups in these metabolites. In contrast, analysis of the Cs resonances yielded S ≈ (113 − 137) × 10⁻⁴. Thus, the immobilization of the Cs imidazole ring owing to an anisotropic cellular substructure in human m. gastrocnemius is much more effective than for (P)Cr and Tau subgroups. Furthermore, ¹H NMR experiments on aqueous model solutions of histidine and N-acetyl-l-aspartate (NAA) enabled the assignment of an additional signal component at δ = 8 ppm of Cs in vivo to the amide group at the peptide bond. The visibility of this proton could result from hydrogen bonding which would agree with the anticipated stronger motional restriction of Cs. Referring to the observation that all dipolar-coupled multiplets resolved in localized in vivo ¹H NMR spectra of human m. gastrocnemius collapse simultaneously when the fibre structure is tilted towards the magic angle (θ ≈ 55°), a common model for molecular confinement in muscle tissue is proposed on the basis of an interaction of the studied metabolites with myocellular membrane phospholipids.     

Announcement of Proficiency Testing Schemes

Accreditation and Quality Assurance -     

Kinetic Models for Chemotaxis and their Drift-Diffusion Limits

Kinetic models for chemotaxis, nonlinearly coupled to a Poisson equation for the chemo-attractant density, are considered. Under suitable assumptions on the turning kernel (including models introduced by Othmer, Dunbar and Alt), convergence in the macroscopic limit to a drift-diffusion model is proven. The drift-diffusion models derived in this way include the classical Keller-Segel model. Furthermore, sufficient conditions for kinetic models are given such that finite-time-blow-up does not occur. Examples are given satisfying these conditions, whereas the macroscopic limit problem is known to exhibit finite-time-blow-up. The main analytical tools are entropy techniques for the macroscopic limit as well as results from potential theory for the control of the chemo-attractant density.Present address: Centro de Matemática e Aplicações Fundamentais, Universidade de Lisboa, Av. Prof. Gama Pinto 2, 1649-003, Lisboa, Portugal     

Piecewise Deterministic Markov Control Processes with Feedback Controls and Unbounded Costs

The control of piecewise-deterministic processes is studied where only local boundedness of the data is assumed. Moreover the discount rate may be zero. The value function is shown to be solution to the Bellman equation in a weak sense; however the solution concept is strong enough to generate optimal policies. Continuity and compactness conditions are given for the existence of nonrelaxed optimal feedback controls.     

An Overview of Scheduling Problems Arising in Satellite Communications

Satellite communications, like batches of work in a job shop, need to be scheduled in order to use their resources as efficiently as possible. The most common satellite communications system in use today is known as Time Division Multiple Access (TDMA), in which data from earth stations is buffered before being transmitted to the appropriate receiver on a satellite. Cycles of transmission are fixed for all stations. Since the same satellite will be used for routeing data in several different ways, a schedule must be devised to use the receivers, repeaters and transmitters on board to minimize the time needed for completion of a batch of work. This paper is a survey of current scheduling algorithms used for optimizing satellite communications resources. Apart from telecommunications, the methods presented here could be applied to more general scheduling problems with renewable resources but without precedence constraints.