Consider the graph that has as vertices all bitstrings of length 2n + 1 with exactly n or n + 1 entries equal to 1, and an edge between any two bitstrings that differ in exactly one bit. The well-known middle levels conjecture asserts that this graph has a Hamilton cycle for any n ≥ 1. In this paper we present a new proof of this conjecture, which is much shorter and more accessible than the original proof.
We studied winter climate influences on central European small herbivores by testing the prediction that direct physical effects of winter climate should be more pronounced in herbivores living above ground/snow than in subnivean/fossorial ones. Using correlation analysis and autoregressive modeling, we found that population growth rates of European hares, representing the former class of herbivores, are more efficiently predicted by the winter NAO index than those of common voles, representing the latter class of herbivores. We demonstrate that, whereas in hares the NAO index outperformed crop yield indices, used here as a proxy for plant production variability, it was crop yield indices that more effectively predicted population change in voles. These results suggest that the relative importance of direct and indirect effects of winter climate on herbivores may be related to their body size, the major determinant of above ground/snow or subnivean/fossorial mode of life.
Abstract. We consider the algorithmic problem of generating each subset of [n] := {1, 2, . . . , n} whose size is in some interval [k, l], 0 ≤ k ≤ l ≤ n, exactly once (cyclically) by repeatedly adding or removing a single element, or by exchanging a single element. For k = 0 and l = n this is the classical problem of generating all 2 n subsets of [n] by element additions/removals, and for k = l this is the classical problem of generating all n k subsets of [n] by element exchanges. We prove the existence of such cyclic minimum-change enumerations for a large range of values n, k, and l, improving upon and generalizing several previous results. For all these existential results we provide optimal algorithms to compute the corresponding Gray codes in constant O(1) time per generated set and O(n) space. Rephrased in terms of graph theory, our results establish the existence of (almost) Hamilton cycles in the subgraph of the n-dimensional cube Q n induced by all levels [k, l]. We reduce all remaining open cases to a generalized version of the middle levels conjecture, which asserts that the subgraph of Q 2k+1 induced by all levels [k − c, k + 1 + c], c ∈ {0, 1, . . . , k}, has a Hamilton cycle. We also prove an approximate version of this generalized conjecture, showing that this graph has a cycle that visits a (1 − o(1))-fraction of all vertices.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.