On Termination of Integer Linear Loops

A fundamental problem in program verification concerns the termination of simple linear loops of the form x := u ; while Bx >= b do {x := Ax + a} where x is a vector of variables, u, a, and c are integer vectors, and A and B are integer matrices. Assuming the matrix A is diagonalisable, we give a decision procedure for the problem of whether, for all initial integer vectors u, such a loop terminates. The correctness of our algorithm relies on sophisticated tools from algebraic and analytic number theory, Diophantine geometry, and real algebraic geometry. To the best of our knowledge, this is the first substantial advance on a 10-year-old open problem of Tiwari (2004) and Braverman (2006).Comment: Accepted to SODA1

The Polyhedron-Hitting Problem

We consider polyhedral versions of Kannan and Lipton's Orbit Problem (STOC '80 and JACM '86)---determining whether a target polyhedron V may be reached from a starting point x under repeated applications of a linear transformation A in an ambient vector space Q^m. In the context of program verification, very similar reachability questions were also considered and left open by Lee and Yannakakis in (STOC '92). We present what amounts to a complete characterisation of the decidability landscape for the Polyhedron-Hitting Problem, expressed as a function of the dimension m of the ambient space, together with the dimension of the polyhedral target V: more precisely, for each pair of dimensions, we either establish decidability, or show hardness for longstanding number-theoretic open problems

Singular hermitian metrics on vector bundles

We introduce a notion of singular hermitian metrics (s.h.m.) for holomorphic vector bundles and define positivity in view of $L^2$-estimates. Associated with a suitably positive s.h.m. there is a (coherent) sheaf 0-th kernel of a certain $d''$-complex. We prove a vanishing theorem for the cohomology of this sheaf. All this generalizes to the case of higher rank known results of Nadel for the case of line bundles. We introduce a new semi-positivity notion, $t$-nefness, for vector bundles, establish some of its basic properties and prove that on curves it coincides with ordinary nefness. We particularize the results on s.h.m. to the case of vector bundles of the form $E=F \otimes L$, where $F$ is a $t$-nef vector bundle and $L$ is a positive (in the sense of currents) line bundle. As applications we generalize to the higher rank case 1) Kawamata-Viehweg Vanishing Theorem, 2) the effective results concerning the global generation of jets for the adjoint to powers of ample line bundles, and 3) Matsusaka Big Theorem made effective.Comment: LaTex (article) 25 pages; revised: minor changes; to appear in Crelle's J; dedicated to Michael Schneide

Optimality and uniqueness of the (4,10,1/6) spherical code

Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t) spherical code. However, this method does not apply to the parameters (4,10,1/6). We use semidefinite programming bounds instead to show that the Petersen code, which consists of the midpoints of the edges of the regular simplex in dimension 4, is the unique (4,10,1/6) spherical code.Comment: 12 pages, (v2) several small changes and corrections suggested by referees, accepted in Journal of Combinatorial Theory, Series