Cut-generating functions and S-free sets

International audienceWe consider the separation problem for sets X that are pre-images of a given set S by a linear mapping. Classical examples occur in integer programming, as well as in other optimization problems such as complementarity. One would like to generate valid inequalities that cut off some point not lying in X, without reference to the linear mapping. To this aim, we introduce a concept: cut-generating functions (cgf) and we develop a formal theory for them, largely based on convex analysis. They are intimately related to S-free sets and we study this relation, disclosing several definitions for minimal cgf's and maximal S-free sets. Our work unifies and puts in perspective a number of existing works on S-free sets; in particular, we show how cgf's recover the celebrated Gomory cuts

On Minimal Valid Inequalities for Mixed Integer Conic Programs

We study disjunctive conic sets involving a general regular (closed, convex, full dimensional, and pointed) cone K such as the nonnegative orthant, the Lorentz cone or the positive semidefinite cone. In a unified framework, we introduce K-minimal inequalities and show that under mild assumptions, these inequalities together with the trivial cone-implied inequalities are sufficient to describe the convex hull. We study the properties of K-minimal inequalities by establishing algebraic necessary conditions for an inequality to be K-minimal. This characterization leads to a broader algebraically defined class of K- sublinear inequalities. We establish a close connection between K-sublinear inequalities and the support functions of sets with a particular structure. This connection results in practical ways of showing that a given inequality is K-sublinear and K-minimal. Our framework generalizes some of the results from the mixed integer linear case. It is well known that the minimal inequalities for mixed integer linear programs are generated by sublinear (positively homogeneous, subadditive and convex) functions that are also piecewise linear. This result is easily recovered by our analysis. Whenever possible we highlight the connections to the existing literature. However, our study unveils that such a cut generating function view treating the data associated with each individual variable independently is not possible in the case of general cones other than nonnegative orthant, even when the cone involved is the Lorentz cone

Combinatorial problems of (quasi-)crystallography

Several combinatorial problems of (quasi-)crystallography are reviewed with special emphasis on a unified approach, valid for both crystals and quasicrystals. In particular, we consider planar sublattices, similarity sublattices, coincidence sublattices, their module counterparts, and central and averaged shelling. The corresponding counting functions are encapsulated in Dirichlet series generating functions, with explicit results for the triangular lattice and the twelvefold symmetric shield tiling. Other combinatorial properties are briefly summarised.Comment: 12 pages, 2 PostScript figures, LaTeX using vch-book.cl

Generalized string equations for double Hurwitz numbers

The generating function of double Hurwitz numbers is known to become a tau function of the Toda hierarchy. The associated Lax and Orlov-Schulman operators turn out to satisfy a set of generalized string equations. These generalized string equations resemble those of $c = 1$ string theory except that the Orlov-Schulman operators are contained therein in an exponentiated form. These equations are derived from a set of intertwining relations for fermiom bilinears in a two-dimensional free fermion system. The intertwiner is constructed from a fermionic counterpart of the cut-and-join operator. A classical limit of these generalized string equations is also obtained. The so called Lambert curve emerges in a specialization of its solution. This seems to be another way to derive the spectral curve of the random matrix approach to Hurwitz numbers.Comment: latex2e using packages amsmath,amssymb,amsthm, 41 pages, no figure; (v2) sections are fully reorganized, a proof of hbar-expansion of the tau function is added, many typos are correcte