On mean approximation by polynomials with gaps on Caratheodory sets

The paper presents some new results on the possibility of approximation by polynomials with gaps. The approximations are done in the norm of the space L _p , 1 ≤ p < + ∞, on the Caratheodory sets in the complex plane. The lacunary versions of some results by Farell—Markushevich, S. Sinanian, A. L. Shahinian are obtained (Theorems 1, 3, 5). Similar approximations by the real parts of lacunary polynomials are given (Theorems 2, 4, 6). Dedicated to the memory of academician S. N. Mergelyan     

An application of Newton–Puiseux charts to the Jacobian problem

We study 2-dimensional Jacobian maps using so-called Newton–Puiseux charts. These are multi-valued coordinates near divisors of resolutions of indeterminacies at infinity of the Jacobian map in the source space as well as in the target space. The map expressed in these charts takes a very simple form, which allows us to detect a series of new analytical and topological properties. We prove that the Jacobian Conjecture holds true for maps (f,g) whose topological degree is ≤5, for maps with gcd(degf,degg)≤16 and for maps with. gcd(degf,degg) equal to 2 times a prime.     

Uniformly attracting solutions of nonautonomous differential equations

Understanding the structure of attractors is fundamental in nonautonomous stability and bifurcation theory. By means of clarifying theorems and carefully designed examples we highlight the potential complexity of attractors for nonautonomous differential equations that are as close to autonomous equations as possible. We introduce and study bounded uniform attractors and repellors for nonautonomous scalar differential equations, in particular for asymptotically autonomous, polynomial, and periodic equations. Our results suggest that uniformly attracting or repelling solutions are the true analogues of attracting or repelling fixed points of autonomous systems. We provide sharp conditions for the autonomous structure to break up and give way to a bewildering diversity of nonautonomous bifurcations.     

Noise suppresses exponential growth under regime switching

Consider a given system under regime switching whose solution grows exponentially, and suppose that the system is subject to environmental noise in some regimes. Can the regime switching and the environmental noise work together to make the system change significantly? The answer is yes. In this paper, we will show that the regime switching and the environmental noise will make the original system whose solution grows exponentially become a new system whose solutions will grow at most polynomially. In other words, we reveal that the regime switching and the environmental noise will suppress the exponential growth.     

Sums of characteristic values of compact polynomial operator pencils

We consider polynomial pencils whose coefficients are compact operators. Bounds for the sums of absolute values, real and imaginary parts of characteristic values are derived. Applications to differential and difference equations are discussed.     

Polynomial chaos representation of spatio-temporal random fields from experimental measurements

Two numerical techniques are proposed to construct a polynomial chaos (PC) representation of an arbitrary second-order random vector. In the first approach, a PC representation is constructed by matching a target joint probability density function (pdf) based on sequential conditioning (a sequence of conditional probability relations) in conjunction with the Rosenblatt transformation. In the second approach, the PC representation is obtained by having recourse to the Rosenblatt transformation and simultaneously matching a set of target marginal pdfs and target Spearman’s rank correlation coefficient (SRCC) matrix. Both techniques are applied to model an experimental spatio-temporal data set, exhibiting strong non-stationary and non-Gaussian features. The data consists of a set of oceanographic temperature records obtained from a shallow-water acoustics transmission experiment [1]. The measurement data, observed over a finite denumerable subset of the indexing set of the random process, is treated as a collection of observed samples of a second-order random vector that can be treated as a finite-dimensional approximation of the original random field. A set of properly ordered conditional pdfs, that uniquely characterizes the target joint pdf, in the first approach and a set of target marginal pdfs and a target SRCC matrix, in the second approach, are estimated from available experimental data. Digital realizations sampled from the constructed PC representations based on both schemes capture the observed statistical characteristics of the experimental data with sufficient accuracy. The relative advantages and disadvantages of the two proposed techniques are also highlighted.     

关于有向网络容量扩充问题

提出了有向网络最大容量的两种计算方法,将杨超等人（1998）的无向网络容量扩充问题,扩展到约束条件含固定费用的有向网络的扩充,并给出了强多项式算法。     

Power linear Keller maps of dimension three

In this paper it is proved that a power linear Keller map of dimension three over a field of characteristic zero is linearly triangularizable.

     

A computational comparison of the first nine members of a determinantal family of root-finding methods

For each natural number m greater than one, and each natural number k less than or equal to m, there exists a root-finding iteration function, B_m^(k) defined as the ratio of two determinants that depend on the first m−k derivatives of the given function. This infinite family is derived in Kalantari (J. Comput. Appl. Math. 126 (2000) 287–318) and its order of convergence is analyzed in Kalantari (BIT 39 (1999) 96–109). In this paper we give a computational study of the first nine root-finding methods. These include Newton, secant, and Halley methods. Our computational results with polynomials of degree up to 30 reveal that for small degree polynomials B_m^(k−1) is more efficient than B_m^(k), but as the degree increases, B_m^(k) becomes more efficient than B_m^(k−1). The most efficient of the nine methods is B₄⁽⁴⁾, having theoretical order of convergence equal to 1.927. Newton's method which is often viewed as the method of choice is in fact the least efficient method.     

三角矩阵代数的倾斜模

设R=（^A 0 ^M B）是三角矩阵代数,关于倾斜A-模T1,倾斜B-模T2何时能扩充为倾斜R-模的问题已有讨论．本文考察了倾斜R-模在Cokernel函子下是否还是倾斜模的问题．得到了如下结论：如果（X,Y,f）是倾斜R-模,f是单射,则Cok（y）中倾斜B-模．从而给出了单点扩张代数的倾斜模的结构．