scientific article
From MaRDI portal
Publication:4074820
zbMath0314.94030MaRDI QIDQ4074820
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (31)
An exact characterization of saturation for permutation matrices ⋮ Pattern matching for permutations ⋮ Pattern avoidance of \([4,k\)-pairs in circular permutations] ⋮ On the least exponential growth admitting uncountably many closed permutation classes ⋮ Labelled well-quasi-order for permutation classes ⋮ An infinite antichain of planar tanglegrams ⋮ Permutations sortable by deques and by two stacks in parallel ⋮ Signed enumeration of upper-right corners in path shuffles ⋮ Sorting by shuffling methods and a queue ⋮ Sorting with networks of data structures ⋮ Permutations generated by token passing in graphs ⋮ Book embeddings of \(k\)-framed graphs and \(k\)-map graphs ⋮ Deque automata, languages, and planar graph representations ⋮ Stieltjes moment sequences for pattern-avoiding permutations ⋮ Permutations sortable by two stacks in parallel and quarter plane walks ⋮ Passing through a stack k times ⋮ Regular closed sets of permutations. ⋮ Operators of equivalent sorting power and related Wilf-equivalences ⋮ Generating permutations with restricted containers ⋮ Sorting twice through a stack ⋮ Pattern matching for permutations ⋮ Restricted permutations ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Permutations of a multiset avoiding permutations of length 3 ⋮ The enumeration of permutations sortable by pop stacks in parallel ⋮ Upper bounds on the queue number of \(k\)-ary \(n\)-cubes ⋮ Priority queues with binary priorities ⋮ Finding and counting permutations via CSPs ⋮ Passing through a stack \(k\) times with reversals ⋮ Inflations of geometric grid classes of permutations ⋮ Two-stack-sorting with pop stacks
This page was built for publication: