On regularization of plurisubharmonic functions on manifolds

We study the question of when a -plurisubharmonic function on a complex manifold, where is a fixed -form, can be approximated by a decreasing sequence of smooth -plurisubharmonic functions. We show in particular that it is always possible in the compact Kähler case.

     

A note on almost kähler manifolds

For anyn ≥ 2, we give examples of almost Kähler conformally flat manifoldsM ²ⁿ which are not Kähler. We discuss the meaning of these examples in the context of the Goldberg conjecture on almost Kahler manifolds.     

Limit distributions and one-parameter groups of linear operators on Banach spaces

Let = {U_t: t > 0} be a strongly continuous one-parameter group of operators on a Banach space X and Q be any subset of a set (X) of all probability measures on X. By (Q; ) we denote the class of all limit measures of {U_tn(μ₁ * μ₂*…*μ_n)*δ_xn}, where {μ_n}Q, {x_n}X and measures U_tnμ_j (j=1, 2,…, n; N=1, 2,…) form an infinitesimal triangular array. We define classes L_m( ) as follows: L₀( )= ( (X); ), L_m( )= (L_m−1( ); ) for m=1, 2,… and L_∞( )=_m=0^∞L_m( ). These classes are analogous to those defined earlier by Urbanik on the real line. Probability distributions from L_m( ), m=0, 1, 2,…, ∞, are described in terms of their characteristic functionals and their generalized Poisson exponents and Gaussian covariance operators.     

An algebraic formula for the intersection number of a polynomial immersion

An algorithm is presented for computing the topological degree for a large class of polynomial mappings. As an application there is given an effective algebraic formula for the intersection number of a polynomial immersion M→R^2m, where M is an m-dimensional algebraic manifold.     

Cardinality of the set of extreme extensions¶of a quasi-measure

Cardinals that arise as the number of extreme quasi-measure extensions of a quasi-measure [resp., measure] μ defined on an algebra [resp., σ-algebra] of sets to a larger algebra [resp., σ-algebra] of sets are characterized in the general case as well as under some natural assumptions on μ. Received: 19 September 2000     

Linear Automorphisms that are Symplectomorphisms

Let K be the field of real or complex numbers. Let (X K²ⁿ,) be a symplectic vector space and take 0 < k < n,N =. Let L₁,...,L_N X be 2k-dimensionallinear subspaces which are in a sufficiently general position.It is shown that if F : X X is a linear automorphism whichpreserves the form ^k on all subspaces L₁,...,L_N, then F is an_k-symplectomorphism (that is, F^* = _k, where ). In particular, if K = R and k is odd then F mustbe a symplectomorphism. The unitary version of this theoremis proved as well. It is also observed that the set A_l,2r ofall l-dimensional linear subspaces on which the form has rank 2r is linear in the Grassmannian G(l,2n), that is, there isa linear subspace L such that A_l,2r = L G(l, 2n). In particular,the set A_l,2r can be computed effectively. Finally, the notionof symplectic volume is introduced and it is proved that itis another strong invariant.     

On the definition of the Monge-Ampère operator in ℂ<Superscript>2</Superscript>

We show that if u is a plurisubharmonic function defined on an open subset of ² then the Monge-Ampère measure (dd^cu)² can be well defined if and only if u belongs to the Sobolev space W^1,2_loc().Partially supported by KBN Grant #2 P03A 028 19     

Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start

We study Lanczos and polynomial algorithms with random start for estimating an eigenvector corresponding to the largest eigenvalue of an n × n large symmetric positive definite matrix. We analyze the two error criteria: the randomized error and the randomized residual error. For the randomized error, we prove that it is not possible to get distribution-free bounds, i.e., the bounds must depend on the distribution of eigenvalues of the matrix. We supply such bounds and show that they depend on the ratio of the two largest eigenvalues. For the randomized residual error, distribution-free bounds exist and are provided in the paper. We also provide asymptotic bounds, as well as bounds depending on the ratio of the two largest eigenvalues. The bounds for the Lanczos algorithm may be helpful in a practical implementation and termination of this algorithm. © 1998 John Wiley & Sons, Ltd.     

Product numerical range in a space with tensor product structure

We study operators acting on a tensor product Hilbert space and investigate their product numerical range, product numerical radius and separable numerical range. Concrete bounds for the product numerical range for Hermitian operators are derived. Product numerical range of a non-Hermitian operator forms a subset of the standard numerical range containing the barycenter of the spectrum. While the latter set is convex, the product range needs not to be convex nor simply connected. The product numerical range of a tensor product is equal to the Minkowski product of numerical ranges of individual factors.