Mihály Bakonyi

The Euclidian Distance Matrix Completion Problem

Motivated by the molecular conformation problem, completions of partial Euclidian distance matrices are studied. It is proved that any partial distance matrix with a chordal graph can be completed to a distance matrix. Given any nonchordal graph

Maximum Entropy Elements in the Intersection of an AffineSpace and the Cone of Positive Definite Matrices

G

Several results on chordal bipartite graphs

, it is shown that there is a partial distance matrix

The extension of positive definite operator-valued functions defined on a symmetric interval of an ordered group

A

A remark on Nehari's problem

with graph

On the strong Parrott completion problem

G

On an Extension Problem for Polynomials

such that

On a conjecture of Collar and Sadosky on multidimensional Hankel operators

A

The intertwining lifting theorem for ordered groups

does not admit any distance matrix completions. Finally, the connection between distance matrix completions and positive semidefinite completions is outlined.

Sign pattern matrices that require domain-range pairs with given singn patterns

It is shown that for given positive definite