8 research outputs found
Permutations sortable by n-4 passes through a stack
We characterise and enumerate permutations that are sortable by n-4 passes
through a stack. We conjecture the number of permutations sortable by n-5
passes, and also the form of a formula for the general case n-k, which involves
a polynomial expression.Comment: 6 page
Revstack sort, zigzag patterns, descent polynomials of -revstack sortable permutations, and Steingr\'imsson's sorting conjecture
In this paper we examine the sorting operator . Applying
this operator to a permutation is equivalent to passing the permutation
reversed through a stack. We prove theorems that characterise -revstack
sortability in terms of patterns in a permutation that we call
patterns. Using these theorems we characterise those permutations of length
which are sorted by applications of for . We
derive expressions for the descent polynomials of these six classes of
permutations and use this information to prove Steingr\'imsson's sorting
conjecture for those six values of . Symmetry and unimodality of the descent
polynomials for general -revstack sortable permutations is also proven and
three conjectures are given
Deterministic stack-sorting for set partitions
A sock sequence is a sequence of elements, which we will refer to as socks,
from a finite alphabet. A sock sequence is sorted if all occurrences of a sock
appear consecutively. We define equivalence classes of sock sequences called
sock patterns, which are in bijection with set partitions. The notion of
stack-sorting for set partitions was originally introduced by Defant and
Kravitz. In this paper, we define a new deterministic stack-sorting map
for sock sequences that uses a -avoiding stack, where
pattern containment need not be consecutive. When , we show that
our stack-sorting map sorts any sock sequence with distinct socks in at
most iterations, and that this bound is tight for . We obtain a
fine-grained enumeration of the number of sock patterns of length on
distinct socks that are -stack-sortable under , and we also
obtain asymptotics for the number of sock patterns of length that are
-stack-sortable under . Finally, we show that for all unsorted
sock patterns , the map
cannot eventually sort all sock sequences on any multiset unless every sock
sequence on is already sorted