Multiple local solutions to nonlinear control processes

We use the topological tool of Nielsen fixed-point theory to study the controllability of perturbed linear control processes whose control space can be reduced to a finite-dimensional one. These methods produce a lower bound on the number of controls that achieve a given target. We concentrate particularly on the case where the perturbation has sublinear growth, and we exhibit examples of multiple controls of various types that are detected by the Nielsen theory method.This research was partly supported by the Research Grant Teoria del Controllo dei Sistemi Dinamici, Ministero della Pubblica Istruzione, Roma, Italy.     

Equivalence of regularity for the Bergman projection and the\bar \partial-neumann operator

A necessary and sufficient condition for regularity of the -Neumann operator on (0,q)-forms in a smooth bounded pseudoconvex domain in Cⁿ is that the orthogonal projections onto -closed forms of degrees (0,q−1), (0,q), and (0,q+1) all be regular. The first author partially supported by NSF Grant DMS-8701038     

Asymptotics of solutions of a linear singularity perturbed system with degeneracy

Asymptotic expansions with respect to a small parameter e are constructed for a fundamental system of solutions of a linear singularity perturbed system of equations of the form

Extending an edge-coloring

When can a k-edge-coloring of a subgraph K of a graph G be extended to a k-edge-coloring of G? One necessary condition is that for all X ? E(G) - E(K), where μ_i(X) is the maximum cardinality of a subset of X whose union with the set of edges of K colored i is a matching. This condition is not sufficient in general, but is sufficient for graphs of very simple structure. We try to locate the border where sufficiency ends.     

Infinite-order phase transition in a classical spin system

For an exactly soluble classical spin model with long-range inhomogeneous coupling it is proved that in the absence of external magnetic field the free energy is aC function of the temperature at the critical point.     

Parallel and superfast algorithms for Hankel systems of equations

Summary Utilizing kernel structure properties a unified construction of Hankel matrix inversion algorithms is presented. Three types of algorithms are obtained: 1)O(n ²) complexity Levinson type, 2)O (n) parallel complexity Schur-type, and 3)O(n log² n) complexity asymptotically fast ones. All algorithms work without additional assumption (like strong nonsingularity).     

Impulse systems with fixed moments of shocks of general position: The structure of the set of moments of the shocks

Ordinary differential equations with impulse action are considered at fixed moments of time when finite limits points are admitted to the set of moments of the shocks. The topological structure of this set is clarified: it must be resolvable, in particular nowhere dense in R.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 3, pp. 378–383, March, 1990.     

Tracking poles and representing Hankel operators directly from data

Summary We propose and analyse a method of estimating the poles near the unit circleT of a functionG whose values are given at a grid of points onT: we give an algorithm for performing this estimation and prove a convergence theorem. The method is to identify the phase for an estimate by considering the peaks of the absolute value ofG onT, and then to estimate the modulus by seeking a bestL ² fit toG over a small arc by a first order rational function. These pole estimates lead to the construction of a basis ofL ² which is well suited to the numerical representation of the Hankel operator with symbolG and thereby to the numerical solution of the Nehari problem (computing the bestH , analytic, approximation toG relative to theL norm), as analysed in [HY]. We present the results of numerical tests of these algorithms.Partially supported by grants from the AFOSR and NSF     

Delaunay graphs are almost as good as complete graphs

LetS be any set ofN points in the plane and let DT(S) be the graph of the Delaunay triangulation ofS. For all pointsa andb ofS, letd(a, b) be the Euclidean distance froma tob and let DT(a, b) be the length of the shortest path in DT(S) froma tob. We show that there is a constantc (≤((1+√5)/2) π≈5.08) independent ofS andN such that $$\frac{{DT(a,b)}}{{d(a,b)}}< c.$$