The value function of an integer program

We consider integer programs in which the objective function and constraint matrix are fixed while the right-hand side varies. The value function gives, for each feasible right-hand side, the criterion value of the optimal solution. We provide a precise characterization of the closed-form expression for any value function. The class of Gomory functions consists of those functions constructed from linear functions by taking maximums, sums, non-negative multiples, and ceiling (i.e., next highest integer) operations. The class of Gomory functions is identified with the class of all possible value functions by the following results: (1) for any Gomory functiong, there is an integer program which is feasible for all integer vectorsv and hasg as value function; (2) for any integer program, there is a Gomory functiong which is the value function for that program (for all feasible right-hand sides); (3) for any integer program there is a Gomory functionf such thatf(v)≤0 if and only ifv is a feasible right-hand side. Applications of (1)–(3) are also given.     

n-step mingling inequalities: new facets for the mixed-integer knapsack set

The n-step mixed integer rounding (MIR) inequalities of Kianfar and Fathi (Math Program 120(2):313–346, 2009) are valid inequalities for the mixed-integer knapsack set that are derived by using periodic n-step MIR functions and define facets for group problems. The mingling and 2-step mingling inequalities of Atamtürk and Günlük (Math Program 123(2):315–338, 2010) are also derived based on MIR and they incorporate upper bounds on the integer variables. It has been shown that these inequalities are facet-defining for the mixed integer knapsack set under certain conditions and generalize several well-known valid inequalities. In this paper, we introduce new classes of valid inequalities for the mixed-integer knapsack set with bounded integer variables, which we call n-step mingling inequalities (for positive integer n). These inequalities incorporate upper bounds on integer variables into n-step MIR and, therefore, unify the concepts of n-step MIR and mingling in a single class of inequalities. Furthermore, we show that for each n, the n-step mingling inequality defines a facet for the mixed integer knapsack set under certain conditions. For n?=?2, we extend the results of Atamtürk and Günlük on facet-defining properties of 2-step mingling inequalities. For n ≥ 3, we present new facets for the mixed integer knapsack set. As a special case we also derive conditions under which the n-step MIR inequalities define facets for the mixed integer knapsack set. In addition, we show that n-step mingling can be used to generate new valid inequalities and facets based on covers and packs defined for mixed integer knapsack sets.     

Factorization of singular integer matrices

It is well known that a singular integer matrix can be factorized into a product of integer idempotent matrices. In this paper, we prove that every n  × n (n > 2) singular integer matrix can be written as a product of 3n + 1 integer idempotent matrices. This theorem has some application in the field of synthesizing VLSI arrays and systolic arrays.     

On powers associated with Sierpiński numbers, Riesel numbers and Polignac's conjecture

We address conjectures of P. Erd?s and conjectures of Y.-G. Chen concerning the numbers in the title. We obtain a variety of related results, including a new smallest positive integer that is simultaneously a Sierpiński number and a Riesel number and a proof that for every positive integer r, there is an integer k such that the numbers k,k²,k³,…,kr are simultaneously Sierpiński numbers.     

Large non-planar graphs and an application to crossing-critical graphs

We prove that, for every positive integer k, there is an integer N such that every 4-connected non-planar graph with at least N vertices has a minor isomorphic to K4,k, the graph obtained from a cycle of length 2k+1 by adding an edge joining every pair of vertices at distance exactly k, or the graph obtained from a cycle of length k by adding two vertices adjacent to each other and to every vertex on the cycle. We also prove a version of this for subdivisions rather than minors, and relax the connectivity to allow 3-cuts with one side planar and of bounded size. We deduce that for every integer k there are only finitely many 3-connected 2-crossing-critical graphs with no subdivision isomorphic to the graph obtained from a cycle of length 2k by joining all pairs of diagonally opposite vertices.     

Diophantine equations and class numbers

The goals of this paper are to provide: (1) sufficient conditions, based on the solvability of certain diophantine equations, for the non-triviality of the class numbers of certain real quadratic fields; (2) sufficient conditions for the divisibility of the class numbers of certain imaginary quadratic fields by a given integer; and (3) necessary and sufficient conditions for an algebraic integer (which is not a unit) to be the norm of an algebraic integer in a given extension of number fields.     

n-Fold integer programming in cubic time

n-Fold integer programming is a fundamental problem with a variety of natural applications in operations research and statistics. Moreover, it is universal and provides a new, variable-dimension, parametrization of all of integer programming. The fastest algorithm for n-fold integer programming predating the present article runs in time ${O \left(n^{g(A)}L\right)}$ with L the binary length of the numerical part of the input and g(A) the so-called Graver complexity of the bimatrix A defining the system. In this article we provide a drastic improvement and establish an algorithm which runs in time O (n ³ L) having cubic dependency on n regardless of the bimatrix A. Our algorithm works for separable convex piecewise affine objectives as well. Moreover, it can be used to define a hierarchy of approximations for any integer programming problem.     

On the Casson invariant of homology 3-spheres of Mazur type

We compute the Casson invariant for some integral homology 3-spheres. We also show that for every integer n, there exists an integral homology 3-sphere of Mazur type with the Casson invariant 2n.     

On the fractional parts of the natural powers of a fixed number

