Oscillation and non‐oscillation results for solutions of perturbed half‐linear equations

The purpose of this paper is to describe the oscillatory properties of second‐order Euler‐type half‐linear differential equations with perturbations in both terms. All but one perturbations in each term are considered to be given by finite sums of periodic continuous functions, while coefficients in the last perturbations are considered to be general continuous functions. Since the periodic behavior of the coefficients enables us to solve the oscillation and non‐oscillation of the considered equations, including the so‐called critical case, we determine the oscillatory properties of the equations with the last general perturbations. As the main result, we prove that the studied equations are conditionally oscillatory in the considered very general setting. The novelty of our results is illustrated by many examples, and we give concrete new corollaries as well. Note that the obtained results are new even in the case of linear equations.     

Synthesis and Diverse Transformations of a Dinitrogen Dititanium Hydride Complex Bearing Rigid Acridane-Based PNP-Pincer Ligands

Studies on N₂ activation and transformation by transition metal hydride complexes are of particular interest and importance. The synthesis and diverse transformations of a dinitrogen dititanium hydride complex bearing the rigid acridane-based ^acriPNP-pincer ligands {[(^acriPNP)Ti]₂(μ₂-η¹:η²-N₂)(μ₂-H)₂} are presented. This complex enabled N₂ cleavage and hydrogenation even without additional H₂ or other reducing agents. Furthermore, diverse transformations of the N₂ unit with a variety of organometallic compounds such as ZnMe₂, MgMe₂, AlMe₃, B(C₆F₅)₃, PinBH, and PhSiH₃ have been well established at the rigid ^acriPNP-ligated dititanium framework, such as reversible bonding-mode change between the end-on and side-on/end-on fashions, diborylative N=N bond cleavage, the formal insertion of two dimethylaluminum species into the N=N bond, and the formal insertion of two silylene units into the N=N bond. This work has revealed many unprecedented aspects of dinitrogen reaction chemistry.     

Local linear convergence analysis of Primal–Dual splitting methods

In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.     

Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems

Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programing problems such as solvability, duality, and complementary slackness conditions are studied in this article. As illustrations for the results, we investigate the parametric version of Gale’s example.     

Solvability of a nonlinear fifth‐order difference equation

Some formulas for well‐defined solutions to four very special cases of a nonlinear fifth‐order difference equation have been presented recently in this journal, where some of them were proved by the method of induction, some are only quoted, and no any theory behind the formulas was given. Here, we show in an elegant constructive way how the general solution to the difference equation can be obtained, from which the special cases very easily follow, which is also demonstrated here. We also give some comments on the local stability results on the special cases of the nonlinear fifth‐order difference equation previously publish in this journal.     

Some extensions of the operator entropy type inequalities

In this paper, we define the generalised relative operator entropy and investigate some of its properties such as subadditivity and homogeneity. As application of our result, we obtain the information inequality. In continuation, we establish some reverses of the operator entropy inequalities under certain conditions by using the Mond–Pe?ari? method.     

Linearly χ-bounding (P6, C4)-free graphs*

Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time.     

Direct through anionic,cationic, and radical active species: Terminal carbon–halogen bond for “controlled”/living polymerizations of styrene

In this work, we examined the synthesis of novel block (co)polymers by mechanistic transformation through anionic, cationic, and radical living polymerizations using terminal carbon–halogen bond as the dormant species. First, the direct halogenation of growing species in the living anionic polymerization of styrene was examined with CCl₄ to form a carbon–halogen terminal, which can be employed as the dormant species for either living cationic or radical polymerization. The mechanistic transformation was then performed from living anionic polymerization into living cationic or radical polymerization using the obtained polymers as the macroinitiator with the SnCl₄/n‐Bu₄NCl or RuCp^*Cl(PPh₃)/Et₃N initiating system, respectively. Finally, the combination of all the polymerizations allowed the synthesis block copolymers including unprecedented gradient block copolymers composed of styrene and p‐methylstyrene. © 2018 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2019 , 57, 465–473