Polynomial Bounds in Koldobsky's Discrete Slicing Problem

Abstract: In 2013, Koldobsky posed the problem to find a constant

d_{n}

, depending only on the dimension

n

, such that for any origin-symmetric convex body

K s u b s e t m a t h b b R^{n}

there exists an

(n - 1)

dimensional linear subspace

H s u b s e t m a t h b b R^{n}

with [ |Kcapmathbb{Z}^n| leq d_n,|Kcap Hcap mathbb{Z}^n|,mathrm{vol}(K)^{frac 1n}. ] In this article we show that

d_{n}

is bounded from above by

c, n^{2}, o m e g a (n)

, where

c

is an absolute constant and

o m e g a (n)

is the flatness constant. Due to the best known upper bound on

o m e g a (n)

this gives a

c, n^{10 / 3} l o g (n)^{a}

bound on

d_{n}

where

a

is another absolute constant. This bound improves on former bounds which were exponential in the dimension.

This page was built for publication: Polynomial Bounds in Koldobsky's Discrete Slicing Problem