Nonexistence of a Kruskal–Katona type theorem for double-sided shadow minimization in the Boolean cube layer
By: Maksim Bashov
Abstract
A double-sided shadow minimization problem in the Boolean cube layer is investigated in this paper. The problem is to minimize the size of the union of the lower and upper shadows of a k-uniform family of subsets of [n]. It is shown that if 3 ⋜ k ⋜ n−3, there is no total order such that all its initial segments have minimal double-sided shadow.
DOI: https://doi.org/10.2478/ausi-2014-0004 | Journal eISSN: 2066-7760
Language: English
Page range: 53 - 62
Submitted on: Feb 5, 2013
Published online: May 30, 2014
Published in print: Jul 1, 2013
Published by: Sapientia Hungarian University of Transylvania
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Related subjects:
© 2014 Maksim Bashov, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
