Searcharxiv⌕ Search

arXiv subjects

Stefan Kuhlmann

Publications and source records attributed to Stefan Kuhlmann.

12 recordsLinked to original sources

Sharp Proximity Bounds for Integer Programs with Few Rows

We study the proximity between an optimal vertex of a standard form linear program with constraint matrix $A\in\mathbb{Z}^{m\times n}$ and an optimal integer solution. When $m = 2$, we prove the sharp infinity-norm bound $Δ-1$, where $Δ$ is the largest absolute maximal minor of $A$. When $m = 1$, we express the difference between an optimal LP vertex and an optimal integer solution as a nonnegative combination of certain generators in the kernel of $A$ with a bounded coefficient sum. This implies sharp proximity bounds for all norms when $m=1$. Combining this representation with its known counterpart for Hilbert bases due to Sissokho, we develop techniques that transfer results from $m=1$ to $m=2$. Along the way, for $m=2$, we prove that such a representation exists for an extended Gomory group relaxation and obtain the sharp infinity-norm bound $Δ$ for Graver basis elements. We also present a new short proof of Sissokho's result and lower bounds on the proximity for all $m$ and $Δ$.

math.OC↗

Davenport Constants of High-Dimensional Integer Sets

The Davenport constant of a finite set of integer vectors is the maximum length of an irreducible zero-sum sequence over that set. For nonempty sets closed under negation, it equals the largest $\ell_1$-norm of a Graver basis element of the matrix formed by those vectors. We study extremal and average-case versions in growing dimension, with applications to integer programming. For integer cubes $[-R,R]^d \cap \mathbb{Z}^d$ and the sign cube $\{-1,1\}^d$, totally unimodular encodings improve on the upper bounds from direct circuit decomposition, while random perturbations of Hadamard matrices give new lower bounds. A key ingredient is a uniform affine Bernoulli variant of Nguyen and Wood's surjectivity theorem. In every sufficiently large dimension the sign-cube lower bound is $d^{d/2}2^{-d-o(d)}$, and the integer-cube lower bound is $R^d d^{d/2}2^{-o(d)}$ uniformly for polynomially bounded integer radii. For random sign-cube sequences of even length conditioned on summing to zero, we prove a sharp threshold from irreducibility to reducibility at $d\log d/\log 4$, far below the extremal scale. For fixed $p$ and $R$, we determine exact exponential rates for lattice $\ell_p$-balls when $p=1$, $R\geq3$, or $2\leq p<\infty$, $\lfloor R^p\rfloor\geq3$. For each fixed integer $k\geq3$, we determine the exponential rate of the worst-case $\ell_1$-distance from an optimal LP vertex to the nearest integer optimum in standard-form programs with ternary matrices having at most $k$ nonzero entries per column.

math.CO↗

A Threshold Number for the Shortest Vector Problem in the Infinity Norm

For an integer full column rank matrix $A$, we consider the lattice that consists of all integer combinations of columns of $A$. We prove that a shortest non-zero vector $Az$ has infinity norm equal to $1$ whenever the number of columns of $A$ is at least $Δ$, the largest absolute value of a full rank subdeterminant of $A$. This structural result allows us to design a fixed-parameter tractable algorithm in $Δ$ for computing a shortest lattice vector in the infinity norm. It also has several applications in integer optimization. In particular, for a polyhedron defined by $Ax\leq b$ with integer-valued $b$, an optimal integer solution lies on a face whose dimension is at most $Δ- 1$.

math.OC↗

IMProofBench: Benchmarking AI on Research-Level Mathematical Proof Generation

As the mathematical capabilities of large language models (LLMs) improve, it becomes increasingly important to evaluate their performance on research-level tasks at the frontier of mathematical knowledge. However, existing benchmarks are limited, as they focus solely on final-answer questions or high-school competition problems. To address this gap, we introduce IMProofBench, a private benchmark consisting of 77 peer-reviewed problems developed by expert mathematicians. Each problem requires a detailed proof and is paired with subproblems that have final answers, supporting both an evaluation by human experts and a large-scale quantitative analysis through automated grading. Furthermore, unlike prior benchmarks, the evaluation setup simulates a realistic research environment: models operate in an agentic framework with tools like web search for literature review and mathematical software such as SageMath. Our results show that current LLMs can already solve a significant percentage of research-level questions. IMProofBench will continue to evolve as a dynamic benchmark in collaboration with the mathematical community, ensuring its relevance for evaluating the next generation of LLMs.

cs.CL↗

Polynomial Matrices in Integer Programming With Restricted Subdeterminants

We introduce a framework for tackling questions in discrete optimization associated with parametric constraint matrices. More precisely, the constraint matrices have entries that are polynomials in one variable and all subdeterminants of these matrices are polynomials in a given prescribed set $S$. Two key problems arise in this context. The first is the recognition problem: can a matrix of this form be recognized in polynomial time? The second is the optimization problem: given an integer program whose constraint matrix is of this form, can it be solved in polynomial time? We answer both questions affirmatively for a particular set $S$ consisting of nine linear forms. The matrices we consider are of themselves independent interest; they arise as matrix projections of certain bimodular matrices that admit two distinct unimodular projections.

math.OC↗

Sparse Approximation in Lattices and Semigroups

This paper deals with the following question: Suppose that there exist an integer or a non-negative integer solution $x$ to a system $Ax = b$, where the number of non-zero components of $x$ is $n$. The target is, for a given natural number $k < n$, to approximate $b$ with $Ay$ where $y$ is an integer or non-negative integer solution with at most $k$ non-zero components. We establish upper bounds for this question in general. In specific cases, these bounds are tight. If we view the approximation quality as a function of the parameter $k$, then the paper explains why the quality of the approximation increases exponentially as $k$ goes to $n$. This paper is a complete version of an extended abstract that appeared at the 26th International Conference on Integer Programming and Combinatorial Optimization (IPCO).

