scientific article
From MaRDI portal
Publication:3911404
zbMath0461.68060MaRDI QIDQ3911404
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Crystal pop-stack sorting and type \(A\) crystal lattices, Pop-stack-sorting for Coxeter groups, Labelled well-quasi-order for permutation classes, Stack-sorting for Coxeter groups, Sorting by shuffling methods and a queue, The Brownian limit of separable permutations, Sorting Cayley permutations with pattern-avoiding machines, \(k\)-pop stack sortable permutations and \(2\)-avoidance, Sorting with networks of data structures, The pop-stack-sorting operator on Tamari lattices, Counting Pop-Stacked Permutations in Polynomial Time, The infinite limit of separable permutations, The skew Brownian permuton: A new universality class for random constrained permutations, Product decompositions of the symmetric group induced by separable permutations, Ungarian Markov chains, Simple permutations and algebraic generating functions, Separable elements: linear extensions, graph associahedra, and splittings of Weyl groups, Asymptotics of principal evaluations of Schubert polynomials for layered permutations, Fertility monotonicity and average complexity of the stack-sorting map, A counterexample regarding labelled well-quasi-ordering, Separable elements and splittings of Weyl groups, Unnamed Item, A bijection between permutations and floorplans, and its applications, On the number of rectangulations of a planar point set, The enumeration of permutations sortable by pop stacks in parallel, Separable elements in Weyl groups, Enumerating permutations sortable by \(k\) passes through a pop-stack, Enumerating permutations sortable by \(k\) passes through a pop-stack, Meeting covered elements in \(\nu\)-Tamari lattices, On the Brownian separable permuton, Combinatorial generation via permutation languages. I. Fundamentals, Two-stack-sorting with pop stacks
