Almost tiling of the Boolean lattice with copies of a poset

preprint2016arXivOpen access

Abstract

Let PP be a partially ordered set. If the Boolean lattice (2[n],⊂)(2^{[n]},\subset) can be partitioned into copies of PP for some positive integer nn, then PP must satisfy the following two trivial conditions: (1) the size of PP is a power of 22, (2) PP has a unique maximal and minimal element. Resolving a conjecture of Lonc, it was shown by Gruslys, Leader and Tomon that these conditions are sufficient as well. In this paper, we show that if PP only satisfies condition (2), we can still almost partition 2[n]2^{[n]} into copies of PP. We prove that if PP has a unique maximal and minimal element, then there exists a constant c=c(P)c=c(P) such that all but at most cc elements of 2[n]2^{[n]} can be covered by disjoint copies of PP.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.