Related papers: In-situ associative permuting

The rank $n$ swapping algebra is the Poisson algebra defined on the ordered pairs of points on a circle using the linking numbers, where a subspace of $(\mathbb{K}^n \times \mathbb{K}^{n*})^r/\operatorname{GL}(n,\mathbb{K})$ is its…

The NP-complete Permutation Pattern Matching problem asks whether a $k$-permutation $P$ is contained in a $n$-permutation $T$ as a pattern. This is the case if there exists an order-preserving embedding of $P$ into $T$. In this paper, we…

In this paper we describe two simple, fast, space-efficient algorithms for finding all matches of an indeterminate pattern $p = p[1..m]$ in an indeterminate string $x = x[1..n]$, where both $p$ and $x$ are defined on a "small" ordered…

We present a sorting algorithm that works in-place, executes in parallel, is cache-efficient, avoids branch-mispredictions, and performs work O(n log n) for arbitrary inputs with high probability. The main algorithmic contributions are new…

Particles labelled $1,...,n$ are initially arranged in increasing order. Subsequently, each pair of neighboring particles that is currently in increasing order swaps according to a Poisson process of rate 1. We analyze the asymptotic…

Inspired by a recent note of Zeilberger (arXiv:1110.4379), Alejandro Morales asked whether one can count alternating (i.e., up-down) permutations that contain the pattern 123 or 321 exactly once. In this note we answer the question in the…

We introduce a class of metric spaces called $p$-additive combinations and show that for such spaces we may deduce information about their $p$-negative type behaviour by focusing on a relatively small collection of almost disjoint metric…

We propose a novel rank aggregation method based on converting permutations into their corresponding Lehmer codes or other subdiagonal images. Lehmer codes, also known as inversion vectors, are vector representations of permutations in…

Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…

This report presents adaptive artificial compression methods in which the time-step and artificial compression parameter $\varepsilon $ are independently adapted. The resulting algorithms are supported by analysis and numerical tests. The…

Let $s$ denote West's stack-sorting map. A permutation is called $t-\textit{sorted}$ if it is of the form $s^t(\mu)$ for some permutation $\mu$. We prove that the maximum number of descents that a $t$-sorted permutation of length $n$ can…

Permutation Pattern Matching (or PPM) is a decision problem whose input is a pair of permutations $\pi$ and $\tau$, represented as sequences of integers, and the task is to determine whether $\tau$ contains a subsequence order-isomorphic to…

Quantum deletions, which are harder to correct than erasure errors, occur in many realistic settings. It is therefore pertinent to develop quantum coding schemes for quantum deletion channels. To date, not much is known about which explicit…

Motivated by recent studies of large Mallows$(q)$ permutations, we propose a class of random permutations of $\mathbb{N}_{+}$ and of $\mathbb{Z}$, called regenerative permutations. Many previous results of the limiting Mallows$(q)$…

Quicksort is an instructive classroom approach to parallel sorting on distributed memory parallel computers with many opportunities for illustrating specific implementation alternatives and tradeoffs with common communication interfaces…

A ballot permutation is a permutation $\pi$ such that in any prefix of $\pi$ the descent number is not more than the ascent number. By using a reversal concatenation map, we give a formula for the joint distribution (pk, des) of the peak…

A modified trace for a finite k-linear pivotal category is a family of linear forms on endomorphism spaces of projective objects which has cyclicity and so-called partial trace properties. We show that a non-degenerate modified trace…

We develop a combinatorial approach to the quantum permutation algebras, as Hopf images of representations of type $\pi:A_s(n)\to B(H)$. We discuss several general problems, including the commutativity and cocommutativity ones, the…

Any permutation statistic $f:\sym\to\CC$ may be represented uniquely as a, possibly infinite, linear combination of (classical) permutation patterns: $f= \Sigma_\tau\lambda_f(\tau)\tau$. To provide explicit expansions for certain…

We define and study positional marked patterns, permutations $\tau$ where one of elements in $\tau$ is underlined. Given a permutation $\sigma$, we say that $\sigma$ has a $\tau$-match at position $i$ if $\tau$ occurs in $\sigma$ in such a…