Reflectionless potentials and soliton series of the KDV equation

Potentials of the Schrödinger equation, slowly decreasing at infinity, generate an infinite discrete spectrum converging to zero. The inverse scattering problem in the class of such potentials is solved in a constructive way similarly to the classical soliton theory. An infinite-dimensional system arising from Backlund transformations over soliton solutions plays the role of a determinant representation of the potential. The asymptotics at infinity is derived by use of the Poisson summation formula. An application to the long-time asymptotics of the solution of the Korteweg-de Vries equation is considered.In Memory of Prof. M. C. PolivanovInstitute of Mathematics, Urals Branch, Russian Academy of Sciences, 450000, Chernyshevsky str. 112, Ufa, Russia. Published in Teoreticheskaya i Matematicheskaya Fizika, Vol. 93, No. 2, pp. 286–301, November, 1992.     

Quadrics on Riemannian spaces of constant curvature. Separation of variables and connection with the Gaudin magnet

Integrable systems associated with separation of the variables in real Riemannian spaces of constant curvature are considered. An isomorphism between all such systems and the hyperbolic Gaudin magnet is established. This isomorphism is used in a classification of all coordinate systems that admit separation of the variables, the basis of which is the classification of the correspondingL operators of the Gaudin magnet.Leningrad State University. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 91, No. 1, pp. 83–111, April, 1992.     

An estimate of length for tubular minimal surfaces of arbitrary codimension

Volgograd. Translated fromSibirskiî Matematicheskiî Zhurnal, Vol. 33, No. 5, pp. 201–205, September–October, 1992.     

A Faster Deterministic Maximum Flow Algorithm

Cheriyan and Hagerup developed a randomized algorithm to compute the maximum flow in a graph with n nodes and m edges in O(mn + n² log²n) expected time. The randomization is used to efficiently play a certain combinatorial game that arises during the computation. We give a version of their algorithm where a general version of their game arises. Then we give a strategy for the game that yields a deterministic algorithm for computing the maximum flow in a directed graph with n nodes and m edges that runs in time O(mn(log_{m/n log n}n)). Our algorithm gives an O(mn) deterministic algorithm for all m/n = Ω(n^ε) for any positive constant ε, and is currently the fastest deterministic algorithm for computing maximum flow as long as m/n = ω(log n).     

The elastoplastic stressed state of a half-plane under local nonstationary heating

We solve the thermoplastic problem for a semi-infinite plate under local nonstationary heating by heat sources. The physical equations are taken to be the relations of the nonisothermic theory of plastic flow associated with the Mises fluidity condition. The solution of the problem is constructed by the method of integral equations and the self-correcting method of sequential loading, where time is taken as the loading parameter. We carry out numerical computations of the stresses in the case of heating a plate with heat output by normal-circular heat sources. We study the problem of optimization of heating regimes in order to introduce favorable residual compressive stresses (from the point of view of hardness) in a given region of a half-plane. Two figures.Translated fromMatematicheskie Metody i Fiziko-Mekhanicheskie Polya, Issue 27, 1988, pp. 29–34.