We study Dedekind cuts on ordered Abelian groups. We introduce a monoid structure on them, and we characterise, via a suitable representation theorem, the universal part of the th...
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
Several analog-to-digital conversion methods for bandlimited signals used in applications, such as quantization schemes, employ coarse quantization coupled with oversampling. The...
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...