arXiv subjects

F. Vallentin

Publications and source records attributed to F. Vallentin.

3 recordsLinked to original sources

arXiv2008

Block-diagonal semidefinite programming hierarchies for 0/1 programming

Lovasz and Schrijver, and later Lasserre, proposed hierarchies of semidefinite programming relaxations for general 0/1 linear programming problems. In this paper these two constructions are revisited and two new, block-diagonal hierarchies are proposed. They have the advantage of being computationally less costly while being at least as strong as the Lovasz-Schrijver hierarchy. Our construction is applied to the stable set problem and experimental results for Paley graphs are reported.

math.OC↗

arXiv2007

The isodiametric problem with lattice-point constraints

In this paper, the isodiametric problem for centrally symmetric convex bodies in the Euclidean d-space R^d containing no interior non-zero point of a lattice L is studied. It is shown that the intersection of a suitable ball with the Dirichlet-Voronoi cell of 2L is extremal, i.e., it has minimum diameter among all bodies with the same volume. It is conjectured that these sets are the only extremal bodies, which is proved for all three dimensional and several prominent lattices.

math.MG↗

arXiv2005

Lattice Delone simplices with super-exponential volume

In this short note we give a construction of an infinite series of Delone simplices whose relative volume grows super-exponentially with their dimension. This dramatically improves the previous best lower bound, which was linear.

math.CO↗