Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
The subresultant theory for univariate commutative polynomials is generalized to Ore polynomials. The generalization includes: the subresultant theorem, gap structure, and subresu...
Completion is a general paradigm for applying inferences to generate a canonical presentation of a logical theory, or to semi-decide the validity of theorems, or to answer queries....
We characterize T-measures on weakly generated tribes, where T is a strict triangular norm and we give a Liapunoff Theorem for these measures. This generalizes previous results ob...
We study the theory of lovely pairs of geometric structures, in particular o-minimal structures. We characterize "linear" theories in terms of properties of the correspon...