Results 91 to 100 of about 354,201 (259)
On the geometry of stack-sorting simplices
We show that all stack-sorting polytopes are simplices. Furthermore, we show that the stack-sorting polytopes generated from permutations of the form \(Ln1\) have relative volume 1. We establish an upper bound for the number of lattice points in a stack-sorting polytope.
Ake, Cameron +3 more
openaire +2 more sources
dynoGP: Deep Gaussian Processes for Dynamic System Identification
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli +3 more
wiley +1 more source
On Multi-stack Visibly Pushdown Languages
We contribute to the theory of formal languages of visibly multistack pushdown automata (MVPA). First, we show closure under the main operations and decidability of the main decision problems for the class of MVPA restricted to computations where a ...
Parlato, Gennaro +2 more
core +1 more source
Stack-Sorting with Dotted-Pattern-Avoiding Stacks
In this paper, we introduce the dotted pattern-avoiding map $s_{\dotτ}$, which avoids the dotted pattern $\dotτ$ instead of descents as West's stack-sorting map $s$ does. We also extend the pattern-avoiding machine, which is composed of a $σ$ avoiding map and West's stack-sorting map $s$, to the dotted pattern-avoiding machine.
Shieh, Hansen, Yang, Michael, Yu, Ashley
openaire +2 more sources
On the number of pancake stacks requiring four flips to be sorted
Using existing classification results for the 7- and 8-cycles in the pancake graph, we determine the number of permutations that require 4 pancake flips (prefix reversals) to be sorted. A similar characterization of the 8-cycles in the burnt pancake graph, due to the authors, is used to derive a formula for the number of signed permutations requiring 4
Saúl A. Blanco +2 more
openaire +4 more sources
The stability criteria affecting the formation of high‐entropy alloys, particularly focusing in supersaturated solid solutions produced by mechanical alloying, are analyzed. Criteria based on Hume–Rothery rules are distinguished from those derived from thermodynamic relations. The formers are generally applicable to mechanically alloyed samples.
Javier S. Blázquez +5 more
wiley +1 more source
Low‐cycle fatigue damage in Mn–Mo–Ni reactor pressure vessel steel is examined using a combined electron backscatter diffraction and positron annihilation lifetime spectroscopy approach. The study correlates texture evolution, dislocation substructure development, and vacancy‐type defect formation across uniform, necked, and fracture regions, providing
Apu Sarkar +2 more
wiley +1 more source
Stack sorting with increasing and decreasing stacks
Stack sorting with increasing and decreasing stacks. Many decreasing stacks followed by an increasing one. A left-greedy algorithm. An almost left-greedy algorithm.
Giulio Cerbai, Luca Ferrari
openaire +1 more source
Sorting permutations using a pop stack with a bypass
We introduce a new sorting device for permutations which makes use of a pop stack augmented with a bypass operation. This results in a sorting machine, which is more powerful than the usual Popstacksort algorithm and seems to have never been investigated previously.
Cioni, Lapo +2 more
openaire +5 more sources

