Lagrangian Duality in Set-Valued Optimization

In this paper, we study optimization problems where the objective function and the binding constraints are set-valued maps and the solutions are defined by means of set-relations among all the images sets (Kuroiwa, D. in Takahashi, W., Tanaka, T. (eds.) Nonlinear analysis and convex analysis, pp. 221–228, 1999). We introduce a new dual problem, establish some duality theorems and obtain a Lagrangian multiplier rule of nonlinear type under convexity assumptions. A necessary condition and a sufficient condition for the existence of saddle points are given. The authors thank the two referees for valuable comments and suggestions on early versions of the paper. The research of the first author was partially supported by Ministerio de Educación y Ciencia (Spain) Project MTM2006-02629 and by Junta de Castilla y León (Spain) Project VA027B06.     

Isochronous systems and their quantization

We review recent results about classical isochronous systems characterized by the presence of an open (hence fully dimensional) region in their phase space in which all their solutions are completely periodic (i.e., periodic in all degrees of freedom) with the same fixed period (independent of the initial data provided they are inside the isochronicity region). We report a technique for generating such systems, whose wide applicability justifies the statement that isochronous systems are not rare. We also present an analogous technique applicable to a vast class of Hamiltonian systems and generating isochronous Hamiltonian systems. We also report some results concerning the quantized versions of such systems.     

Partition of Euclidean space into polyhedra induced by a small deformation of the densest lattice sphere packing

The number of combinatorially nonequivalent Dirichlet-Voronoi diagrams constructed for the centers of balls in the packing obtained from the densest lattice packing of equal spheres by a small displacement of the spheres is estimated. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 11, No. 5, pp. 79–84, 2005.     

Automorphisms of the semigroup of invertible matrices with nonnegative elements

In this paper, we prove that every automorphism of the semigroup of invertible matrices with nonnegative elements over a linearly ordered associative ring on some specially defined subgroup coincides with the composition of an inner automorphism of the semigroup, an order-preserving automorphism of the ring, and a central homothety. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 11, No. 2, pp. 3–23, 2005.     

Colorings of spaces,and random graphs

This work deals with some problems on the embeddings of finite geometric graphs into the random ones. In particular, we study here applications of the random graph theory to the Nelson-Erdös-Hadwiger problem on coloring spaces.     

Fano direct products as rationally connected fibrations

Combining the connectedness principle of Shokurov and Kollár, we develop a new technique of studying birational maps of natural Fano fiber spaces. We prove that the only structures of a rationally connected fibration on direct products of typical Fano varieties are projections onto the factors. In particular, the groups of biregular and birational self-maps of Fano direct products coincide. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 10, No. 4, pp. 183–206, 2004.