Gennadiy Averkov

collaborators

2 papers

cs.DM2026

The relaxation complexity of the standard simplex is logarithmic

Gennadiy Averkov, Simon Keil, Stefan Weltge

For a set $X$ of integer points, the relaxation complexity $rc (X)$ is the smallest number of facets of any polyhedron $P$ such that $P \cap Z^{d} = X$ . In thi…

math.CO2021

On the Maximal Number of Columns of a $Δ$ -modular Integer Matrix: Bounds and Computations

Gennadiy Averkov, Matthias Schymura

We study the maximal number of pairwise distinct columns in a $Δ$ -modular integer matrix with $m$ rows. Recent results by Lee et al. provide an asymptotically tight upper bound of…

The relaxation complexity of the standard simplex is logarithmic

On the Maximal Number of Columns of a Δ-modular Integer Matrix: Bounds and Computations

On the Maximal Number of Columns of a $Δ$ -modular Integer Matrix: Bounds and Computations