Nonexistence of a Kruskal–Katona type theorem for double-sided shadow minimization in the Boolean cube layer

[1] R. Ahlswede, H. Aydinian, L. H. Khachatrian, More about shifting techniques, European J. Combin. 24, 5 (2003) 551-556. ⇒53, 54, 5610.1016/S0195-6698(03)00032-5Search in Google Scholar

[2] M. A. Bashov, On minimisation of the double-sided shadow in the unit cube, Diskr. Mat., 23, 4 (2011) 115-132. ⇒5410.4213/dm1165Search in Google Scholar

[3] M. A. Bashov, Minimal families in terms of double-sided shadow in the Boolean cube layer, Electron. Notes in Discrete Math., 38 (2011) 117-122. ⇒6110.1016/j.endm.2011.09.020Search in Google Scholar

[4] M. A. Bashov, Minimal in terms of double-sided shadow subsets of Boolean cube layer distinct from circles, Diskretn. Anal. Issled. Oper., 19, 5 (2012) 3-20. ⇒ 54, 55Search in Google Scholar

[5] S. L. Bezrukov, U. Leck, Macaulay posets, Electron. J. Combin. (2004), Dynamic Survey DS12, http://www.combinatorics.org/. ⇒5410.37236/33Search in Google Scholar

[6] G. F. Clements, B. Lindström, A generalization of a combinatorial theorem of Macaulay, J. Combin. Theory 7 (1969) 230-238. ⇒5310.1016/S0021-9800(69)80016-5Search in Google Scholar

[7] G. O. H. Katona, A theorem of finite sets, Proc. Tihany Conference, New York, 1966, pp. 187-207. ⇒53Search in Google Scholar

[8] J. Kruskal, The number of simplices in a complex. In: Mathematical Optimization Techniques, Berkeley, Los Angeles, Univ. of California Press, 1963, 251-278. ⇒ 5310.1525/9780520319875-014Search in Google Scholar