We prove upper and lower bounds on the local dimension of any pair of layers of the Boolean lattice, and show that the local dimension of the first and middle layers of the $n$-dimensional Boolean lattice is asymptotically $\frac{n}{\log_2 n}$ as $n\to\infty$. Previously, all that was known was a lower bound of $Ω(n/\log n)$ and an upper bound of $n$.
Improving a result of Kim, Martin, Masařík, Shull, Smith, Uzzell, and Wang, we also prove that that the maximum local dimension of an $n$-element poset is at least $\left(\frac{1}{4}-o(1)\right)\frac{n}{\log_2 n}$.
It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic lattices, providing a characterization of the lattices of flats of boolean representable simplicial complexes and a decidability condition. We remark that every finite lattice occurs as the lattice of flats of some simplicial complex.
Let $P$ be a poset of size $2^k$ that has a greatest and a least element. We prove that, for sufficiently large $n$, the Boolean lattice $2^{[n]}$ can be partitioned into copies of $P$. This resolves a conjecture of Lonc.
The Boolean lattice of dimension two, also known as the diamond, consists of four distinct elements with the following property: $A\subset B,C\subset D$. A diamond-free family in the $n$-dimensional Boolean lattice is a subposet such that no four elements form a diamond. Note that elements $B$ and $C$ may or may not be related. There is a diamond-free family in the $n$-dimensional Boolean lattice of size $(2-o(1)){n\choose\lfloor n/2\rfloor}$. In this paper, we prove that any diamond-free family in the $n$-dimensional Boolean lattice has size at most $(2.25+o(1)){n\choose\lfloor n/2\rfloor}$. …
We study some properties of the {\bf cd}-index of the Boolean lattice. They are extremely similar to the properties of the {\ab}-index, or equivalently, the flag $h$-vector of the Boolean lattice and hence may be viewed as their {\bf cd}-analogues. We define a different algebra structure on the polynomial algebra $k < \cv, \dv>$ and give a derivation on this algebra. It is of significance for the Boolean lattice and forms our main tool. Using similar methods, we also prove some results for the {\bf cd}-index of the cubical lattice. We show that the Dehn-Sommerville relations for the flag $f$-v…
Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$: $\mathcal{P}$ might not cover the minimum and maximum of $2^{[n]}$, and at most $|P|-1$ additional points due to divisibility. In particular, if $|P|$ divides $2^{n}-2$, then the truncated Boolean lattice $2^{[n]}-\{\emptyset,[n]\}$ can be partitioned into copies of $P$. This confirms a conjecture of Lonc from 1991.
We are interested in maximizing the number of pairwise unrelated copies of a poset $P$ in the family of all subsets of $[n]$. We prove that for any $P$ the maximum number of unrelated copies of $P$ is asymptotic to a constant times the largest binomial coefficient. Moreover, the constant has the form $\frac{1}{c(P)}$, where $c(P)$ is the size of the smallest convex closure over all embeddings of $P$ into the Boolean lattice.
Inspired by the work of Izakhian and Rhodes, a theory of representation of hereditary collections by boolean matrices is developed. This corresponds to representation by finite $\vee$-generated lattices. The lattice of flats, defined for hereditary collections, lattices and matrices, plays a central role in the theory. The representations constitute a lattice and the minimal and strictly join irreducible elements are studied, as well as various closure operators.
We address the following rainbow Ramsey problem: For posets $P,Q$ what is the smallest number $n$ such that any coloring of the elements of the Boolean lattice $B_n$ either admits a monochromatic copy of $P$ or a rainbow copy of $Q$. We consider both weak and strong (non-induced and induced) versions of this problem. We also investigate related problems on (partial) $k$-colorings of $B_n$ that do not admit rainbow antichains of size $k$.
We prove that the largest $Q_2$-free family of subsets of $[n]$ which contains sets of at most three different sizes has at most $(3 + 2\sqrt {3})N/3 + o(N) \approx 2.1547N + o(N)$ members, where $N = {n \choose {\lfloor n/2 \rfloor}}$. This improves an earlier bound of $2.207N + o(N)$ by Axenovich, Manske, and Martin.
A subposet $Q'$ of a poset $Q$ is a copy of a poset $P$ if there is a bijection $f$ between elements of $P$ and $Q'$ such that $x\leq y$ in $P$ iff $f(x)\leq f(y)$ in $Q'$. For posets $P, P'$, let the poset Ramsey number $R(P,P')$ be the smallest $N$ such that no matter how the elements of the Boolean lattice $Q_N$ are colored red and blue, there is a copy of $P$ with all red elements or a copy of $P'$ with all blue elements. We provide some general bounds on $R(P,P')$ and focus on the situation when $P$ and $P'$ are both Boolean lattices. In addition, we give asymptotically tight bounds for t…
Let $F(n,k)$ ($f(n,k)$) denote the maximum possible size of the smallest color class in a (partial) $k$-coloring of the Boolean lattice $B_n$ that does not admit a rainbow antichain of size $k$. The value of $F(n,3)$ and $f(n,2)$ has been recently determined exactly. We prove that for any fixed $k$ if $n$ is large enough, then $F(n,k),f(n,k)=2^{(1/2+o(1))n}$ holds. We also introduce the general functions for any poset $P$ and integer $c\ge |P|$: let $F(n,c,P)$ ($f(n,c,P)$) denote the the maximum possible size of the smallest color class in a (partial) $c$-coloring of the Boolean lattice $B_n$ …
R. Canfield has conjectured that for all subgroups G of the automorphism group of the Boolean lattice B(n) (which can be regarded as the symmetric group S(n)) the quotient order B(n)/G is a symmetric chain order. We provide a straightforward proof of a generalization of a result of K. K. Jordan: namely, B(n)/G is an SCO whenever G is generated by powers of disjoint cycles. The symmetric chain decompositions of Greene and Kleitman provide the basis for partitions of these quotients.
We apply the graph container method to prove a number of counting results for the Boolean lattice $\mathcal P(n)$. In particular, we: (i) Give a partial answer to a question of Sapozhenko estimating the number of $t$ error correcting codes in $\mathcal P(n)$, and we also give an upper bound on the number of transportation codes; (ii) Provide an alternative proof of Kleitman's theorem on the number of antichains in $\mathcal P(n)$ and give a two-coloured analogue; (iii) Give an asymptotic formula for the number of $(p,q)$-tilted Sperner families in $\mathcal P(n)$; (iv) Prove a random version o…
Motivated by the paper of Axenovich and Walzer [2], we study the Ramsey-type problems on the Boolean lattices. Given posets $P$ and $Q$, we look for the smallest Boolean lattice $\mathcal{B}_N$ such that any coloring on elements of $\mathcal{B}_N$ must contain a monochromatic $P$ or a rainbow $Q$. This number $N$ is called the Boolean rainbow Ramsey number of $P$ and $Q$ in the paper. Particularly, we determine the exact values of the Boolean rainbow Ramsey number for $P$ and $Q$ being the antichains, the Boolean posets, or the chains. From these results, we also give some general upper and lo…
We establish monotone bijections between subsequences of the Farey sequences and the halfsequences of Farey subsequences associated with elements of the Boolean lattices.
For an odd integer $n=2d-1$, let $\mathcal{B}(n, d)$ be the subgraph of the hypercube $Q_n$ induced by the two largest layers. In this paper, we describe the typical structure of independent sets in $\mathcal{B}(n, d)$ and give precise asymptotics on the number of them. The proofs use Sapozhenko's graph container method and a recently developed method of Jenssen and Perkins, which combines Sapozhenko's graph container lemma with the cluster expansion for polymer models from statistical physics.
Let $P$ be a partially ordered set. If the Boolean lattice $(2^{[n]},\subset)$ can be partitioned into copies of $P$ for some positive integer $n$, then $P$ must satisfy the following two trivial conditions: (1) the size of $P$ is a power of $2$, (2) $P$ 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 $P$ only satisfies condition (2), we can still almost partition $2^{[n]}$ into copies of $P$. We prove that if $P$ has a unique maximal and minimal elem…
Let A be a finite set with at least two elements. The composition of two classes I and J of operations on A, is defined as the set of all compositions of functions in I with functions in J. This binary operation gives a monoid structure to the set E_A of all equational classes of operations on A. The set E_A of equational classes of operations on A also constitutes a complete distributive lattice under intersection and union. Clones of operations, i.e. classes containing all projections and idempotent under class composition, also form a lattice which is strictly contained in E_A. In the Boole…
For a family $\mathcal{F}$ of subsets of [n]=\{1, 2, ..., n} ordered by inclusion, and a partially ordered set P, we say that $\mathcal{F}$ is P-free if it does not contain a subposet isomorphic to P. Let $ex(n, P)$ be the largest size of a P-free family of subsets of [n]. Let $Q_2$ be the poset with distinct elements a, b, c, d, a<b, c<d; i.e., the 2-dimensional Boolean lattice. We show that $2N -o(N) \leq ex(n, Q_2)\leq 2.283261N +o(N), $ where $N = \binom{n}{\lfloor n/2 \rfloor}$. We also prove that the largest $Q_2$-free family of subsets of [n] having at most three different sizes has at …
Let $B_n$ be the poset generated by the subsets of $[n]$ with the inclusion as relation and let $P$ be a finite poset. We want to embed $P$ into $B_n$ as many times as possible such that the subsets in different copies are incomparable. The maximum number of such embeddings is asymptotically determined for all finite posets $P$ as $\frac{n \choose \lfloor n/2\rfloor}{M(P)}$, where $M(P)$ denotes the minimal size of the convex hull of a copy of $P$. We discuss both weak and strong (induced) embeddings.
We establish monotone bijections between the Farey sequences of order m and the halfsequences of Farey subsequences associated with the rank m elements of the Boolean lattice of subsets of a 2m-set. We also present a few related combinatorial identities.
We find the excluded minors for the minor-closed class of lattice path polymatroids as a subclass of the minor-closed class of Boolean polymatroids. Like lattice path matroids and Boolean polymatroids, there are infinitely many excluded minors, but they fall into a small number of easily-described types.
The correspondence between unmixed bipartite graphs and sublattices of the oolean lattice is discussed. By using this correspondence, we show the existence of squarefree quadratic initial ideals of toric ideals arising from minimal vertex covers of unmixed bipartite graphs.
Starting with the zero-square "zeon algebra", the regular representation gives rise to a Boolean lattice representation of sl(2). We detail the su(2) content of the Boolean lattice, providing the irreducible representations carried by the algebra generated by the subsets of an n-set. The group elements are found, exhibiting the "special functions" in this context. The corresponding Leibniz rule and group law are shown. Krawtchouk polynomials, the Hamming and the Johnson schemes appear naturally. Applications to the Boolean poset and the structure of Hadamard-Sylvester matrices are shown as wel…
We develop an algorithm for efficiently computing recursively defined functions on posets. We illustrate this algorithm by disproving conjectures about the game Subset Takeaway (Chomp on a hypercube) and computing the number of linear extensions of the lattice of a 7-cube and related lattices.
We introduce a new representation concept for lattices by boolean matrices, and utilize it to prove that any matroid is boolean representable. We show that such a representation can be easily extracted from a representation of the associated lattice of flats of the matroid, leading also to a tighter bound on the representation's size. Consequently, we obtain a linkage of boolean representations with geometry in a very natural way.
For integers $0 \leq m \leq l \leq n-m$, the truncated Boolean lattice ${\cal B}_n(m,l)$ is the poset of all subsets of $[n] = \{1, 2, \ldots, n\}$ which have size at least $m$ and at most $l$. ${\cal C} \subseteq {\cal B}_n(m,l)$ is a {\em cutset} if it meets every chain of length $l-m$ in ${\cal B}_n(m,l)$, and the {\em width} of ${\cal C}$ is the size of the largest antichain in ${\cal C}$. We conjecture that for $n >> m$ the minimum width $h_n(m,l)$ of a cutset in ${\cal B}_n(m,l)$ is $Σ_{j \geq 0} Δ_n(m-jc) = Δ_n(m)+Δ_n(m-c)+Δ_n(m-2c)+ \dots$, where $c=l-m+1$ is the number of level sets i…
Given a poset $P$, a family $F$ of elements in the Boolean lattice is said to be $P$-saturated if (1) $F$ contains no copy of $P$ as a subposet and (2) every proper superset of $F$ contains a copy of $P$ as a subposet. The maximum size of a $P$-saturated family is denoted by $La(n,P)$, which has been studied for a number of choices of $P$. The minimum size of a $P$-saturated family, $sat(n,P)$, was introduced by Gerbner et al. (2013), and parallels the deep literature on the saturation function for graphs. We introduce and study the concept of saturation for induced subposets. As opposed to in…
Dowling and Rhodes defined different lattices on the set of triples (Subset, Partition, Cross Section) over a fixed finite group G. Although the Rhodes lattice is not a geometric lattice, it defines a matroid in the sense of the theory of Boolean representable simplicial complexes. This turns out to be the direct sum of a complete matroid with a lift matroid of the complete biased graph over G. As is well known, the Dowling lattice defines the frame matroid over a similar biased graph. This gives a new perspective on both matroids and also an application of matroid theory to the theory of fini…
A subposet $Q'$ of a poset $Q$ is a \textit{copy of a poset} $P$ if there is a bijection $f$ between elements of $P$ and $Q'$ such that $x \le y$ in $P$ iff $f(x) \le f(y)$ in $Q'$. For posets $P, P'$, let the \textit{poset Ramsey number} $R(P,P')$ be the smallest $N$ such that no matter how the elements of the Boolean lattice $Q_N$ are colored red and blue, there is a copy of $P$ with all red elements or a copy of $P'$ with all blue elements. Axenovich and Walzer introduced this concept in \textit{Order} (2017), where they proved $R(Q_2, Q_n) \le 2n + 2$ and $R(Q_n, Q_m) \le mn + n + m$, wher…
The aim of this paper is to build a new family of lattices related to some combinatorial extremal sum problems, in particular to a conjecture of Manickam, Miklös and Singhi. We study the fundamentals properties of such lattices and of a particular class of boolean functions defined on them.
Writing the values of Krawtchouk polynomials as matrices, we consider weighted partial sums along columns. For the general case, we find an identity that, in the symmetric case yields a formula for such partial sums. Complete sums of squares along columns involve "Super Catalan" numbers. We look as well for particular values (matrix entries) involving the Catalan numbers. Properties considered and developed in this work are applied to calculations of various dimensions that describe the structure of some *-algebras over the Boolean lattice based on inclusion/superset relations expressed algebr…
Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences（匈牙利科学院阿尔弗雷德·雷尼数学研究所）；Faculty of Environment and Information Sciences, Yokohama National University（横滨国立大学环境信息科学部）；College of Science, China Jiliang University（中国计量大学理学院）
We prove a "supersaturation-type" extension of both Sperner's Theorem (1928) and its generalization by Erdos (1945) to k-chains. Our result implies that a largest family whose size is x more than the size of a largest k-chain free family and that contains the minimum number of k-chains is the family formed by taking the middle (k-1) rows of the Boolean lattice and x elements from the k-th middle row. We prove our result using the symmetric chain decomposition method of de Bruijn, van Ebbenhorst Tengbergen, and Kruyswijk (1951).
Given partially ordered sets (posets) $(P, \leq_P)$ and $(P', \leq_{P'})$, we say that $P'$ contains a copy of $P$ if for some injective function $f: P\rightarrow P'$ and for any $X, Y\in P$, $X\leq _P Y$ if and only of $f(X)\leq_{P'} f(Y)$. For any posets $P$ and $Q$, the poset Ramsey number $R(P,Q)$ is the least positive integer $N$ such that no matter how the elements of an $N$-dimensional Boolean lattice are colored in blue and red, there is either a copy of $P$ with all blue elements or a copy of $Q$ with all red elements. We focus on a poset Ramsey number $R(P, Q_n)$ for a fixed poset $P…
The poset Ramsey number $R(Q_m,Q_n)$ is the smallest integer $N$ such that any blue-red coloring of the elements of the Boolean lattice $Q_N$ has a blue induced copy of $Q_m$ or a red induced copy of $Q_n$. The weak poset Ramsey number $R_w(Q_m,Q_n)$ is defined analogously, with weak copies instead of induced copies. It is easy to see that $R(Q_m,Q_n) \ge R_w(Q_m,Q_n)$. Axenovich and Walzer showed that $n+2 \le R(Q_2,Q_n) \le 2n+2$. Recently, Lu and Thompson improved the upper bound to $\frac{5}{3}n+2$. In this paper, we solve this problem asymptotically by showing that $R(Q_2,Q_n)=n+O(n/\log …
The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0}\subset...\subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $|c_{i}|+|c_{k-i}|=n$ for $i=0,...,k$; and it is symmetric, if $|c_{i}|=(n-k)/2+i$. We show that there exist a bijection $$p: [n]^{(\geq n/2)}\rightarrow [n]^{(\leq n/2)}$$ and a partial ordering $<$ on $[n]^{(\geq n/2)}$ satisfying the following properties: (i) $\subset$ is an extension of $<$ on $[n]^{(\geq n/2)}$; (ii) if $C\subset [n]^{(\geq n/2)}$ is a chain with respect to $<$, then $p(C)\cup C$ is a rank-symmetric chain in $2^{[n]}$, whe…
Given posets $\mathbf{P}_1,\mathbf{P}_2,\ldots,\mathbf{P}_k$, let the {\em Boolean Ramsey number} $R(\mathbf{P}_1,\mathbf{P}_2,\ldots,\mathbf{P}_k)$ be the minimum number $n$ such that no matter how we color the elements in the Boolean lattice $\mathbf{B}_n$ with $k$ colors, there always exists a poset $\mathbf{P}_i$ contained in $\mathbf{B}_n$ whose elements are all colored with $i$. This function was first introduced by Axenovich and Walzer~\cite{AW}. Recently, many results on determining $R(\mathbf{B}_m,\mathbf{B}_n)$ have been published. In this paper, we will study the function $R(\mathbf…
Let $P$ be a finite poset. Let $L:=J(P)$ denote the lattice of order ideals of $P$. Let $b_i(L)$ denote the number of Boolean intervals of $L$ of rank $i$. We construct a simple graph $G(P)$ from our poset $P$. Denote by $f_i(P)$ the number of the cliques $K_{i+1}$, contained in the graph $G(P)$. Our main results are some linear equations connecting the numbers $f_i(P)$ and $b_i(L)$. We reprove the Dehn--Sommerville equations for simplicial polytopes. In our proof we use free resolutions and the theory of Stanley--Reisner rings.
In the Diffusion Limited Aggregation (DLA) process on on $\mathbb{Z}^2$, or more generally $\mathbb{Z}^d$, particles aggregate to an initially occupied origin by arrivals on a random walk. The scaling limit of the result, empirically, is a fractal with dimension strictly less than $d$. Very little has been shown rigorously about the process, however. We study an analogous process on the Boolean lattice $\{0,1\}^n$, in which particles take random decreasing walks from $(1,\dots,1)$, and stick at the last vertex before they encounter an occupied site for the first time; the vertex $(0,\dots,0)$ …
Suppose $k \ge 2$ is an integer. Let $Y_k$ be the poset with elements $x_1, x_2, y_1, y_2, \ldots, y_{k-1}$ such that $y_1 < y_2 < \cdots < y_{k-1} < x_1, x_2$ and let $Y_k'$ be the same poset but all relations reversed. We say that a family of subsets of $[n]$ contains a copy of $Y_k$ on consecutive levels if it contains $k+1$ subsets $F_1, F_2, G_1, G_2, \ldots, G_{k-1}$ such that $G_1\subset G_2 \subset \cdots \subset G_{k-1} \subset F_1, F_2$ and $|F_1| = |F_2| = |G_{k-1}|+1 =|G_{k-2}|+ 2= \cdots = |G_{1}|+k-1$. If both $Y_k$ and $Y'_k$ on consecutive levels are forbidden, the size of the …
Let $[n] = \{1, 2, \ldots, n\}$ and let $2^{[n]}$ be the collection of all subsets of $[n]$ ordered by inclusion. ${\cal C} \subseteq 2^{[n]}$ is a {\em cutset} if it meets every maximal chain in $2^{[n]}$, and the {\em width} of ${\cal C} \subseteq 2^{[n]}$ is the minimum number of chains in a chain decomposition of ${\cal C}$. Fix $0 \leq m \leq l \leq n$. What is the smallest value of $k$ such that there exists a cutset that consists only of subsets of sizes between $m$ and $l$, and such that it contains exactly $k$ subsets of size $i$ for each $m \leq i \leq l$? The answer, which we denote…
The characterization of level sets of finite Boolean lattices as antichain cutsets, due to Rival and Zaguia, is seen to hold in all discrete semimodular lattices.
