TY - JOUR

T1 - Stability for binary scalar products

AU - Kupavskii, Andrey

AU - Tsarev, Dmitry

PY - 2026/5/1

Y1 - 2026/5/1

N2 - Bohn, Faenza, Fiorini, Fisikopoulos, Macchia, and Pashkovich (2015) conjectured that 2-level polytopes cannot simultaneously have many vertices and many facets, namely, that the maximum of the product of the number of vertices and facets is attained on the cube and cross-polytope. This was proved in a recent work by Kupavskii and Weltge. In this paper, we resolve a strong version of the conjecture by Bohn et al., and find the maximum possible product of the number of vertices and the number of facets in a 2-level polytope that is not affinely isomorphic to the cube or the cross-polytope. To do this, we get a sharp stability result of Kupavskii and Weltge’s upper bound on A⋅ℬ for A,ℬ⊆Rd with a property that ∀a∈A,b∈ℬ the scalar product 〈a,b〉∈{0,1}.

AB - Bohn, Faenza, Fiorini, Fisikopoulos, Macchia, and Pashkovich (2015) conjectured that 2-level polytopes cannot simultaneously have many vertices and many facets, namely, that the maximum of the product of the number of vertices and facets is attained on the cube and cross-polytope. This was proved in a recent work by Kupavskii and Weltge. In this paper, we resolve a strong version of the conjecture by Bohn et al., and find the maximum possible product of the number of vertices and the number of facets in a 2-level polytope that is not affinely isomorphic to the cube or the cross-polytope. To do this, we get a sharp stability result of Kupavskii and Weltge’s upper bound on A⋅ℬ for A,ℬ⊆Rd with a property that ∀a∈A,b∈ℬ the scalar product 〈a,b〉∈{0,1}.

UR - https://www.scopus.com/pages/publications/105033505610

UR - https://www.mendeley.com/catalogue/d347f3fe-7611-32ce-aedf-4ea50bcfa374/

U2 - 10.1016/j.ejc.2026.104376

DO - 10.1016/j.ejc.2026.104376

M3 - Article

VL - 135

SP - 104376

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

ER -