Exact hyperplane covers for subsets of the hypercube

被引：3

作者：

Aaronson, James ^{[1
]}

Groenland, Carla ^{[1
]}

Grzesik, Andrzej ^{[2
]}

Johnston, Tom ^{[1
]}

Kielak, Bartlomiej ^{[2
]}

机构：

[1] Univ Oxford, Math Inst, Oxford OX2 6G, England

[2] Jagiellonian Univ, Fac Math & Comp Sci, Lojasiewicza, PL-30348 Krakow, Poland

来源：

DISCRETE MATHEMATICS | 2021年 / 344卷 / 09期

基金：

欧洲研究理事会;

关键词：

Hypercube; Intersection patterns; Hyperplanes; Exact covers;

D O I：

10.1016/j.disc.2021.112490

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Alon and Furedi (1993) showed that the number of hyperplanes required to cover {0, 1}(n) \ {0} without covering 0 is n. We initiate the study of such exact hyperplane covers of the hypercube for other subsets of the hypercube. In particular, we provide exact solutions for covering {0, 1}(n) while missing up to four points and give asymptotic bounds in the general case. Several interesting questions are left open. (c) 2021 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

引用

页数：7

共 50 条

[41] ON EXACT MINIMAL (1,5)-COVERS OF 13 POINTS
SANE, SS
SHRIKHANDE, MS
ARS COMBINATORIA, 1991, 32 : 215 - 219
[42] Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
Park, Jung-Heum
THEORETICAL COMPUTER SCIENCE, 2016, 617 : 45 - 64
[43] Firefly Monte Carlo: Exact MCMC with Subsets of Data
Maclaurin, Dougal
Adams, Ryan P.
PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 4289 - 4295
[44] Firefly Monte Carlo: Exact MCMC with Subsets of Data
Maclaurin, Dougal
Adams, Ryan P.
UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, 2014, : 543 - 552
[45] Paired 2-disjoint path covers of balanced hypercube under the partitioned edge fault model
Li, Yifan
Zhou, Shuming
Cheng, Eddie
JOURNAL OF SUPERCOMPUTING, 2025, 81 (01):
[46] MINIMAL COVERS OF SN BY ABELIAN SUBGROUPS AND MAXIMAL SUBSETS OF PAIRWISE NONCOMMUTING ELEMENTS
BROWN, R
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1988, 49 (02) : 294 - 307
[47] Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements
Park, JH
Kim, HC
Lim, HS
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2006, 17 (03) : 227 - 240
[48] Many-to-many two-disjoint path covers in restricted hypercube-like graphs
Kim, Sook-Yeon
Park, Jung-Heum
THEORETICAL COMPUTER SCIENCE, 2014, 531 : 26 - 36
[49] Nilpotent covers and non-nilpotent subsets of finite groups of Lie type
Azad, Azizollah
Britnell, John R.
Gill, Nick
FORUM MATHEMATICUM, 2015, 27 (06) : 3745 - 3782
[50] Clique numbers of graphs and irreducible exact m-covers of the integers
Pan, Hao
Zhao, Li-Lu
ADVANCES IN APPLIED MATHEMATICS, 2009, 43 (01) : 24 - 30

← 1 2 3 4 5 →