An optimal generalization of Alon and Füredi's covering result

07/27/2022
by   Arijit Ghosh, et al.
0

Given an n-cube 𝒬^n := {0,1}^n in ℝ^n, the k-th layer 𝒬^n_k of 𝒬^n denotes the set of all points in 𝒬^n whose coordinates contain exactly k many ones. In this short note, we consider the following problem: what is the minimum number of hyperplanes in ℝ^n required to cover every point in 𝒬^n∖𝒬^n_k at least t times and the points in 𝒬^n_k exactly (t-1) times? We prove that the answer to the above question is max{ k, n-k}+2t-2. Note that by putting k = 0 and t=1, we recover the much celebrated combinatorial geometry result of Alon and Füredi (European Journal of Combinatorics 1993) where they proved that the minimum number of hyperplanes required to cover every point of n-cube except the origin is n. We also study a new interesting variant of restricted sumset problem motivated from the ideas behind the proof of the above result.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/04/2021

Covering Polygons is Even Harder

In the MINIMUM CONVEX COVER (MCC) problem, we are given a simple polygon...
research
06/08/2018

The Saturated Subpaths Decomposition in Z 2 : a short note on generalized Tangential Cover

In this short note, we generalized the Tangential Cover used in Digital ...
research
06/08/2017

Mobile vs. point guards

We study the problem of guarding orthogonal art galleries with horizonta...
research
11/11/2022

Peeling Sequences

Given an n-element point set in the plane, in how many ways can it be pe...
research
06/24/2021

Approximability of (Simultaneous) Class Cover for Boxes

Bereg et al. (2012) introduced the Boxes Class Cover problem, which has ...
research
09/14/2022

On Layer-Rainbow Latin Cubes Containing Layer-Rainbow Latin Cubes

Despite the fact that latin cubes have been studied since in the 1940's,...
research
03/02/2018

Cantor-Bendixson ranks of countable SFTs

We show that the possible Cantor-Bendixson ranks of countable SFTs are e...

Please sign up or login with your details

Forgot password? Click here to reset