Skip to main content
MathOverflow

Return to Answer

Removed broken link, added link to the paper mentioned.
Source Link
Vince Vatter
Vince Vatter
  • 2.3k
  • 15
  • 32

Here's one idea. ForFor every permutation $\pi$ of length $n$, there are $n^2+1$ permutation of length $n+1$ containing $\pi$. However, once you look at permutations of length $n+2$, this quantity depends on $\pi$. RayIn their paper "Posets of matrices and permutations with forbidden subsequences", Ray and West gave a proof that for $\pi$ of length $n$ the number of permutations of length $n+2$ containing $\pi$ is $$ (n^4+2n^3+n^2+4n+4-2j)/2, $$ where $0\le j\le n-1$ depends on $\pi$. Perhaps you could give a description of this statistic in terms of patterns of $\pi$?

References and a bit more discussion can be found in this paper: http://www.math.ufl.edu/~vatter/publications/pp2007-problems/

Here's one idea. For every permutation $\pi$ of length $n$, there are $n^2+1$ permutation of length $n+1$ containing $\pi$. However, once you look at permutations of length $n+2$, this quantity depends on $\pi$. Ray and West gave a proof that for $\pi$ of length $n$ the number of permutations of length $n+2$ containing $\pi$ is $$ (n^4+2n^3+n^2+4n+4-2j)/2, $$ where $0\le j\le n-1$ depends on $\pi$. Perhaps you could give a description of this statistic in terms of patterns of $\pi$?

References and a bit more discussion can be found in this paper: http://www.math.ufl.edu/~vatter/publications/pp2007-problems/

Here's one idea. For every permutation $\pi$ of length $n$, there are $n^2+1$ permutation of length $n+1$ containing $\pi$. However, once you look at permutations of length $n+2$, this quantity depends on $\pi$. In their paper "Posets of matrices and permutations with forbidden subsequences", Ray and West gave a proof that for $\pi$ of length $n$ the number of permutations of length $n+2$ containing $\pi$ is $$ (n^4+2n^3+n^2+4n+4-2j)/2, $$ where $0\le j\le n-1$ depends on $\pi$. Perhaps you could give a description of this statistic in terms of patterns of $\pi$?

edited body
Source Link
Vince Vatter
Vince Vatter
  • 2.3k
  • 15
  • 32

Here's one idea. For every permutation $\pi$ of length $n$, there are $n^2+1$ permutation of length $n+1$ containing $\pi$. However, once you look at permutations of length $n+2$, this quantity depends on $\pi$. Ray and West gave a proof that for $\pi$ of length $n$ the number of permutations of length $n+2$ containing $\pi$ is $$ (n^4+2n^3+n^2+4n+4-2j)/2, $$ where $0\le j\le k-1$$0\le j\le n-1$ depends on $\pi$. Perhaps you could give a description of this statistic in terms of patterns of $\pi$?

References and a bit more discussion can be found in this paper: http://www.math.ufl.edu/~vatter/publications/pp2007-problems/

Here's one idea. For every permutation $\pi$ of length $n$, there are $n^2+1$ permutation of length $n+1$ containing $\pi$. However, once you look at permutations of length $n+2$, this quantity depends on $\pi$. Ray and West gave a proof that for $\pi$ of length $n$ the number of permutations of length $n+2$ containing $\pi$ is $$ (n^4+2n^3+n^2+4n+4-2j)/2, $$ where $0\le j\le k-1$ depends on $\pi$. Perhaps you could give a description of this statistic in terms of patterns of $\pi$?

References and a bit more discussion can be found in this paper: http://www.math.ufl.edu/~vatter/publications/pp2007-problems/

Here's one idea. For every permutation $\pi$ of length $n$, there are $n^2+1$ permutation of length $n+1$ containing $\pi$. However, once you look at permutations of length $n+2$, this quantity depends on $\pi$. Ray and West gave a proof that for $\pi$ of length $n$ the number of permutations of length $n+2$ containing $\pi$ is $$ (n^4+2n^3+n^2+4n+4-2j)/2, $$ where $0\le j\le n-1$ depends on $\pi$. Perhaps you could give a description of this statistic in terms of patterns of $\pi$?

References and a bit more discussion can be found in this paper: http://www.math.ufl.edu/~vatter/publications/pp2007-problems/

Bounty Ended with 75 reputation awarded by Henning Arnór Úlfarsson
Post Made Community Wiki
Source Link
Vince Vatter
Vince Vatter
  • 2.3k
  • 15
  • 32

Here's one idea. For every permutation $\pi$ of length $n$, there are $n^2+1$ permutation of length $n+1$ containing $\pi$. However, once you look at permutations of length $n+2$, this quantity depends on $\pi$. Ray and West gave a proof that for $\pi$ of length $n$ the number of permutations of length $n+2$ containing $\pi$ is $$ (n^4+2n^3+n^2+4n+4-2j)/2, $$ where $0\le j\le k-1$ depends on $\pi$. Perhaps you could give a description of this statistic in terms of patterns of $\pi$?

References and a bit more discussion can be found in this paper: http://www.math.ufl.edu/~vatter/publications/pp2007-problems/