G. Averkov

activity

20072026

most citedClassification of triples of lattice polytopes with a given mixed volume

11 citations · 47 across the 48 of their papers we have counts for

collaborators

Showing 2010 · math.MGShow all

3 papers · 2 filters

math.MG2010★ 1 cited

On the reconstruction of planar lattice-convex sets from the covariogram

Gennadiy Averkov, Barbara Langfeld

A finite subset $K$ of $Z^{d}$ is said to be lattice-convex if $K$ is the intersection of $Z^{d}$ with a convex set. The covariogram $g_{K}$ of $K\subseteq \mathbb{Z}^d…

math.MG2010★ 1 cited

Inequalities for the lattice width of lattice-free convex sets in the plane

Gennadiy Averkov, Christian Wagner

A closed, convex set $K$ in $R^{2}$ with non-empty interior is called lattice-free if the interior of $K$ is disjoint with $Z^{2}$ . In this paper we study the relatio…

math.MG2010

Description of polygonal regions by polynomials of bounded degree

Gennadiy Averkov, Christian Bey

We show that every (possibly unbounded) convex polygon $P$ in $R^{2}$ with $m$ edges can be represented by inequalities $p_{1} \geq 0, ..., p_{n} \geq 0,$ where the $p_{i}$ 's are products of a…