Judith R. Goodstein: Einstein’s Italian Mathematicians – Ricci,Levi-Civita,and the Birth of General Relativity

Mathematische Semesterberichte -     

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.

     

Sur les surfaces lisses de ℙ4

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

An organometallic RhIII complex with a distorted octahedral structure: (acetonitrile‐κN)dimethyl(1,4,7‐trimethyl‐1,4,7‐triazacyclononane‐κ3N,N′,N′′)rhodium(III) tetraphenylborate

In the title compound, [Rh(CH₃)₂(C₂H₃N)(C₉H₂₁N₃)](C₂₄H₂₀B), the geometry around the Rh^III centre is distorted octahedral, with elongated Rh—N bonds trans to the metal‐bonded methyl groups. The metal‐containing cations are located in channels formed by an anionic supramolecular mesh, in which aromatic π–π interactions between anionic [B(Ph)₄]^? units play a major role.