5 research outputs found
On the central levels problem
The \emph{central levels problem} asserts that the subgraph of the -dimensional hypercube induced by all bitstrings with at least many 1s and at most many 1s, i.e., the vertices in the middle levels, has a Hamilton cycle for any and .
This problem was raised independently by Buck and Wiedemann, Savage, Gregor and {\v{S}}krekovski, and by Shen and Williams, and it is a common generalization of the well-known \emph{middle levels problem}, namely the case , and classical binary Gray codes, namely the case .
In this paper we present a general constructive solution of the central levels problem.
Our results also imply the existence of optimal cycles through any sequence of consecutive levels in the -dimensional hypercube for any and .
Moreover, extending an earlier construction by Streib and Trotter, we construct a Hamilton cycle through the -dimensional hypercube, , that contains the symmetric chain decomposition constructed by Greene and Kleitman in the 1970s, and we provide a loopless algorithm for computing the corresponding Gray code
On the central levels problem
The central levels problem asserts that the subgraph of the (2m+1)-dimensional hypercube induced by all bitstrings with at least m+1-l many 1s and at most m+l many 1s, i.e., the vertices in the middle 2l levels, has a Hamilton cycle for any m>=1 and 1==1 and 1==2, that contains the symmetric chain decomposition constructed by Greene and Kleitman in the 1970s, and we provide a loopless algorithm for computing the corresponding Gray code
On a combinatorial generation problem of Knuth
The well-known middle levels conjecture asserts that for every integer , all binary strings of length with exactly 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~7.2.1.3), which requires that the sequence of positions with which the first bit is swapped in each step of such an ordering has blocks of the same length, and each block is obtained by adding (modulo ) to the previous block.
In this work, we prove Knuth's conjecture in a more general form, allowing for arbitrary shifts that are coprime to~.
We also present an algorithm to compute this ordering, generating each new bitstring in time, using memory in total
Combinatorial generation via permutation languages. V. Acyclic orientations
In 1993, Savage, Squire, and West described an inductive construction for generating every acyclic orientation of a chordal graph exactly once, flipping one arc at a time. We provide two generalizations of this result. Firstly, we describe Gray codes for acyclic orientations of hypergraphs that satisfy a simple ordering condition, which generalizes the notion of perfect elimination order of graphs. This unifies the Savage-Squire-West construction with a recent algorithm for generating elimination trees of chordal graphs. Secondly, we consider quotients of lattices of acyclic orientations of chordal graphs, and we provide a Gray code for them, addressing a question raised by Pilaud. This also generalizes a recent algorithm for generating lattice congruences of the weak order on the symmetric group. Our algorithms are derived from the Hartung-Hoang-M\"utze-Williams combinatorial generation framework, and they yield simple algorithms for computing Hamilton paths and cycles on large classes of polytopes, including chordal nestohedra and quotientopes. In particular, we derive an efficient implementation of the Savage-Squire-West construction. Along the way, we give an overview of old and recent results about the polyhedral and order-theoretic aspects of acyclic orientations of graphs and hypergraphs
Zigzagging through acyclic orientations of graphs and hypergraphs
In 1993, Savage, Squire, and West described an inductive construction for generating every acyclic orientation of a chordal graph exactly once, flipping one arc at a time.
We provide two generalizations of this result.
Firstly, we describe Gray codes for acyclic orientations of hypergraphs that satisfy a simple ordering condition, which generalizes the notion of perfect elimination order of graphs.
This unifies the Savage-Squire-West construction with a recent algorithm for generating elimination trees of chordal graphs (SODA~2022).
Secondly, we consider quotients of lattices of acyclic orientations of chordal graphs, and we provide a Gray code for them, addressing a question raised by Pilaud (FPSAC~2022).
This also generalizes a recent algorithm for generating lattice congruences of the weak order on the symmetric group (SODA~2020).
Our algorithms are derived from the Hartung-Hoang-M\"utze-Williams combinatorial generation framework, and they yield simple algorithms for computing Hamilton paths and cycles on large classes of polytopes, including chordal nestohedra and quotientopes.
In particular, we derive an efficient implementation of the Savage-Squire-West construction.
Along the way, we give an overview of old and recent results about the polyhedral and order-theoretic aspects of acyclic orientations of graphs and hypergraphs