Regioselective synthesis of 2,4,6-triaminopyridines

A regioselective synthesis of 2,4,6-trisubstituted pyridine is described starting from 2,6-dibromo-4-nitropyridine. All three different regioisomers of the 2,4,6-triamino substituted pyridine have been synthesized in four to five steps. The method described is a general route to unsymmetrical 2,4,6-trisubstituted amino pyridines.     

Étale covers of affine spaces in positive characteristicRevêtements étales des espaces affines en caractéristique positive

We prove that every projective, geometrically reduced scheme of dimension n over an infinite field k of positive characteristic admits a finite morphism over some finite radicial extension k′ of k to projective n-space, étale away from the hyperplane H at infinity, which maps a chosen Weil divisor into H and a chosen smooth geometric point of X not on the divisor to some point not in H. To cite this article: K.S. Kedlaya, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 921–926.     

Z-scan studies on porphyrin derivative

Received: 10 January 1996 / Revised version: 15 June 1996     

A Primal Simplex Based Solution Procedure for the Rectilinear Distance Multifacility Location Problem

In this paper a primal simplex based solution procedure is developed for a multiproduct, multi-facility location problem using rectilinear distance measures. By overcoming the combinatorial nature of the problem which arises in the presence of degeneracy, this procedure is capable of handling large size problems. Computational results are also provided.     

A finitely convergent procedure for facial disjunctive programs

This paper addresses an important class of disjunctive programs called facial disjunctive programs, examples of which include the zero-one linear integer programming problem and the linear complementarity problem. Balas has characterized some fundamental properties of such problems, one of which has been used by Jeroslow to obtain a finitely convergent procedure. This paper exploits another basic property of facial disjunctive programs in order to develop an alternative finitely convergent algorithm.     

Nonlinear programming without differentiability in banach spaces: necessary and sufficient constraint qualification

The problem under consideration is a maximization problem over a constraint set defined by a finite number of inequality and equality constraints over an arbitrary set in a reflexive Banach space. A generalization of the Kuhn-Tucker necessary conditions is developed where neither the objective function nor the constraint functions are required to be differentiable. A new constraint qualification is imposed in order to validate the optimality criteria. It is shown that this qualification is the weakest possible in the sense that it is necessary for the optimality criteria to hold at the point under investigation for all families of objective functions having a constrained local maximum at this point