652 research outputs found
Random Sorting Networks
A sorting network is a shortest path from 12...n to n...21 in the Cayley
graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform
random sorting network, as n->infinity the space-time process of swaps
converges to the product of semicircle law and Lebesgue measure. We conjecture
that the trajectories of individual particles converge to random sine curves,
while the permutation matrix at half-time converges to the projected surface
measure of the 2-sphere. We prove that, in the limit, the trajectories are
Holder-1/2 continuous, while the support of the permutation matrix lies within
a certain octagon. A key tool is a connection with random Young tableaux.Comment: 38 pages, 12 figure
Hardness of Token Swapping on Trees
Given a graph where every vertex has exactly one labeled token, how can we most quickly execute a given permutation on the tokens? In (sequential) token swapping, the goal is to use the shortest possible sequence of swaps, each of which exchanges the tokens at the two endpoints of an edge of the graph. In parallel token swapping, the goal is to use the fewest rounds, each of which consists of one or more swaps on the edges of a matching. We prove that both of these problems remain NP-hard when the graph is restricted to be a tree.
These token swapping problems have been studied by disparate groups of researchers in discrete mathematics, theoretical computer science, robot motion planning, game theory, and engineering. Previous work establishes NP-completeness on general graphs (for both problems), constant-factor approximation algorithms, and some poly-time exact algorithms for simple graph classes such as cliques, stars, paths, and cycles. Sequential and parallel token swapping on trees were first studied over thirty years ago (as "sorting with a transposition tree") and over twenty-five years ago (as "routing permutations via matchings"), yet their complexities were previously unknown.
We also show limitations on approximation of sequential token swapping on trees: we identify a broad class of algorithms that encompass all three known polynomial-time algorithms that achieve the best known approximation factor (which is 2) and show that no such algorithm can achieve an approximation factor less than 2
IST Austria Thesis
This thesis considers two examples of reconfiguration problems: flipping edges in edge-labelled triangulations of planar point sets and swapping labelled tokens placed on vertices of a graph. In both cases the studied structures – all the triangulations of a given point set or all token placements on a given graph – can be thought of as vertices of the so-called reconfiguration graph, in which two vertices are adjacent if the corresponding structures differ by a single elementary operation – by a flip of a diagonal in a triangulation or by a swap of tokens on adjacent vertices, respectively. We study the reconfiguration of one instance of a structure into another via (shortest) paths in the reconfiguration graph.
For triangulations of point sets in which each edge has a unique label and a flip transfers the label from the removed edge to the new edge, we prove a polynomial-time testable condition, called the Orbit Theorem, that characterizes when two triangulations of the same point set lie in the same connected component of the reconfiguration graph. The condition was first conjectured by Bose, Lubiw, Pathak and Verdonschot. We additionally provide a polynomial time algorithm that computes a reconfiguring flip sequence, if it exists. Our proof of the Orbit Theorem uses topological properties of a certain high-dimensional cell complex that has the usual reconfiguration graph as its 1-skeleton.
In the context of token swapping on a tree graph, we make partial progress on the problem of finding shortest reconfiguration sequences. We disprove the so-called Happy Leaf Conjecture and demonstrate the importance of swapping tokens that are already placed at the correct vertices. We also prove that a generalization of the problem to weighted coloured token swapping is NP-hard on trees but solvable in polynomial time on paths and stars
A New Upper Bound for the Diameter of the Cayley Graph of a Symmetric Group
Given a finite symmetric group S_n and a set S of generators, we can represent the group as a Cayley graph. The diameter of the Cayley graph is the largest distance from the identity to any other elements. We work on the conjecture that the diameter of the Cayley graph of a finite symmetric group S_n with S ={(12),(12...n)} is at most $ C(n,2). Our main result is to show that the diameter of the graph of S_n is at most (3n^2-4n)/2
Group-theoretic models of the inversion process in bacterial genomes
The variation in genome arrangements among bacterial taxa is largely due to
the process of inversion. Recent studies indicate that not all inversions are
equally probable, suggesting, for instance, that shorter inversions are more
frequent than longer, and those that move the terminus of replication are less
probable than those that do not. Current methods for establishing the inversion
distance between two bacterial genomes are unable to incorporate such
information. In this paper we suggest a group-theoretic framework that in
principle can take these constraints into account. In particular, we show that
by lifting the problem from circular permutations to the affine symmetric
group, the inversion distance can be found in polynomial time for a model in
which inversions are restricted to acting on two regions. This requires the
proof of new results in group theory, and suggests a vein of new combinatorial
problems concerning permutation groups on which group theorists will be needed
to collaborate with biologists. We apply the new method to inferring distances
and phylogenies for published Yersinia pestis data.Comment: 19 pages, 7 figures, in Press, Journal of Mathematical Biolog
- …