Addition–fragmentation chain transfer: Molecular weight distributions and retardation in the system methyl methacrylate/methyl α‐(bromomethyl)acrylate

A detailed investigation of addition–fragmentation chain transfer (AFCT) in the free‐radical polymerization of methyl methacrylate (MMA) in the presence of methyl α‐(bromomethyl)acrylate (MBMA) was carried out to elucidate mechanistic details with efficient macromonomer synthesis as an underlying goal. Advanced modeling techniques were used in connection with the experimental work. Curve fitting of simulated and experimental molecular weight distributions with respect to the rate coefficient for addition of propagating radicals to MBMA (k_add) over 60–120 °C resulted in E_add = 21.7 kJ mol^?1 and A_add = 2.18 × 10⁶ M^?1 s^?1 and a very weak temperature dependence of the chain‐transfer constant (E_add ≈ E_p). The rate coefficient for fragmentation of adduct radicals at 60 °C was estimated as k_f ≈ 39 s^?1 on the basis of experimental data of the MMA conversion and the concentration of 2‐carbomethoxy‐2‐propenyl end groups. The approach developed is generic and can be applied to any AFCT system in which copolymerization does not occur and in which the resulting unsaturated end groups do not undergo further reactions. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 2640–2650, 2004     

On Constraint Qualifications in Nonsmooth Optimization

We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here.     

Upper Bounds of the Pursuer Control Based on a Linear-Quadratic Differential Game

Differential game formulations provide an adequate basis for a guidance law synthesis against highly maneuvering targets. This paper deals with a guidance law based on a linear-quadratic differential game formulation. This guidance law has many attractive properties: it is continuous, linear with respect to the state variables, and its gain coefficients can be precalculated offline. Nevertheless, due to the lack of hard control constraints in the formulation, the magnitude of the control can exceed the admissible level imposed by the nature of the problem. In this paper, the upper bound of the interceptor control is obtained depending on the system parameters and the penalty coefficients of the game performance index. It is shown that the interceptor can guarantee an arbitrarily small miss distance without exceeding the control constraints if it has sufficient maneuverability and if the penalty coefficients are chosen properly. By manipulating the penalty coefficients, it is possible to reduce significantly the maneuverability requirements compared to the case of zero interceptor penalty coefficient.     

Optimality Conditions and Geometric Properties of a Linear Multilevel Programming Problem with Dominated Objective Functions

In this paper, a model of a linear multilevel programming problem with dominated objective functions (LMPPD(l)) is proposed, where multiple reactions of the lower levels do not lead to any uncertainty in the upper-level decision making. Under the assumption that the constrained set is nonempty and bounded, a necessary optimality condition is obtained. Two types of geometric properties of the solution sets are studied. It is demonstrated that the feasible set of LMPPD(l) is neither necessarily composed of faces of the constrained set nor necessarily connected. These properties are different from the existing theoretical results for linear multilevel programming problems.     

The existence of Thom classes

In this paper we consider the category of unstable modules over the Steenrod algebra. We prove the existence of finite primary decompositions in this category. Moreover, we prove the existence of Thom classes in noetherian unstable modules, i.e., elements that generate cyclic unstable submodules that are closed under the action of the Steenrod algebra. This in turn leads to the proof of the prime filtration theorem in the category of noetherian unstable modules. As an application we present a proof of the Landweber-Stong conjecture (now a theorem by D. Bourguiba and S. Zarati) that does not make use of the classification of injectives.     

PSL2(59) is a Subgroup of the Monster

A computer construction of the Monster is used to prove thatPSL(2, 59) is a subgroup of the Monster.     

On division rings with algebraic commutators of bounded degree

We shall answer several questions concerning additive or multiplicative commutators in a division ring which are algebraic of bounded degree over its center.