The growth constant for the stack-sorting map
The growth constant for the stack-sorting map
Let be the symmetric group, let be the stack-sorting map, and let denote its maximum fiber size. The paper considers the exponential growth rate
Stack-sorting growth conjecture. The value of this limit lies in the interval .
The interval is suggested by computations on random permutations for and . The problem of obtaining improved asymptotic estimates, or exact formulas, remains open.
Sources & referencesView supporting material
Primary source
Colin Defant and James Propp, “Quantifying Noninvertibility in Discrete Dynamical Systems”, arXiv:2002.07144 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.