Let ξ ≠ = 0 and α > 1 be reals. We prove that the fractional parts {ξ αⁿ}, n = 1, 2, 3, ..., take every value only finitely many times except for the case when α is the root of an integer: α = q ^1/d, where q ≥ 2 and d ≥ 1 are integers and ξ is a rational factor of a nonnegative integer power of α.     

When is rounding allowed in integer nonlinear optimization?

In this paper we consider nonlinear integer optimization problems. Nonlinear integer programming has mainly been studied for special classes, such as convex and concave objective functions and polyhedral constraints. In this paper we follow an other approach which is not based on convexity or concavity. Studying geometric properties of the level sets and the feasible region, we identify cases in which an integer minimizer of a nonlinear program can be found by rounding (up or down) the coordinates of a solution to its continuous relaxation. We call this property rounding property. If it is satisfied, it enables us (for fixed dimension) to solve an integer programming problem in the same time complexity as its continuous relaxation. We also investigate the strong rounding property which allows rounding a solution to the continuous relaxation to the next integer solution and in turn yields that the integer version can be solved in the same time complexity as its continuous relaxation for arbitrary dimensions.     

On the cyclotomic polynomial

For a given positive integer m and an algebraic number field K necessary and sufficient conditions for the mth cyclotomic polynomial to have K-integral solutions modulo a given integer of K are given. Among applications thereof are: that the solvability of the cyclotomic polynomial mod an integer yields information about the class number of related number fields; and about representation of integers by binary quadratic forms. The latter extends previous work of the author. Moreover some information is obtained pertaining to when an integer of K is the norm of an integer in a given quadratic extension of K. Finally an explicit determination of the pqth cyclotomic polynomial for distinct primes p and q is provided, and known results in the literature as well as generalizations thereof are obtained.     

More on planar point subsets with a specified number of interior points

An interior point of a finite planar point set is a point of the set that is not on the boundary of the convex hull of the set. For any integer k ≥ 1, let g(k) be the smallest integer such that every set P of points in the plane with no three collinear points and with at least g(k) interior points has a subset containing precisely k interior point of P. We prove that g(k) ≥ 3k for k ≥ 3, which improves the known result that g(k) ≥ 3k ? 1 for k ≥ 3.     

Total dual integrality and integer polyhedra

A linear system Ax ? b (A, b rational) is said to be totally dual integral (TDI) if for any integer objective function c such that max {cx: Ax ? b} exists, there is an integer optimum dual solution. We show that if P is a polytope all of whose vertices are integer valued, then it is the solution set of a TDI system Ax ? b where b is integer valued. This was shown by Edmonds and Giles [4] to be a sufficient condition for a polytope to have integer vertices.     

Generalization and application of the Eisenstein reciprocity law

A generalization of the Eisenstein reciprocity law is obtained and applied to give a short proof that if N is odd, then any integer congruent to the Nth power of an integer modulo p for almost every prime p is the Nth power of some integer.     

Disjoint factors of diameter two in complete graphs

Let f(k) be the least positive integer n such that the complete graph with n vertices has a decomposition into k factors of diameter two. It is well known that f(2) = 5, f(3) = 12 or 13, and 4k ?1 ? f(k) ? 7k for every integer k ? 4. In the present paper it is proved that 6k ? 52 ? f(k) ? 6k for every integer k ? 2. (For k ? 370 also a better lower estimate of f(k) is given.)     

Existence of generalized Latin squares which are not embeddable in any group

Let n be a positive integer. A generalized Latin square of order n is an \(n\times n\) matrix such that the elements in each row and each column are distinct. In this paper, we show that for any integer \(n\ge 6\) and any integer m where \(m\in \left\{ n, n+1, \dots , \frac{n(n+1)}{2}-2\right\} \), there exists a commutative generalized Latin square of order n with m distinct elements which is not embeddable in any group. In addition, we show that for any integer \(r\ge 3\) and any integer s where \(s\in \{ r, r+1, \dots , r^2-2\}\), there exists a non-commutative generalized Latin square of order r with s distinct elements which is not embeddable in any group.     

On t-branch split cuts for mixed-integer programs

In this paper we study the t-branch split cuts introduced by Li and Richard (Discret Optim 5:724–734, 2008). They presented a family of mixed-integer programs with n integer variables and a single continuous variable and conjectured that the convex hull of integer solutions for any n has unbounded rank with respect to (n?1)-branch split cuts. It was shown earlier by Cook et al. (Math Program 47:155–174, 1990) that this conjecture is true when n = 2, and Li and Richard proved the conjecture when n = 3. In this paper we show that this conjecture is also true for all n > 3.     

On the integrality of an extreme solution to pluperfect graph and balanced systems

Let A be a nonnegative integer matrix, and let e denote the vector all of whose components are equal to 1. The pluperfect graph theorem states that if for all integer vectors b the optimal objective value of the linear program minse′xvbAx ? b, x ? 0 s is integer, then those linear programs possess optimal integer solutions. We strengthen this theorem and show that any lexicomaximal optimal solution to the above linear program (under any arbitrary ordering of the variables) is integral and an extreme point of sxvbAx ? b, x ? 0 s. We note that this extremality property of integer solutions is also shared by covering as well as packing problems defined by a balanced matrix A.