Related papers: Recursive Record Filtering and Longest Decreasing …

We consider the problem of determining the maximum number of moves required to sort a permutation of $[n]$ using cut-and-paste operations, in which a segment is cut out and then pasted into the remaining string, possibly reversed. We give…

We survey the theory of increasing and decreasing subsequences of permutations. Enumeration problems in this area are closely related to the RSK algorithm. The asymptotic behavior of the expected value of the length is(w) of the longest…

We investigate the variance of the length of the longest common subsequences of two independent random words of size $n$, where the letters of one word are i.i.d. uniformly drawn from $\{\alpha_1, \alpha_2, \cdots, \alpha_m\}$, while the…

We develop a random-matrix model of two-dimensional dielectric resonators which combines internal wave chaos with the deterministic Fresnel laws for reflection and refraction at the interfaces. The model is used to investigate the…

We present a new lossy compressor for discrete sources. For coding a source sequence $x^n$, the encoder starts by assigning a certain cost to each reconstruction sequence. It then finds the reconstruction that minimizes this cost and…

We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…

We study sorting algorithms based on randomized round-robin comparisons. Specifically, we study Spin-the-bottle sort, where comparisons are unrestricted, and Annealing sort, where comparisons are restricted to a distance bounded by a…

Let $F \subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\sigma$ in $S_n$ avoiding the set of patterns $F$. The Noonan-Zeilberger conjecture states that the sequence ${C_n(F)}$ is P-recursive.…

As DNA data storage moves closer to practical deployment, minimizing sequencing coverage depth is essential to reduce both operational costs and retrieval latency. This paper addresses the recently studied Random Access Problem, which…

We provide upper and lower bounds for the expected length $\mathbb E(L_{n,m})$ of the longest common pattern contained in $m$ random permutations of length $n$. We also address the tightness of the concentration of $L_{n,m}$ around $\mathbb…

An order-$s$ Davenport-Schinzel sequence over an $n$-letter alphabet is one avoiding immediate repetitions and alternating subsequences with length $s+2$. The main problem is to determine the maximum length of such a sequence, as a function…

Let S(1) be the segment [-1,1], and define the segments S(n) recursively in the following manner: let S(n+1) be the intersection of S(n) and a(n+1) + S(1), where the point a(n+1) is chosen randomly on the segment S(n) with uniform…

In this paper we consider the two-type Moran model with $N$ individuals. Each individual is assigned a resampling rate, drawn independently from a probability distribution ${\mathbb P}$ on ${\mathbb R}_+$, and a type, either $1$ or $0$.…

Consider two independent random strings having same length and taking values uniformly in a common finite alphabet. We study the order of the variance of the length of the longest common subsequences (LCS) of these strings when long blocks,…

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…

We study the emergence of correlations between $N$ components of the position of a diffusive walker in $N$ dimensions that starts at the origin and resets to previously visited sites with certain probabilities. This is equivalent to $N$…

There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…

Motivated by applications in in-vivo DNA storage, we study codes for correcting duplications. A reverse-complement duplication of length $k$ is the insertion of the reversed and complemented copy of a substring of length $k$ adjacent to its…

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

Let $r$ and $d$ be positive integers with $r<d$. Consider a random $d$-ary tree constructed as follows. Start with a single vertex, and in each time-step choose a uniformly random leaf and give it $d$ newly created offspring. Let ${\mathcal…