Symmetric chain decompositions of products of posets with long chains (Q1753043)

Summary: We ask if there exists a symmetric chain decomposition of the cuboid \(Q_k \times n\) such that no chain is \textit{taut}, i.e. no chain has a subchain of the form \((a_1,\ldots, a_k,0)\prec \cdots\prec (a_1,\ldots,a_k,n-1)\). In this paper, we show this is true precisely when \(k \geq 5\) and \(n\geq 3\). This question arises naturally when considering products of symmetric chain decompositions which induce orthogonal chain decompositions -- the existence of the decompositions provided in this paper unexpectedly resolves the most difficult case of previous work by the second author on almost orthogonal symmetric chain decompositions [SIAM J. Discrete Math. 33, No. 2, 910--932 (2019; Zbl 07099858)], making progress on a conjecture of \textit{J. Shearer} and \textit{D. J. Kleitman} [Stud. Appl. Math. 60, 271--276 (1979; Zbl 0415.05004)]. In general, we show that for a finite graded poset \(P\), there exists a canonical bijection between symmetric chain decompositions of \(P \times m\) and \(P \times n\) for \(m, n\geq rk(P) + 1\), that preserves the existence of taut chains. If \(P\) has a unique maximal and minimal element, then we also produce a canonical \((rk(P) +1)\) to \(1\) surjection from symmetric chain decompositions of \(P \times (rk(P) + 1)\) to symmetric chain decompositions of \(P \times rk(P)\) which sends decompositions with taut chains to decompositions with taut chains.