Related papers: Stack Sorting with Increasing and Decreasing Stack…
We study a generalization of the recently introduced order-preserving pattern matching, where instead of looking for an exact copy of the pattern, we only require that the relative order between the elements is the same. In our variant, we…
We investigate distributed memory parallel sorting algorithms that scale to the largest available machines and are robust with respect to input size and distribution of the input elements. The main outcome is that four sorting algorithms…
We define a class of partially labeled trees and use them to find simple proofs for two recent enumeration results of Colin Defant concerning stack-sorting preimages of permutation classes.
In this work, we consider ranking problems among a finite set of candidates: for instance, selecting the top-$k$ items among a larger list of candidates or obtaining the full ranking of all items in the set. These problems are often…
Differentiable sorting algorithms allow training with sorting and ranking supervision, where only the ordering or ranking of samples is known. Various methods have been proposed to address this challenge, ranging from optimal…
In this work we study $k$-type uniform Steiner bundles, being $k$ the lowest degree of the splitting. We prove sharp upper and lower bounds for the rank in the case $k=1$ and moreover we give families of examples for every allowed possible…
We introduce a partial order on the set of all reduced words of a given permutation $\omega$, called \emph{directed-braid poset} of $\omega$. This poset enables us to produce two algorithms: One is a sorting algorithm applied on any reduced…
We give a short proof for an explicit upper bound on the proportion of permutations of a given prime order $p$, acting on a finite set of given size $n$, which is sharp for certain $n$ and $p$. Namely, we prove that if $n\equiv k\pmod{p}$…
There has been a recent explosion in the size of stored data, partially due to advances in storage technology, and partially due to the growing popularity of cloud-computing and the vast quantities of data generated. This motivates the need…
We consider an assortment optimization problem under the multinomial logit choice model with general covering constraints. In this problem, the seller offers an assortment that should contain a minimum number of products from multiple…
Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors have shown that Patience Sorting provides an algorithmic description for…
We investigate the new, Turing-complete class of layered systems, whose lefthand sides of rules can only be overlapped at a multiset of disjoint or equal positions. Layered systems define a natural notion of rank for terms: the maximal…
Pancake flipping, a famous open problem in computer science, can be formalised as the problem of sorting a permutation of positive integers using as few prefix reversals as possible. In that context, a prefix reversal of length k reverses…
The scalar difference equation $x_{n+1}=f_{n}(x_{n},x_{n-1},...,x_{n-k})$ may exhibit symmetries in its form that allow for reduction of order through substitution or a change of variables. Such form symmetries can be defined generally…
Algorithms for searching and sorting data sets on quantum annealing systems are presented. Search algorithms for unordered data sets are developed. A sorting algorithm for data sets is provided, with a consideration of sort stability.…
Center-based clustering techniques are fundamental in some areas of machine learning such as data summarization. Generic $k$-center algorithms can produce biased cluster representatives so there has been a recent interest in fair $k$-center…
Merging-based sorting networks are an important family of sorting networks. Most merge sorting networks are based on 2-way or multi-way merging algorithms using 2-sorters as basic building blocks. An alternative is to use n-sorters, instead…
Inspired by a common technique for shuffling a deck of cards on a table without riffling, we continue the study of a prequel paper on the pile shuffle and its capabilities as a sorting device. We study two sort feasibility problems of…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…