A General Catalyst Based on Cobalt Core–Shell Nanoparticles for the Hydrogenation of N-Heteroarenes Including Pyridines

Herein, we report the synthesis of specific silica-supported Co/Co₃O₄ core–shell based nanoparticles prepared by template synthesis of cobalt-pyromellitic acid on silica and subsequent pyrolysis. The optimal catalyst material allows for general and selective hydrogenation of pyridines, quinolines, and other heteroarenes including acridine, phenanthroline, naphthyridine, quinoxaline, imidazo[1,2-a]pyridine, and indole under comparably mild reaction conditions. In addition, recycling of these Co nanoparticles and their ability for dehydrogenation catalysis are showcased.     

Enantioselective hydrogenation of diaryl-substituted α,β-unsaturated nitriles

α,β-Unsaturated nitriles can be hydrogenated with enantioselectivities up to 88% ee using chiral ruthenium-diphenylphosphino bisaryl and bisheteroaryl complexes such as ruthenium(II)-BINAP and ruthenium(II)-BINP. Mechanistic investigations indicate that conversion is accelerated by electron-rich ligands and that an additional coordinative group needs be present in order to promote conversion. The chiral products are useful building blocks for the synthesis of histamine H₂ agonists of the arpromidine type.     

Discrete approximation of integral operators

A method to approximate the eigenvalues of linear operators depending on an unknown distribution is introduced and applied to weighted sums of squared normally distributed random variables. This area of application includes the approximation of the asymptotic null distribution of certain degenerated U- and V-statistics.

     

A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces

We give a simple proof of the fact (which follows from the Robertson–Seymour theory) that a graph which is minimal of genusgcannot contain a subdivision of a large grid. Combining this with the tree-width theorem and the quasi-wellordering of graphs of bounded tree-width in the Robertson–Seymour theory, we obtain a simpler proof of the generalized Kuratowski theorem for each fixed surface. The proof requires no previous knowledge of graph embeddings.