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     

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     

Non-local approximation of the Mumford-Shah functional

The Mumford-Shah functional, introduced to study image segmentation problems, is approximated in the sense of -convergence by a sequence of non-local integral functionals. Received June 6, 1996 / Accepted July 11, 1996     

U-statistics in danach spaces

U-statistics in Banach spaces are considered and thoroughly investigated. The martingale structure, estimates of moments, the law of large numbers, the central limit theorem, the invariance principle, estimates of the rate of convergence, and large deviations are established     

An analytic approach for the analysis of rotations in fringe-balanced binary search trees

This paper presents an analytic approach to the construction cost of fringe-balanced binary search trees. In [7], Mahmoud used a bottom-up approach and an urn model of Pólya. The present method is top-down and uses differential equations and Hwang's quasi-power theorem to derive the asymptotic normality of the number of rotations needed to construct such afringe balanced search tree. We also obtain the exact expectation and variance with this method. Although Pólya's urn model is no longer needed, we also present an elegant analysis of it based on an operator calculus as in [4].This research was supported by the Austrian Research Society (FWF) under the project number P12599-MAT.