Related papers: A simple framework on sorting permutations
Distributions over permutations arise in applications ranging from multi-object tracking to ranking of instances. The difficulty of dealing with these distributions is caused by the size of their domain, which is factorial in the number of…
The process of DNA-based data storage (DNA storage for short) can be mathematically modelled as a communication channel, termed DNA storage channel, whose inputs and outputs are sets of unordered sequences. To design error correcting codes…
The current paper investigates the bounded distance decoding (BDD) problem for ensembles of lattices whose generator matrices have sub-Gaussian entries. We first prove that, for these ensembles the BDD problem is NP-hard in the worst case.…
Invariance-based randomization tests -- such as permutation tests, rotation tests, or sign changes -- are an important and widely used class of statistical methods. They allow drawing inferences under weak assumptions on the data…
A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show…
This paper introduces a new way to define a genome rearrangement distance, using the concept of mean first passage time from probability theory. Crucially, this distance estimate provides a genuine metric on genome space. We develop the…
Kondo et al. (DS 2014) proposed methods for computing distances between unordered rooted trees by transforming an instance of the distance computing problem into an instance of the integer programming problem. They showed that the tree edit…
In a recent breakthrough, Teyssier [Tey20] introduced a new method for approximating the distance from equilibrium of a random walk on a group. He used it to study the limit profile for the random transpositions card shuffle. His techniques…
The framework of postselection is becoming more and more important in various recent directions in Quantum Computation research. Postselection renders simple computational models able to perform general quantum computation. This was first…
This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…
A permutation array $A$ is a set of permutations on a finite set $\Omega$, say of size $n$. Given distinct permutations $\pi, \sigma\in \Omega$, we let $hd(\pi, \sigma) = |\{ x\in \Omega: \pi(x) \ne \sigma(x) \}|$, called the Hamming…
We review connections between coding-theoretic objects and sparse learning problems. In particular, we show how seemingly different combinatorial objects such as error-correcting codes, combinatorial designs, spherical codes, compressed…
In many interesting cases the reconstruction of a correct phylogeny is blurred by high mutation rates and/or horizontal transfer events. As a consequence a divergence arises between the true evolutionary distances and the differences…
In this paper, we propose a general framework that extends the theory of permutation patterns to higher dimensions and unifies several combinatorial objects studied in the literature. Our approach involves introducing the concept of a…
Associate to each sequence $A$ of integers (intending to represent packet IDs) a sequence of positive integers of the same length ${\mathcal M}(A)$. The $i$'th entry of ${\mathcal M}(A)$ is the size (at time $i$) of the smallest buffer…
A classical problem in comparative genomics is to compute the rearrangement distance, that is the minimum number of large-scale rearrangements required to transform a given genome into another given genome. While the most traditional…
The Hausdorff distance is a measure of (dis-)similarity between two sets which is widely used in various applications. Most of the applied literature is devoted to the computation for sets consisting of a finite number of points. This has…
The Robinson-Schensted correspondence can be viewed as a map from permutations to partitions. In this work, we study the number of inversions of permutations corresponding to a fixed partition $\lambda$ under this map. Hohlweg characterized…
Synthesis of DNA molecules offers unprecedented advances in storage technology. Yet, the microscopic world in which these molecules reside induces error patterns that are fundamentally different from their digital counterparts. Hence, to…
The commuting variety of matrices over a given field is a well-studied object in linear algebra and algebraic geometry. As a set, it consists of all pairs of square matrices with entries in that field that commute with one another. In this…