Results 31 to 40 of about 317,927 (261)
A Bijection on Classes Enumerated by the Schröder Numbers [PDF]
We consider a sorting machine consisting of two stacks in series where the first stack has the added restriction that entries in the stack must be in decreasing order from top to bottom.
Michael W. Schroeder, Rebecca Smith
doaj +1 more source
Given a set $Y$ of decreasing plane trees and a permutation $\pi$, how many trees in $Y$ have $\pi$ as their postorder? Using combinatorial and geometric constructions, we provide a method for answering this question for certain sets $Y$ and all ...
Colin Defant
doaj +1 more source
An Electroadhesive Paper Gripper With Application to a Document-Sorting Robot
Robotic process automation (RPA) is automating various job processes in many offices. However, most existing RPA systems automate only processes that are performed on computers. It is highly desirable to develop physical RPA systems that incorporate real
Hideaki Itoh +3 more
doaj +1 more source
Operators of equivalent sorting power and related Wilf-equivalences [PDF]
We study sorting operators $\textrm{A}$ on permutations that are obtained composing Knuth's stack sorting operator \textrmS and the reverse operator $\textrm{R}$, as many times as desired.
Michael Albert, Mathilde Bouvel
doaj +1 more source
Radiation shielding optimization of space reactor based on intelligent decision support system
BackgroundThe mass of a space nuclear power system is a critical parameter due to limitation of loading and high cost of transportation. The radiation shielding system is one of the main contributions of the self-weight of the space nuclear power system ...
HE Can +5 more
doaj +1 more source
t-Stack Sorting on the Permutahedron
In 1968, Knuth introduced the stack sorting algorithm which attempts to chronologically sort an inputted sequence, in our case a permutation. Using the stack sorting algorithm, we traverse the vertices and edges of the permutahedron.
McClung, Justin T +3 more
core +2 more sources
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
A Survey of Stack-Sorting Disciplines [PDF]
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
Permutations sortable by n-4 passes through a stack [PDF]
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
Box Selectivity in Different Container Cargo-handling Systems [PDF]
The box selectivity in operational stack of container terminal is a quite common and long studied question. The pure random choice is governed by the theory of probability offering some combinatorial estimations.
Alexander Kuznetsov +2 more
doaj +1 more source

