We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov
Abstract. In the course of their work on Salem numbers and uniform distribution modulo 1, A. Akiyama and Y. Tanigawa proved some inequalities concerning the values of the Bessel fu...
In this paper we present a polynomial-time procedure to find a low rank solution for a system of Linear Matrix Inequalities (LMI). The existence of such a low rank solution was sh...
The Integral-Inequality Method is a new way of tackling the delay-dependent stabilization problem for a linear system with time-varying state and input delays: x(t) = Ax(t) + A1x(...