Papers
Topics
Authors
Recent
Search
2000 character limit reached

Asymptotics of principal evaluations of Schubert polynomials for layered permutations

Published 11 May 2018 in math.CO | (1805.04341v1)

Abstract: Denote by $u(n)$ the largest principal specialization of the Schubert polynomial: $ u(n) := \max_{w \in S_n} \mathfrak{S}w(1,\ldots,1) $ Stanley conjectured in [arXiv:1704.00851] that there is a limit $\lim{n\to \infty} \, \frac{1}{n2} \log u(n), $ and asked for a limiting description of permutations achieving the maximum $u(n)$. Merzon and Smirnov conjectured in [arXiv:1410.6857] that this maximum is achieved on layered permutations. We resolve both Stanley's problems restricted to layered permutations.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.