Fifty years of the Siberian Division of the Russian Academy of Sciences

This is a write-up on the foundation of the Sobolev Institute of Mathematics in 1957.     

Approximate Toeplitz Matrix Problem Using Semidefinite Programming

Given a data matrix, we find its nearest symmetric positive-semidefinite Toeplitz matrix. In this paper, we formulate the problem as an optimization problem with a quadratic objective function and semidefinite constraints. In particular, instead of solving the so-called normal equations, our algorithm eliminates the linear feasibility equations from the start to maintain exact primal and dual feasibility during the course of the algorithm. Subsequently, the search direction is found using an inexact Gauss-Newton method rather than a Newton method on a symmetrized system and is computed using a diagonal preconditioned conjugate-gradient-type method. Computational results illustrate the robustness of the algorithm.     

Achievement of laser fusion of biological cells using UV pulsed dye laser beams

This paper reports a successful achievement of laser-induced biological cell fusion using an excimer laser excited dye laser. To our knowledge, we examined for the first time the dependence of fusion rate on laser pulse energy, number of laser pulses, and laser wavelength. Maximum fusion rate of approximately 50% was obtained by this laser fusion technology.     

Synchronization through system interconnections

An interconnection strategy with built-in adaptive controllersis presented which achieves synchronization of scalar linearsystems: the closed-loop network forces all outputs to followthe same signal asymptotically while maintaining the open-loopcharacteristics. In the design of the output feedback controllers,no knowledge of system parameters is assumed, but each systemmust have the same poles and be high-gain-stable. The proofof the main theorem relies critically on derived systems-theoreticresults and the special system topology as a network of interconnectedsystems. The topology is explained by first solving the simplerproblem of signal synchronization.     

Supersymmetric Dirichlet operators

A canonical supersymmetric extension of classical Dirichlet forms and operators given by measures on linear spaces is considered. In the case of log-concave measures, the supersymmetric Dirichlet operator generates a hypercontractive semigroup. This setting is appropriate for infinite-dimensional geometry and quantum field theory.Dedicated to Yu. M. Berezanskii on the occasion of his seventieth birthdayPublished in Ukrainskii Matematicheskii Zhurnal, Vol. 47, No. 5, pp. 583–592, May, 1995.The present work was supported by the DFG.     

The fracture energy of materials under pulse microsecond-scale loading

Based on the results of fracture in polymethyl methacrylate and a spheroplastic using a magnetic-pulse setup, the specific work of the formation of a new surface is estimated, which is similar to Griffith’s surface energy for quasi-static tests. The value obtained is greater than the corresponding value determined from the quasi-static tests by an order of magnitude and tends to increase as the loading time decreases.     

Asymptotic conditions for the electromagnetic form factors of hadrons represented by the VMD model

A system of linear homogeneous algebraic equations for the coupling constant ratios of vector mesons to hadrons is derived by imposing the assumed asymptotic behavior upon the VMD pole parameterization of an hadron electromagnetic form factor. A similar system of equations with a simpler structure of the coefficients, taken as even powers of the vector-meson masses, is derived by means of integral superconvergent sum rules for the imaginary part of the considered form factor using its appropriate -function approximation. Although both systems have been derived starting from different properties of the electromagnetic form factor and they each have their own appearances, it is shown explicitly that they are fully equivalent. Received: 20 March 2002 / Revised version: 3 December 2002 / Published online: 7 March 2003     

20-relative neighborhood graphs are hamiltonian

For any two points p and q in the Euclidean plane, define LUN_pq = { v | v ∈ R², d_pv < d_pq and d_qv < d_pq}, where d_uv is the Euclidean distance between two points u and v . Given a set of points V in the plane, let LUN_pq(V) = V ∩ LUN_pq. Toussaint defined the relative neighborhood graph of V, denoted by RNG(V) or simply RNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of RNG(V) if and only if LUN_pq (V) = ?. The relative neighborhood graph has several applications in pattern recognition that have been studied by Toussaint. We shall generalize the idea of RNG to define the k-relative neighborhood graph of V, denoted by kRNG(V) or simply kRNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of kRNG(V) if and only if | LUN_pq(V) | < k, for some fixed positive number k. It can be shown that the number of edges of a kRNG is less than O(kn). Also, a kRNG can be constructed in O(kn₂) time. Let E_c = {e_pq| p ∈ V and q ∈ V}. Then G_c = (V,E_c) is a complete graph. For any subset F of E_c, define the maximum distance of F as max_epq∈Fd_pq. A Euclidean bottleneck Hamiltonian cycle is a Hamiltonian cycle in graph G_c whose maximum distance is the minimum among all Hamiltonian cycles in graph G_c. We shall prove that there exists a Euclidean bottleneck Hamiltonian cycle which is a subgraph of 20RNG(V). Hence, 20RNGs are Hamiltonian.