Ingo Stallknecht

activity

20202022

{a, b, c}

-Modular Matrices

5 citations · 7 across the 4 of their papers we have counts for

collaborators

4 papers

math.OC2022

On the column number and forbidden submatrices for $Δ$ -modular matrices

Joseph Paat, Ingo Stallknecht, Zach Walsh +1

An integer matrix $A$ is $Δ$ -modular if the determinant of each $rank (A) \times rank (A)$ submatrix of $A$ has absolute value at mo…

math.OC2021★ 5 cited

Notes on ${a, b, c}$ -Modular Matrices

Christoph Glanzer, Ingo Stallknecht, Robert Weismantel

Let $A \in Z^{m \times n}$ be an integral matrix and $a$ , $b$ , $c \in Z$ satisfy $a \geq b \geq c \geq 0$ . The question is to recognize whether $A$ is ${a, b, c}$ …

math.OC2021★ 1 cited

Polynomial upper bounds on the number of differing columns of $Δ$ -modular integer programs

Jon Lee, Joseph Paat, Ingo Stallknecht +1

We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showe…

math.OC2020★ 1 cited

Improving proximity bounds using sparsity

Jon Lee, Joseph Paat, Ingo Stallknecht +1

We refer to the distance between optimal solutions of integer programs and their linear relaxations as proximity. In 2018, Eisenbrand and Weismantel proved that proximity is indepe…

On the column number and forbidden submatrices for Δ-modular matrices

Notes on {a,b,c}-Modular Matrices

Polynomial upper bounds on the number of differing columns of Δ-modular integer programs

Improving proximity bounds using sparsity

On the column number and forbidden submatrices for $Δ$ -modular matrices

Notes on ${a, b, c}$ -Modular Matrices

Polynomial upper bounds on the number of differing columns of $Δ$ -modular integer programs