相关论文: Combinatorics of patience sorting piles

Knuth (1990) introduced the class of nested formulas and showed that their satisfiability can be decided in polynomial time. We show that, parameterized by the size of a smallest strong backdoor set to the target class of nested formulas,…

The classical linear ordering problem seeks a single ranking representing a given preference matrix. While suitable for homogeneous populations, it fails when observed preferences arise from several latent groups with distinct ranking…

We consider the problem of sorting elements on a series of stacks, introduced by Tarjan and Knuth. We improve the asymptotic lower bound for the number of stacks necessary to sort $n$ elements to $0.561 \log_2 n + O(1)$. This is the first…

This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…

We characterise and enumerate permutations that are sortable by n-4 passes through a stack. We conjecture the number of permutations sortable by n-5 passes, and also the form of a formula for the general case n-k, which involves a…

The starting point of this note is a decades-old yet little-noticed sufficient condition, presented by Sassenfeld in 1951, for the convergence of the classical Gauss-Seidel method. The purpose of the present paper is to shed new light on…

This paper establishes an analogue of the Robinson--Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers $(d,L)$, we construct a bijection between permutations that avoid the patterns $d\cdots 1…

We prove a new tableaux formula for the symmetric Macdonald polynomials $P_{\lambda}(X;q,t)$ that has considerably fewer terms and simpler weights than previously existing formulas. Our formula is a sum over certain sorted non-attacking…

In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first $r$ elements are in distinct blocks, respectively. We introduce a generalization of the Lah numbers. For…

An alternative and combinatorial proof is given for a connection between a system of Hahn polynomials and identities for symmetric elements in the Heisenberg algebra, which was first observed by Bender, Mead, and Pinsky [Phys. Rev. Lett. 56…

In 1986 J. Nuttall published in Constructive Approximation the paper "Asymptotics of generalized Jacobi polynomials", where with his usual insight he studied the behavior of the denominators ("generalized Jacobi polynomials") and the…

We extend and generalize many of the enumerative results concerning West's stack-sorting map $s$. First, we prove a useful theorem that allows one to efficiently compute $|s^{-1}(\pi)|$ for any permutation $\pi$, answering a question of…

We consider a large family of equivalence relations on permutations in Sn that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our most general setting, two permutations are equivalent if one…

We consider the problem of sorting $n$ items, given the outcomes of $m$ pre-existing comparisons. We present a simple and natural deterministic algorithm that runs in $O(m + \log T)$ time and does $O(\log T)$ comparisons, where $T$ is the…

We give an exposition of Schensted's algorithm to find the length of the longest increasing subword of a word in an ordered alphabet, and Greene's generalization of Schensted's results using Knuth equivalence. We announce a generalization…

Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…

We extend the notion of $k$-ribbon tableaux to the Fibonacci lattice, a differential poset defined by R. Stanley in 1975. Using this notion, we describe an insertion algorithm that takes $k$-colored permutations to pairs of $k$-ribbon…

We consider permutations sortable by $k$ passes through a deterministic pop stack. We show that for any $k\in\mathbb N$ the set is characterised by finitely many patterns, answering a question of Claesson and Gu{\dh}mundsson. Our…

One of the main research areas in Bayesian Nonparametrics is the proposal and study of priors which generalize the Dirichlet process. Here we exploit theoretical properties of Poisson random measures in order to provide a comprehensive…

The survey we are presenting is over 22 years old but it has still some ideas which where never published (except in Polish). This survey is the base of the third Chapter of my book: KNOTS: From combinatorics of knot diagrams to…