Star transposition Gray codes for multiset permutations

by   Petr Gregor, et al.

Given integers k≥ 2 and a_1,…,a_k≥ 1, let a:=(a_1,…,a_k) and n:=a_1+⋯+a_k. An a-multiset permutation is a string of length n that contains exactly a_i symbols i for each i=1,…,k. In this work we consider the problem of exhaustively generating all a-multiset permutations by star transpositions, i.e., in each step, the first entry of the string is transposed with any other entry distinct from the first one. This is a far-ranging generalization of several known results. For example, it is known that permutations (a_1=⋯=a_k=1) can be generated by star transpositions, while combinations (k=2) can be generated by these operations if and only if they are balanced (a_1=a_2), with the positive case following from the middle levels theorem. To understand the problem in general, we introduce a parameter Δ(a):=n-2max{a_1,…,a_k} that allows us to distinguish three different regimes for this problem. We show that if Δ(a)<0, then a star transposition Gray code for a-multiset permutations does not exist. We also construct such Gray codes for the case Δ(a)>0, assuming that they exist for the case Δ(a)=0. For the case Δ(a)=0 we present some partial positive results. Our 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. In particular, we prove that the middle levels graph is Hamilton-laceable.


page 2

page 3

page 23

page 26

page 30


Intersection graph of maximal stars

A biclique of a graph G is an induced complete bipartite subgraph of G s...

Approximating Star Cover Problems

Given a metric space (F ∪ C, d), we consider star covers of C with balan...

t-PIR Schemes with Flexible Parameters via Star Products of Berman Codes

We present a new class of private information retrieval (PIR) schemes th...

Complexity of Dependencies in Bounded Domains, Armstrong Codes, and Generalizations

The study of Armstrong codes is motivated by the problem of understandin...

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs

A k-colouring c of a graph G is a mapping V(G) to 1,2,... k such that c(...

CO-STAR: Conceptualisation of Stereotypes for Analysis and Reasoning

Warning: this paper contains material which may be offensive or upsettin...

On the central levels problem

The central levels problem asserts that the subgraph of the (2m+1)-dimen...

Please sign up or login with your details

Forgot password? Click here to reset