Gray codes and symmetric chains

We consider the problem of constructing a cyclic listing of all bitstrings of length 2 n + 1 with Hamming weights in the interval [ n + 1 − l , n + l ] , where 1 ≤ l ≤ n + 1 , by flipping a single bit in each step. This is a far-ranging generalization of the well-known middle two levels problem (the case l = 1 ). We provide a solution for the case l = 2 , and we solve a relaxed version of the problem for general values of l , by constructing cycle factors for those instances. The proof of the first result uses the lexical matchings introduced by Kierstead and Trotter, which we generalize to arbitrary consecutive levels of the hypercube . The proof of the second result uses symmetric chain decompositions of the hypercube, a concept known from the theory of posets . We also present several new constructions of such decompositions based on lexical matchings. In particular, we construct four pairwise edge-disjoint symmetric chain decompositions of the n-dimensional hypercube for any n ≥ 12 .