Given an essential semilattice congruence $\equiv $ on the left weak order of a Coxeter
group $ W $, we define the Coxeter stack-sorting operator ${\bf S} _\equiv: W\to W $ by ${\bf …

We introduce consecutive-pattern-avoiding stack-sorting maps SC σ, which are natural
generalizations of West's stack-sorting map s and natural analogues of the classical-pattern …

Pattern avoiding machines were recently introduced by Claesson, Ferrari and the current
author to gain a better understanding of the classical $2 $-stacksort problem. In this paper …

In 1990, West initiated an extensive investigation of the stack-sorting map, a deterministic
version of Knuth's stack-sorting machine that acts on permutations. At first sight, this map …

The stack sort algorithm has been the subject of extensive study over the years. In this paper
we explore a generalized version of this algorithm where instead of avoiding a single …

Let s be West's stack-sorting map, and let s T be the generalized stack-sorting map, where
instead of being required to increase, the stack avoids subpermutations that are order …

1. Introduction Page 1 numerative ombinatorics pplications A Enumerative Combinatorics
and Applications ecajournal.haifa.ac.il ECA 3:1 (2023) Article #S2R7 https://doi.org/10.54550/ECA2023V3S1R7 …

Theorems relating permutations with objects in other fields of mathematics are often stated
in terms of avoided patterns. Examples include various classes of Schubert varieties from …

West's stack-sorting map involves a stack which avoids the permutation $21 $ consecutively.
Defant and Zheng extended this to a consecutive-pattern-avoiding stack-sorting map …

We introduce the stack-sorting map $\text {SC} _\sigma $ that sorts, in a right-greedy
manner, an input permutation through a stack that avoids some vincular pattern $\sigma …