Kalai's 3^d-conjecture for unconditional and locally anti-blocking polytopes

08/05/2023
by   Raman Sanyal, et al.
0

Kalai's 3^d-conjecture states that every centrally symmetric d-polytope has at least 3^d faces. We give short proofs for two special cases: if P is unconditional (that is, invariant w.r.t. reflection in any coordinate hyperplane), and more generally, if P is locally anti-blocking (that is, looks like an unconditional polytope in every orthant). In both cases we show that the minimum is attained exactly for the Hanner polytopes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2023

Looms

A pair (A,B) of hypergraphs is called orthogonal if |a ∩ b|=1 for every ...
research
06/01/2018

A Bestiary of Blocking: The Motivations and Modes behind Website Unavailability

This paper examines different reasons the websites may vary in their ava...
research
08/04/2021

The Gotsman-Linial Conjecture is False

In 1991, Craig Gotsman and Nathan Linial conjectured that for all n and ...
research
02/20/2021

Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle

The k-server conjecture, first posed by Manasse, McGeoch and Sleator in ...
research
07/30/2020

On Representing (Anti)Symmetric Functions

Permutation-invariant, -equivariant, and -covariant functions and anti-s...
research
07/16/2022

A family of counterexamples for a conjecture of Berge on α-diperfect digraphs

Let D be a digraph. A stable set S of D and a path partition 𝒫 of D are ...
research
01/26/2020

Block the blocker: Studying the effects of Anti Ad-blocking

Advertisements generate huge chunks of revenues for websites and online ...

Please sign up or login with your details

Forgot password? Click here to reset