Bijective enumeration of permutations starting with a longest increasing subsequence
From MaRDI portal
Publication:4591360
zbMath1374.05037arXiv0905.2013MaRDI QIDQ4591360
Publication date: 14 November 2017
Full work available at URL: https://arxiv.org/abs/0905.2013
Related Items (2)
Signed mahonians on some trees and parabolic quotients ⋮ Counting permutations with no long monotone subsequence via generating trees and the kernel method
This page was built for publication: Bijective enumeration of permutations starting with a longest increasing subsequence