We study the positive Bergman complex B+ (M) of an oriented matroid M, which is a certain subcomplex of the Bergman complex B(M) of the underlying unoriented matroid M. The positiv...
Federico Ardila, Caroline J. Klivans, Lauren Willi...
Abstract. We prove a general theorem on semigroup functions that implies characterizations of graph partition functions in terms of the positive semidefiniteness (`reflection posit...
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
We present a method that automatically partitions a single image into non-overlapping regions coherent in texture and colour. An assumption that each textured or coloured region ca...
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...