# Abelian groups yield many large families for the diamond problem

## Abstract

There is much recent interest in excluded subposets. Given a fixed poset \(P\), how many subsets of \([n]\) can be found without a copy of \(P\) realized by the subset relation? The hardest and most intensely investigated problem of this kind is when \(P\) is a *diamond*, i.e. the power set of a two-element set. In this paper, we show infinitely many asymptotically tight constructions using random set families defined from posets based on Abelian groups. They are provided by the convergence of Markov chains on groups. Such constructions suggest that the diamond problem is hard.

### Keywords

Poset Diamond-free families Lubell function Boolean lattice Abelian group Markov chain### Mathematics Subject Classification

05D05 06A06 11B13 11P70 20K01## 1 Introduction

This introduction largely follows the concise and accurate description of the background and history from [20]. For posets \(P = (P,\le )\) and \(P' = (P',\le ')\), we say \(P'\) is a *weak subposet* of \(P\) if there exists an injection \(f :P' \rightarrow P\) that preserves the partial ordering, meaning that whenever \(u \le ' v\) in \(P'\) we have \(f(u) \le f(v)\) in \(P\), see [27]. In what follows by a subposet we always mean a weak subposet. The *height*\(h(P)\) of a poset \(P\) is the length of the longest chain in \(P\). We consider a family \(\fancyscript{F}\) of subsets of \([n]\) a poset for the subset relation. If \(P\) is not a subposet of \( \fancyscript{F}\), we say \(\fancyscript{F}\) is \(P\)-*free*. We are interested in determining the largest size of a \(P\)-free family of subsets of \([n]\), denoted Open image in new window. Let \(P_k\) denote the total order of \(k\) elements that we term as a \(k\)-*chain*. The archetypal result is Sperner’s theorem [10, 26]: Open image in new window. Let \(\fancyscript{B}(n, k)\) denote the middle \(k\) levels in the subset lattice of \([n]\) and let \(\sum (n, k) = |\fancyscript{B}(n, k)|\). Erdős [10, 11] proved that Open image in new window. \(A\nsubseteq B\)

For any family \(\fancyscript{F}\) of subsets of \([n]\), define its *Lubell function*\(h_n(\fancyscript{F})=\sum _{F\in \fancyscript{F}} 1/\left( {\begin{array}{c}n\\ |F|\end{array}}\right) \). The celebrated Bollobás–Lubell–Meshalkin–Yamamoto (BLYM) inequality asserts that for a \(P_k\)-free family \(\fancyscript{F}\), we have \(h_n(\fancyscript{F}) \le k-1\), which was originally shown for \(k=2\) [4, 22, 24, 29] and extended for all \(k\) by Erdős, Füredi, and Katona [12]. (For a generalization of the BLYM inequality, where cases of equality characterize mixed orthogonal arrays, see Aydinian, Czabarka, and Székely [2].) The BLYM inequality gives the book proof to Open image in new window. In view of this, it makes sense to study \(\lambda _n(P) = \max {h_n(\fancyscript{F})}\), where the maximization is over \(P\)-free families \(\fancyscript{F}\) in \([n]\).

Katona had a key role starting the investigation of extremal problems with excluded posets [6, 7, 8, 13, 18]. Katona and Tarján [18] obtained bounds on Open image in new window and later De Bonis and Katona [7] extended it to Open image in new window, where the \(r\)-fork \(V_r\) is the poset \(A < B_1, \ldots , B_r\). The answers are asymptotic to \(\left( {\begin{array}{c}n\\ \lfloor n/2\rfloor \end{array}}\right) \), and most of the work is devoted to finding second and third terms in the asymptotic expansion.

Katona [17] attributes the now famous *diamond problem* to a question of an unidentified member of the audience at his talk. After all, if trees are solved, the next open problems must allow some cycles in the Hasse diagram of \(P\). The *diamond*\(D_k\) is defined as \(A < B_1\), \(\ldots \), \(B_k < C\), and with the term diamond we normally refer to \(D_2\).

Griggs and Li [14] introduced a relevant class of posets. They termed a poset \(P\)*uniform-L-bounded* if \(\lambda _n(P) \le e(P)\) for all \(n\). For any uniform-L-bounded posets \(P\), Griggs and Li [14] proved Open image in new window. Griggs, Li, and Lu [15] showed that the chain \(P_k\), the diamond \(D_k\) if \(2^{m-1}-1\le k \le 2^m- \left( {\begin{array}{c}m\\ \lfloor m/2\rfloor \end{array}}\right) -1\) (including the numbers \(k = 3, 4, 7, 8, 9, 15, 16, \ldots \)) are uniform-L-bounded posets, and so are the harps \(H(l_1, l_2, \ldots , l_k)\) (consisting of chains \(P_1,\ldots ,P_k\) with their top elements identified and their bottom elements identified) for \(l_1 > l_2 > \cdots > l_k\).

Griggs and Lu [16] conjecture that for *any poset*\(P\), the limit in (1) exists and is an integer. All the results above are compatible with this conjecture.

The *crown*\({\fancyscript{O}}_{2t}\) is defined as \(A_1<B_1>A_2<B_2> \cdots >A_t<B_t>A_1\). Crowns are neither trees nor uniform-L-bounded. The crown \({\fancyscript{O}}_{4}\) is known as the *butterfly*. De Bonis et al. [8] proved Open image in new window. Griggs and Lu [16] proved \(\pi ({\fancyscript{O}}_{2t})=e({\fancyscript{O}}_{2t})\) for \(t\ge 4 \) even, and recently Lu [20] proved \(\pi ({\fancyscript{O}}_{2t})=e({\fancyscript{O}}_{2t})\) for \(t\ge 7 \) odd, leaving open only \({\fancyscript{O}}_{6}\) and \({\fancyscript{O}}_{10}\).

*diamond conjecture*. Axenovich et al. [1] reduced the upper bound in (2) to \(2.283\); Griggs et al. [15] further reduced it to \(25/11\). The current best upper bound is \(2.25\), achieved by Kramer et al. [19]. They also pointed out that this is the best possible bound that can be derived from a Lubell function argument. Manske and Shen [23] have a better upper bound for \(3\)-layered families of sets, \(2.1547\), improving on an earlier bound of Axenovich et al. [1], \(2.207\). A similar improvement for \(3\)-layered families of sets was also made by Balogh et al. [3].

For a long time no construction was known for the diamond problem with more sets than those in the two largest levels, though some alternative constructions existed, e.g. taking on \(12\) points all \(5\)-subsets, all \(7\)-subsets and a Steiner system \(S(5,6,12)\). In 2013, Dove [9] made an improvement on this, for every even \(n\ge 6\). For \(n=6\), he provided \(36\) sets, while the two largest levels contain only \(35\) sets. As \(n\) goes to infinity, the gain in his construction is diminishing in percentage. Through computer search, Lu independently found a construction for \(n=6\) with \(36\) sets [21].

The goal of this paper is to provide infinitely many exotic examples that show the asymptotical tightness of the diamond conjecture. These constructions are based on Abelian groups and are very different from the usual extremal set systems. We show that Dove’s example fits into this description although his formulation was different. The proofs use the theory of Markov chains on groups, allowing citations of theorems instead of making analytic proofs from scratch to show a limiting uniform distribution. Dove’s example, however, uses a non-uniform distribution.

## 2 Strongly diamond-free Cayley posets

Let us be given a finite group \({\Gamma }\) with identity \(e\) and a set of generators \(H\subseteq {\Gamma }\). Recall that the *Cayley graph*\(\mathbf {G}({\Gamma }, H)\) has vertex set \({\Gamma }\) and edge set \(\{g \rightarrow gh: h\in H,g\in {\Gamma } \}\). We do not assume \(H=H^{-1}\), an assumption often made for Cayley graphs. We define the *infinite Cayley poset*\(P({\Gamma }, H)\) as follows: the vertices of the poset are ordered pairs \((\gamma , i)\), for \(\gamma \in {\Gamma }\) and \(i\in \mathbb Z\), and \((\gamma , i)\preceq _P (\delta ,j)\) if \(j\ge i\) and \(\gamma =\delta \eta _1\eta _2\cdots \eta _{j-i}\) for some \(\eta _1,\eta _2,\ldots ,\eta _{j-i}\in H\). It is easy to see that \(P({\Gamma }, H)\) is a partial order indeed. Furthermore, mapping the vertices of the infinite Cayley poset \(P({\Gamma }, H)\) to the vertices of the Cayley graph \(\mathbf {G}({\Gamma }, H)\) by projection to the first coordinate, upward oriented edges of the Hasse diagram map to the edges of the Cayley graph. We term finite subposets of the infinite Cayley poset as *Cayley posets*.

*aperiodic*, if forthe greatest common divisor of elements of \(L\) is 1. We say that a (finite) Cayley poset is

*aperiodic*if the generating set is aperiodic.

*weight*\(w(x)\in H\) such that for all \(x\in N_i\), \(w(x)= \eta _i\). We will refer to \(N\) as a

*weighted set*. For \(A\subseteq N\), define \(w(A)=\sum _{x\in A} w(x)\). For every \(i\ge 0\) and \(\gamma \in {\Gamma }\), defineLet \((\gamma _1, i_1)\prec (\gamma _2, i_2)\prec (\gamma _3, i_3)\) be three distinct elements of a Cayley poset \({\Pi }\). If some \(\eta \in H\) can be used in both an Open image in new window-term sum of elements of \(H\) representing \(\gamma _2-\gamma _1\) and an Open image in new window-term sum of elements of \(H\) representing \(\gamma _3-\gamma _2\), we say that the three elements form a

*strong chain*in \({\Pi }\). We call a Cayley poset \({\Pi }\)

*strongly diamond-free*if (a) \({\Pi }\) is diamond-free, and (b) it has no strong chains. We need the following easy lemma.

**Lemma 2.1**

*Proof*

Referring to a diamond in this proof, we assume that \(a_1\) is its lowest element, \(a_4\) is its largest element, and \(a_2,a_3\) are the middle (incomparable) elements. We will show that if \(\fancyscript{F}(N,w,{\Pi }) \) is not diamond-free, then \({\Pi }\) is not strongly diamond-free.

If there are four different sets \(A_1,A_2,A_3,A_4\) in \( \fancyscript{F}(N,w,{\Pi }) \) that correspond to a diamond \(a_1,a_2,a_3,a_4\), respectively, then, \(j_1< j_2,j_3< j_4\) and \(j_i=|A_i|- {\lfloor n/2\rfloor }\), and also \(\gamma _i=w(A_i)\). Now we have that either (\(j_2\ne j_3\)) or (\(j_2=j_3\) and \(\gamma _2\ne \gamma _3\)) or \((j_2=j_3\) and \(\gamma _2=\gamma _3)\).

If (\(j_2\ne j_3\)) or (\(j_2=j_3\) and \(\gamma _2\ne \gamma _3\)), then the four elements \((\gamma _i,j_i)\), \(i\in [4]\), form a diamond in \({\Pi }\) so \({\Pi }\) is not strongly diamond-free.

If \(j=j_2=j_3\) and \(\gamma =\gamma _2=\gamma _3\), then we have that \(w(A_1)=\gamma _1\), \(w(A_4)=\gamma _4\), \(|A_1|=\lfloor n/2 \rfloor +j_1\), \(|A_4|=\lfloor n/2 \rfloor +j_4\), \(w(A_2)=w(A_3)=\gamma \) and \(|A_2|=|A_3|=\lfloor n/2 \rfloor +j\).

Now clearly for \(i\in \{2,3\}\) we have that \(A_1\subseteq A_2\cap A_3\subsetneq A_i\subsetneq A_2\cup A_3\subseteq A_4\). Using Open image in new window (possibly empty), Open image in new window (possibly empty) and Open image in new window (nonempty!) for \(i\in \{2,3\}\) it follows that for Open image in new window we have that Open image in new window.

In particular, in this case we have found \((\gamma _1,j_1)<(\gamma ,j)<(\gamma _4,j_4)\) in \({\Pi }\) such that \(\gamma -\gamma _1\) can be written as a Open image in new window-term sum of elements of \(H\) containing the term \(\eta \) and and \(\gamma _4-\gamma \) is a Open image in new window-term sum of elements of \(H\) containing the term \(\eta \). Thus, in this case \({\Pi }\) is not strongly diamond-free either.\(\square \)

## 3 Markov chains on \({\Gamma }\)

*finite*set \(A\), if \(|A|\) is

*sufficiently large*for a fixed \({\Gamma }\).

*random variables*, unlike \(w(A)\) and \(s_\gamma (i)\) in the previous section. By the convergence to uniform distribution recalled above, we have that for all \(\epsilon >0\) and all sufficiently large \(n\)HenceWe reformulate (3) above as a theorem

**Theorem 3.1**

**Theorem 3.2**

The conclusion of this theorem is that if one constructs an aperiodic generating set of a finite Abelian group of order \(m\) and strongly diamond-free Cayley poset of \(\ell \) elements with this generating set, then for a large \(n\), \(\fancyscript{F}(N,w,{\Pi })\) with some weighting \(w\) has size at least \(( \ell /m-\epsilon ){\left( {\begin{array}{c}n\\ \lfloor n/2\rfloor \end{array}}\right) }\). A construction with \(\ell >2m\) would even refute the diamond conjecture.

Therefore in the next section we focus on constructing finite Cayley posets with \(\ell =2m\) or with just slightly fewer elements.

## 4 Constructions

*Example 4.1*

(classic example) For any \({\Gamma }\) and \(H\), take two levels from the infinite Cayley poset. This is a strongly diamond-free Cayley poset with \(2m\) vertices.

We leave the verification of the correctness of the following constructions to the readers, where \({\Gamma }\) denotes the additive group of modulo \(m\) residue classes.

*Example 4.2*

(Note that if Open image in new window, then \(H=\{a,b\}\) is a set of generators.) This poset is often aperiodic. For example, if \(m=3\) and the generators are \(a=1\), \(b=2\), we have an aperiodic poset. The exact condition for aperiodicity is that \(H\) is not contained by a coset of a proper subgroup of \({\Gamma }\). See [25, Proposition 2.3].

*Example 4.3*

Note that \(1,2\,\mathrm{mod}\,3\) and \(2,3,5\,\mathrm{mod}\, 7\) are difference sets. However, bigger difference sets do not seem to offer good constructions. On four levels, we still can construct “close” constructions.

*Example 4.4*

*Example 4.5*

The last two constructions still allow close approximations of the conjectured maximum \((2+o(1)){\left( {\begin{array}{c}n\\ \lfloor n/2\rfloor \end{array}}\right) }\). For any fixed \(\epsilon \), set \(k>1+1/\epsilon \) to have \((2m-2)/m>2-\epsilon /2\). Fixing this \(k\), for sufficiently large \(n\), a set system is obtained from Example 4.4 or 4.5 with at least \((2-\epsilon ){\left( {\begin{array}{c}n\\ \lfloor n/2\rfloor \end{array}}\right) }\) elements.

*do not*contain exactly one element from the set \(\{1,2\}\), and select those Open image in new window-element sets that have non-empty intersection with the set \(\{1,2\}\). It is easy to check that this family is diamond-free. Say, for \(n=6\), the family has

*Example 4.6*

Dove’s construction can be obtained from this example using Lemma 2.1 but not Markov chains. Take for the underlying set \(N=\{1,2,\ldots ,n\}\), set \(N_1=\{1,2\} \) with weights \(w(1)=w(2)=2\in \mathbb Z_3\) and \(N_2=\{3,4,\ldots ,n\}\) with weights \(w(3)=w(4)=\ldots =w(n)=0\in \mathbb Z_3\). This construction gives the very same family as Dove’s construction.

## Notes

### Acknowledgments

The authors thank the referees for their comments and corrections.

### References

- 1.Axenovich, M., Manske, J., Martin, R.: \(Q_2\)-free families in the Boolean lattice. Order
**29**(1), 177–191 (2012)CrossRefMATHMathSciNetGoogle Scholar - 2.Aydinian, H., Czabarka, É., Székely, L.A.: Mixed orthogonal arrays, \(k\)-dimensional \(M\)-part Sperner multifamilies, and full multitransversals. In: Aydinian, H., Cicalese, F., Deppe, C. (eds.) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol. 7777, pp. 371–401. Springer, Heidelberg (2013)CrossRefGoogle Scholar
- 3.Balogh, J., Hu, P., Lidický, B., Liu, H.: Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube. Eur. J. Comb.
**35**, 75–85 (2014)CrossRefMATHGoogle Scholar - 4.Bollobás, B.: On generalized graphs. Acta Math. Acad. Sci. Hung.
**16**(3–4), 447–452 (1965)CrossRefMATHGoogle Scholar - 5.Bukh, B.: Set families with a forbidden subposet. Electron. J. Comb.
**16**(1), R142 (2009)MathSciNetGoogle Scholar - 6.Carroll, T., Katona, G.O.H.: Bounds on maximal families of sets not containing three sets with \(A \cap B \subset C\), \( A \not\subseteq B\). Order
**25**(3), 229–236 (2008)Google Scholar - 7.De Bonis, A., Katona, G.O.H.: Largest families without an \(r\)-fork. Order
**24**(3), 181–191 (2007)CrossRefMATHMathSciNetGoogle Scholar - 8.De Bonis, A., Katona, G.O.H., Swanepoel, K.J.: Largest family without \(A \cup B \subseteq C \cap D\). J. Comb. Theory Ser. A
**111**(2), 331–336 (2005)CrossRefMATHGoogle Scholar - 9.Dove, A.P.: Generalizations of Sperner’s Theorem: Packing Posets, Families Forbidding Posets, and Supersaturation. PhD thesis, University of South Carolina. ProQuest LLC, Ann Arbor (2013)Google Scholar
- 10.Engel, K.: Sperner Theory. Encyclopedia of Mathematics and its Applications, vol. 65. Cambridge University Press, Cambridge (1997)Google Scholar
- 11.Erdős, P.: On a lemma of Littlewood and Offord. Bull. Am. Math. Soc.
**51**(12), 898–902 (1945)CrossRefGoogle Scholar - 12.Erdős, P.L., Füredi, Z., Katona, G.O.H.: Two-part and \(k\)-Sperner families: new proofs using permutations. SIAM J. Discret. Math.
**19**(2), 489–500 (2005)CrossRefGoogle Scholar - 13.Griggs, J.R., Katona, G.O.H.: No four subsets forming an \(N\). J. Comb. Theory Ser. A
**115**(4), 677–685 (2008)CrossRefMATHMathSciNetGoogle Scholar - 14.Griggs, J.R., Li, W.-T.: Uniformly L-bounded posets. preprint (2011)Google Scholar
- 15.Griggs, J.R., Li, W.-T., Lu, L.: Diamond-free families. J. Comb. Theory Ser. A
**119**(2), 310–322 (2012)CrossRefMATHMathSciNetGoogle Scholar - 16.Griggs, J.R., Lu, L.: On families of subsets with a forbidden subposet. Comb. Probab. Comput.
**18**(5), 731–748 (2009)CrossRefMATHMathSciNetGoogle Scholar - 17.Katona, G.O.H.: Sperner type theorems with excluded subposets. Discret. Appl. Math.
**161**(9), 1251–1258 (2013)CrossRefMATHMathSciNetGoogle Scholar - 18.Katona, G.O.H., Tarján, T.G.: Extremal problems with excluded subgraphs in the \(n\)-cube. In: Borowiecki, M., Kennedy, J.W., Sysło, M.M. (eds.) Graph Theory (Łagów, 1981). Lecture Notes in Mathematics, vol. 1018, pp. 84–93. Springer, Berlin (1983)CrossRefGoogle Scholar
- 19.Kramer, L., Martin, R.R., Young, M.: On diamond-free subposets of the Boolean lattice. J. Comb. Theory Ser. A
**120**(3), 545–560 (2013)CrossRefMATHMathSciNetGoogle Scholar - 20.Lu, L.: On crown-free families of subsets. J. Comb. Theory Ser. A
**126**, 216–231 (2014)CrossRefMATHGoogle Scholar - 21.Lu, L.: Personal communicationGoogle Scholar
- 22.Lubell, D.: A short proof of Sperner’s lemma. J. Comb. Theory
**1**(2), 299 (1966)CrossRefMATHMathSciNetGoogle Scholar - 23.Manske, J., Shen, J.: Three layer \(Q_2\)-free families in the Boolean lattice. Order
**30**(2), 585–592 (2013)CrossRefMATHMathSciNetGoogle Scholar - 24.Meshalkin, L.D.: Generalization of Sperner’s theorem on the number of subsets of a finite set. Theory Probab. Appl.
**8**(2), 203–204 (1963)CrossRefMATHGoogle Scholar - 25.Saloff-Coste, L.: Random walks on finite groups. In: Kesten, H. (ed.) Probability on Discrete Structures. Encyclopaedia of Mathematical Sciences, vol. 110, pp. 263–346. Springer, Berlin (2004)CrossRefGoogle Scholar
- 26.Sperner, E.: Ein Satz über Untermengen einer endlichen Menge. Math. Z.
**27**, 544–548 (1928)CrossRefMATHMathSciNetGoogle Scholar - 27.Stanley, R.P.: Enumerative Combinatorics. I. Cambridge Studies in Advanced Mathematics, vol. 49. Cambridge University Press, Cambridge (1997)CrossRefGoogle Scholar
- 28.Thanh, H.T.: An extremal problem with excluded subposets in the Boolean lattice. Order
**15**(1), 51–57 (1998)CrossRefMATHMathSciNetGoogle Scholar - 29.Yamamoto, K.: Logarithmic order of free distributive lattice. J. Math. Soc. Jpn.
**6**(3–4), 343–353 (1954)CrossRefMATHGoogle Scholar