Results 21 to 30 of about 344,156 (265)
Australas. J Comb., 2018 We introduce operators $\mathsf{hare}$ and $\mathsf{tortoise}$, which act on words as natural generalizations of West's stack-sorting map. We show that the heuristically slower algorithm $\mathsf{tortoise}$ can sort words arbitrarily faster than its counterpart $\mathsf{hare}$.
Colin Defant, Noah Kravitz
openaire +4 more sources
Stack-sorting for Coxeter groups
Combinatorial Theory, 2022 39 pages, 11 figures; to be published in Combinatorial ...
openaire +5 more sources
Design improvement of circular molten carbonate fuel cell stack through CFD Analysis [PDF]
, 2011 Molten carbonate fuel cell (MCFC) is a promising technology for distributed power generation. The core of an MCFC power generation unit is the stack, where various fuel cells are connected together in series and parallel in order to obtain the desired ...
Sciacovelli, Adriano +3 more
core +1 more source
On the Stack Number and the Queue Number of the Bubble-Sort Graph
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2016 Yuuki Tanaka
exaly +2 more sources
Crystal pop-stack sorting and type A crystal lattices [PDF]
European Journal of Combinatorics, 2022 16 pages, 4 ...
Colin Defant, Nathan Williams
openaire +4 more sources
Two-stack-sorting with pop stacks
Australas. J Comb., 2018 We consider the set of permutations that are sorted after two passes through a pop stack. We characterize these permutations in terms of forbidden patterns (classical and barred) and enumerate them according to the ascent statistic. Then we show these permutations to be in bijection with a special family of polyominoes.
Lara Pudwell, Rebecca Smith 0001
openaire +4 more sources
Sorting with Complete Networks of Stacks [PDF]
, 2008 Knuth introduced the problem of sorting with a sequence of stacks. Tarjan extended this idea to sorting with acyclic networks of stacks (and queues), where items to be sorted move from a source through the network to a sink while they may be stored temporarily at nodes (the stacks).
Felix G. König, Marco E. Lübbecke
openaire +1 more source
A Survey of Stack-Sorting Disciplines [PDF]
The Electronic Journal of Combinatorics, 2003 We review the various ways that stacks, their variations and their combinations, have been used as sorting devices. In particular, we show that they have been a key motivator for the study of permutation patterns. We also show that they have connections to other areas in combinatorics such as Young tableau, planar graph theory, and simplicial ...
openaire +2 more sources
, 1989 Photograph of the exhibition "Concentrations 21: Gael Stack," May 7-July 2, 1989, held at the Dallas Museum of ...
Dallas Museum of Art
core +4 more sources
Permutations sortable by n-4 passes through a stack [PDF]
, 2010 The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice through a stack ...
Steingrimsson, Einar +2 more
core +3 more sources