Skip to content
naulon
Not checkedNot checked for notices yet.

Highly sorted permutations with respect to a 312-avoiding stack

Yuji Choi, Yunseo Choi

Enumerative Combinatorics and Applications · 2023

doi:10.54550/eca2023v3s1r7 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Let s 312 be the generalized stack-sorting map, where instead of being required to increase, the stack avoids the pattern 312.In this note, we give a simple characterization of the set s n-2 312 (S n ) for all n, the consequence of which is that |s n-2 312 (S n )| = 2 n-1 + 1.As a corollary, we settle a conjecture by Defant and Zheng.

Abstract licence: CC BY-ND

References10

    10 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.