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

Mathematische Semesterberichte -     

Synthesis and Reactivity of the First Isolated Hydrogen‐Bridged Silanol–Silanolate Anions

We report on the first examples of isolated silanol–silanolate anions, obtained by utilizing weakly coordinating phosphazenium counterions. The silanolate anions were synthesized from the recently published phosphazenium hydroxide hydrate salt with siloxanes. The silanol–silanolate anions are postulated intermediates in the hydroxide‐mediated polymerization of aryl and alkyl siloxanes. The silanolate anions are strong nucleophiles because of the weakly coordinating character of the phosphazenium cation, which is perceptible in their activity in polysiloxane depolymerization.     

Intramolecular Hydroamination of Selenoalkynes to 2-Selenylindoles in the Absence of Catalyst

In this work, a series of 2-chalcogenylindoles was synthesized by an efficient methodology, starting from chalcogenoalkynes, including a previously unreported tellurium indole derivative. For the first time, these 2-substituted chalcogenylindoles were obtained in the absence of metal catalyst or base, under thermal conditions only. In addition, the results described herein represent a methodology with inverse regioselectivity for the chalcogen functionalization of indoles.     

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.

     

Absolutely indecomposable symmetric matrices

Let A be a symmetric matrix of size n×n with entries in some (commutative) field K. We study the possibility of decomposing A into two blocks by conjugation by an orthogonal matrix T∈Mat_n(K). We say that A is absolutely indecomposable if it is indecomposable over every extension of the base field. If K is formally real then every symmetric matrix A diagonalizes orthogonally over the real closure of K. Assume that K is a not formally real and of level s. We prove that in Mat_n(K) there exist symmetric, absolutely indecomposable matrices iff n is congruent to 0, 1 or −1 modulo 2s.     

Sur les surfaces lisses de ℙ4

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