Light on the Infinite Group Relaxation

This is a survey on the infinite group problem, an infinite-dimensional relaxation of integer linear optimization problems introduced by Ralph Gomory and Ellis Johnson in their groundbreaking papers titled "Some continuous functions related to corner polyhedra I, II" [Math. Programming 3 (1972), 23-85, 359-389]. The survey presents the infinite group problem in the modern context of cut generating functions. It focuses on the recent developments, such as algorithms for testing extremality and breakthroughs for the k-row problem for general k >= 1 that extend previous work on the single-row and two-row problems. The survey also includes some previously unpublished results; among other things, it unveils piecewise linear extreme functions with more than four different slopes. An interactive companion program, implemented in the open-source computer algebra package Sage, provides an updated compendium of known extreme functions.Comment: 45 page

The structure of the infinite models in integer programming

The infinite models in integer programming can be described as the convex hull of some points or as the intersection of halfspaces derived from valid functions. In this paper we study the relationships between these two descriptions. Our results have implications for corner polyhedra. One consequence is that nonnegative, continuous valid functions suffice to describe corner polyhedra (with or without rational data)

Geometric entropy, area, and strong subadditivity

The trace over the degrees of freedom located in a subset of the space transforms the vacuum state into a density matrix with non zero entropy. This geometric entropy is believed to be deeply related to the entropy of black holes. Indeed, previous calculations in the context of quantum field theory, where the result is actually ultraviolet divergent, have shown that the geometric entropy is proportional to the area for a very special type of subsets. In this work we show that the area law follows in general from simple considerations based on quantum mechanics and relativity. An essential ingredient of our approach is the strong subadditive property of the quantum mechanical entropy.Comment: Published versio

Consequences of local gauge symmetry in empirical tight-binding theory

A method for incorporating electromagnetic fields into empirical tight-binding theory is derived from the principle of local gauge symmetry. Gauge invariance is shown to be incompatible with empirical tight-binding theory unless a representation exists in which the coordinate operator is diagonal. The present approach takes this basis as fundamental and uses group theory to construct symmetrized linear combinations of discrete coordinate eigenkets. This produces orthogonal atomic-like "orbitals" that may be used as a tight-binding basis. The coordinate matrix in the latter basis includes intra-atomic matrix elements between different orbitals on the same atom. Lattice gauge theory is then used to define discrete electromagnetic fields and their interaction with electrons. Local gauge symmetry is shown to impose strong restrictions limiting the range of the Hamiltonian in the coordinate basis. The theory is applied to the semiconductors Ge and Si, for which it is shown that a basis of 15 orbitals per atom provides a satisfactory description of the valence bands and the lowest conduction bands. Calculations of the dielectric function demonstrate that this model yields an accurate joint density of states, but underestimates the oscillator strength by about 20% in comparison to a nonlocal empirical pseudopotential calculation.Comment: 23 pages, 7 figures, RevTeX4; submitted to Phys. Rev.

Approximation of corner polyhedra with families of intersection cuts

We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets in $\mathbb{R}^n$. In particular, we look at the problem of characterizing families that approximate the corner polyhedron up to a constant factor, which depends only on $n$ and not the data or dimension of the corner polyhedron. The literature already contains several results in this direction. In this paper, we use the maximum number of facets of lattice-free sets in a family as a measure of its complexity and precisely characterize the level of complexity of a family required for constant factor approximations. As one of the main results, we show that, for each natural number $n$, a corner polyhedron with $n$ basic integer variables and an arbitrary number of continuous non-basic variables is approximated up to a constant factor by intersection cuts from lattice-free sets with at most $i$ facets if $i> 2^{n-1}$ and that no such approximation is possible if $i \leq 2^{n-1}$. When the approximation factor is allowed to depend on the denominator of the fractional vertex of the linear relaxation of the corner polyhedron, we show that the threshold is $i > n$ versus $i \leq n$. The tools introduced for proving such results are of independent interest for studying intersection cuts

On the notions of facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem

We investigate three competing notions that generalize the notion of a facet of finite-dimensional polyhedra to the infinite-dimensional Gomory-Johnson model. These notions were known to coincide for continuous piecewise linear functions with rational breakpoints. We show that two of the notions, extreme functions and facets, coincide for the case of continuous piecewise linear functions, removing the hypothesis regarding rational breakpoints. We then separate the three notions using discontinuous examples.Comment: 18 pages, 2 figure

Analytic Regularity for Linear Elliptic Systems in Polygons and Polyhedra

We prove weighted anisotropic analytic estimates for solutions of second order elliptic boundary value problems in polyhedra. The weighted analytic classes which we use are the same as those introduced by Guo in 1993 in view of establishing exponential convergence for hp finite element methods in polyhedra. We first give a simple proof of the known weighted analytic regularity in a polygon, relying on a new formulation of elliptic a priori estimates in smooth domains with analytic control of derivatives. The technique is based on dyadic partitions near the corners. This technique can successfully be extended to polyhedra, providing isotropic analytic regularity. This is not optimal, because it does not take advantage of the full regularity along the edges. We combine it with a nested open set technique to obtain the desired three-dimensional anisotropic analytic regularity result. Our proofs are global and do not require the analysis of singular functions.Comment: 54 page