math.OC↗

On Matrices over a Polynomial Ring with Restricted Subdeterminants

This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We investigate in particular matrices whose subdeterminants all lie in a fixed set $S\subseteq\mathbb{Z}[x]$. Such matrices, which we call totally $S$-modular matrices, are closed with respect to taking submatrices, so it is natural to look at minimally non-totally $S$-modular matrices which we call forbidden minors for $S$. Among other results, we prove that if $S$ is finite, then the set of all determinants attained by a forbidden minor for $S$ is also finite. Specializing to the integers, we subsequently obtain the following positive complexity result: the recognition problem for totally $\pm\{0,1,a,a+1,2a+1\}$-modular matrices with $a\in\mathbb{Z}\backslash\{-3,-2,1,2\}$ and the integer linear optimization problem for totally $\pm\{ 0,a,a+1,2a+1\}$-modular matrices with $a\in\mathbb{Z}\backslash\{ -2,1\}$ can be solved in polynomial time.

math.OC↗

Integer Carathéodory results with bounded multiplicity

The integer Carathéodory rank of a pointed rational cone $C$ is the smallest number $k$ such that every integer vector contained in $C$ is an integral non-negative combination of at most $k$ Hilbert basis elements. We investigate the integer Carathéodory rank of simplicial cones with respect to their multiplicity, i.e., the determinant of the integral generators of the cone. One of the main results states that simplicial cones with multiplicity bounded by five have the integral Carathéodory property, that is, the integer Carathéodory rank equals the dimension. Furthermore, we present a novel upper bound on the integer Carathéodory rank which depends on the dimension and the multiplicity. This bound improves upon the best known upper bound on the integer Carathéodory rank if the dimension exceeds the multiplicity. At last, we present special cones which have the integral Carathéodory property such as certain dual cones of Gorenstein cones.

math.CO↗

New Bounds for the Integer Carathéodory Rank

Given a rational pointed $n$-dimensional cone $C$, we study the integer Carathéodory rank $\operatorname{CR}(C)$ and its asymptotic form $\operatorname{CR^{\rm a}}(C)$, where we consider ``most'' integer vectors in the cone. The main result significantly improves the previously known upper bound for $\operatorname{CR^{\rm a}}(C)$. We also study bounds on $\operatorname{CR}(C)$ in terms of $Δ$, the maximal absolute $n\times n$ minor of the matrix given in an integral polyhedral representation of $C$. If $Δ\in\lbrace 1,2\rbrace$, we show $\operatorname{CR}(C) = n$, and prove upper bounds for simplicial cones, improving the best known upper bound on $\operatorname{CR}(C)$ for $Δ\leq n$.

math.CO↗

Proximity and flatness bounds for linear integer optimization

We develop a technique that can be applied to provide improved upper bounds for two important questions in linear integer optimization. - Proximity bounds: Given an optimal vertex solution for the linear relaxation, how far away is the nearest optimal integer solution (if one exists)? - Flatness bounds: If a polyhedron contains no integer point, what is the smallest number of integer parallel hyperplanes defined by an integral, non-zero, normal vector that intersect the polyhedron? This paper presents a link between these two questions by refining a proof technique that has been recently introduced by the authors. A key technical lemma underlying our technique concerns the areas of certain convex polygons in the plane: if a polygon $K\subseteq\mathbb{R}^2$ satisfies $τK \subseteq K^{\circ}$, where $τ$ denotes $90^{\circ}$ counterclockwise rotation and $K^{\circ}$ denotes the polar of $K$, then the area of $K^{\circ}$ is at least 3.

math.OC↗

Improving the Cook et al. Proximity Bound Given Integral Valued Constraints

Consider a linear program of the form $\max\;c^{\top}x:Ax\leq b$, where $A$ is an $m\times n$ integral matrix. In 1986 Cook, Gerards, Schrijver, and Tardos proved that, given an optimal solution $x^{*}$, if an optimal integral solution $z^{*}$ exists, then it may be chosen such that $\left\Vert x^{*}-z^{*}\right\Vert _{\infty}<nΔ$, where $Δ$ is the largest magnitude of any subdeterminant of $A$. Since then an open question has been to improve this bound, assuming that $b$ is integral valued too. In this manuscript we show that $nΔ$ can be replaced with $\frac{n}{2}\cdotΔ$ whenever $n\geq2$. We also show that, in certain circumstances, the factor $n$ can be removed entirely.

math.OC↗

On lattice width of lattice-free polyhedra and height of Hilbert bases

We study the lattice width of lattice-free polyhedra given by $\mathbf{A}\mathbf{x}\leq\mathbf{b}$ in terms of $Δ(\mathbf{A})$, the maximal $n\times n$ minor in absolute value of $\mathbf{A}\in\mathbb{Z}^{m\times n}$. Our main contribution is to link the lattice width of lattice-free polyhedra to the height of Hilbert bases and to the diameter of finite abelian groups. This leads to a bound on the lattice width of lattice-free pyramids which solely depends on $Δ(\mathbf{A})$ provided a conjecture regarding the height of Hilbert bases holds. Further, we exploit a combination of techniques to obtain novel bounds on the lattice width of simplices. A second part of the paper is devoted to a study of the above mentioned Hilbert basis conjecture. We give a complete characterization of the Hilbert basis if $Δ(\mathbf{A}) = 2$ which implies the conjecture in that case and prove its validity for simplicial cones.

math.CO↗