Parameterization of all solutions of the three chains completion problem

The family of all solutions of the three chains completion problem with a prescribed tolerance is described explicitly. It is shown that this family can be parameterized by a natural set of contractive upper triangular operators. As an application all solutions to a suboptimal nonstationary Nehari problem are described.     

Algebraic fermion bosonization

By exploiting the construction of charged field algebras as canonical extensions of CCR current algebras in 1+1 dimensions and nonregular representations of extended algebras, we provide an algebraic construction of local Fermi fields as ultrastrong limits of bosonic variables in all representations which are locally Fock with respect to the ground-state representation of the massless scalar field.     

Metric marginal problems for set-valued or non-measurable variables

Summary In a separable metric space, if two Borel probability measures (laws) are nearby in a suitable metric, then there exist random variables with those laws which are nearby in probability. Specifically, by a well-known theorem of Strassen, the Prohorov distance between two laws is the infimum of Ky Fan distances of random variables with those laws. The present paper considers possible extensions of Strassen's theorem to two random elements one of which may be (compact) set-valued and/or non-measurable. There are positive results in finite-dimensional spaces, but with factors depending on the dimension. Examples show that such factors cannot entirely be avoided, so that the extension of Strassen's theorem to the present situation fails in infinite dimensions.This research was partially supported by a Guggenheim Fellowship, by National Science Foundation grant DMS 8505550 at MSRI-Berkeley, and other NSF grants     

Asymptotic Distribution of Nodes for Near-Optimal Polynomial Interpolation on Certain Curves in R 2

Let E\subset \Bbb R ^s be compact and let d _n ^E denote the dimension of the space of polynomials of degree at most n in s variables restricted to E . We introduce the notion of an asymptotic interpolation measure (AIM). Such a measure, if it exists , describes the asymptotic behavior of any scheme τ _n ={ \bf x _k,n } _k=1 ^dnE , n=1,2,\ldots , of nodes for multivariate polynomial interpolation for which the norms of the corresponding interpolation operators do not grow geometrically large with n . We demonstrate the existence of AIMs for the finite union of compact subsets of certain algebraic curves in R ² . It turns out that the theory of logarithmic potentials with external fields plays a useful role in the investigation. Furthermore, for the sets mentioned above, we give a computationally simple construction for ``good' interpolation schemes. November 9, 2000. Date revised: August 4, 2001. Date accepted: September 14, 2001.     

On hooks of Young diagrams

The well-known fact that there is always one more addable than removable box for a Young diagram is generalized to arbitrary hooks. As an application, this immediately implies a simple proof of a conjecture of Regev and Vershik [3] for which inductive proofs have recently been given by Regev and Zeilberger [4] and Janson [1].     

On a generalized $L_2$ projection and some related stability estimates in Sobolev spaces

Summary. In this paper we investigate a stability estimate needed in hybrid finite and boundary element methods, especially in hybrid coupled domain decomposition methods including mortar finite elements. This stability estimate is equivalent to the stability of a generalized projection in certain Sobolev spaces. Using piecewise linear trial spaces and appropriate piecewise constant test spaces, the stability of the generalized projection is proved assuming some mesh conditions locally. Received April 11, 2000 / Revised version received February 15, 2001 / Published online July 25, 2001     

Coupling for Markov renewal processes and the rate of convergence in ergodic theorems for processes with semi-Markov switchings

Coupling procedures for Markov renewal processes are described. Applications to ergodic theorems for processes with semi-Markov switchings are considered.This paper was partly prepared with the support of NFR Grant F-UP 10257-300.     

Asymptotics in the random assignment problem

Summary We show that, in the usual probabilistic model for the random assignment problem, the optimal cost tends to a limit constant in probability and in expectation. The method involves construction of an infinite limit structure, in terms of which the limit constant is defined. But we cannot improve on the known numerical bounds for the limit.Research supported by NSF Grant MCS90-01710