An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one ma...
The set system of all arithmetic progressions on [n] is known to have a discrepancy of order n1/4. We investigate the discrepancy for the set system S3 n formed by all sums of thr...
All the methods for estimating the fundamental matrix do not naturally exploit the rank-2 constraint. For these reason some few rank-2 parameterizations of the fundamental matrix ...
In this paper parallel universes are defined by their relation to multi-criteria optimization combined with an explicit or implicit link for the unambiguous identification of an ...
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ...