# On a combinatorial generation problem of Knuth

@article{Merino2020OnAC,
title={On a combinatorial generation problem of Knuth},
author={Arturo I. Merino and Ondrej Micka and Torsten M{\"u}tze},
journal={SIAM J. Comput.},
year={2020},
volume={51},
pages={379-423}
}
• Published 14 July 2020
• Mathematics, Computer Science
• SIAM J. Comput.
The well-known middle levels conjecture asserts that for every integer $n\geq 1$, all binary strings of length $2(n+1)$ with exactly $n+1$ many 0s and 1s can be ordered cyclically so that any two consecutive strings differ in swapping the first bit with a complementary bit at some later position. In his book `The Art of Computer Programming Vol. 4A' Knuth raised a stronger form of this conjecture (Problem 56 in Section 2.1.3, Chapter 7), which requires that the sequence of positions with which…

## Figures from this paper

This survey provides a comprehensive picture of the state-of-the-art of the research on combinatorial Gray codes and gives an update on Savage’s influential survey, incorporating many more recent developments.
• Mathematics
STACS
• 2022
The proofs establish Hamilton-connectedness or Hamilton-laceability of the underlying flip graphs, and they answer several cases of a recent conjecture of Shen and Williams.
• Mathematics
MFCS
• 2022
. We say that a Hamilton cycle C = ( x 1 , . . . , x n ) in a graph G is k -symmetric, if the mapping x i 7→ x i + n/k for all i = 1 , . . . , n , where indices are considered modulo n , is an

## References

SHOWING 1-10 OF 52 REFERENCES

• Mathematics
• 2015
Recently, the famous middle levels conjecture was solved by Mütze. In this paper, we present a new generalized conjecture involving star-transpositions acting on multiset permutations with
• Mathematics
Algorithmica
• 2011
The set of permutations of 〈n〉={1,…,n} in one-line notation is Π(n). The shorthand encoding of a1⋯an∈Π(n) is a1⋯an−1. A shorthand universal cycle for permutations (SP-cycle) is a circular string of
• Mathematics
STACS
• 2022
The proofs establish Hamilton-connectedness or Hamilton-laceability of the underlying flip graphs, and they answer several cases of a recent conjecture of Shen and Williams.
• Computer Science
ICALP
• 2020
A Hamilton cycle is constructed through the $n$-dimensional hypercube that contains the symmetric chain decomposition constructed by Greene and Kleitman in the 1970s, and a loopless algorithm is provided for computing the corresponding Gray code.
• Mathematics
• 1993
Let x 1 x 2…xi xi+1 …xn be a permutation of {1,2,…,n} written in one line notation. An "i-adjacent interchange" applied to this permutation produces the permutation x 1 x 2…xi+1 xi …xn obtained from
• Mathematics
• 1988
For any positive integer k let B(k) denote the bipartite graph of k- and k+1-element subsets of a 2k+1-element set with adjacency given by containment. It has been conjectured that for all k, B(k) is