Lower bounds on the independence numbers of distance graphs with vertices in $\{-1, 0, 1\}^n$

Abstract

This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented, highlighting nontrivial relationships between the obtained bounds. Known upper bounds and their potential suboptimality are discussed separately.