2 papers
math.FA2005
Positive definite kernels and lattice paths
T. Constantinescu, Nermine El-Sissi
We discuss the structure of positive definite kernels in terms of operator models. In particular, we introduce two models, one of Hessenberg type and another one that we call near…
math.CO2003
Research problem: The completion number of a graph
M. Bakonyi, T. Constantinescu
Motivated by the remarkable interplay between (chordal) graphs and matrix algebra, we associate to each graph a so-called completion number that might encode some aspects of that i…