On extremal permutations avoiding \(\omega_N=NN-1\dots 1\)

DOI10.1006/eujc.1999.0271zbMath0952.05001OpenAlexW153404930MaRDI QIDQ1970072

Jean-Christophe Novelli, J.-Y. Fourré, Daniel Krob

Publication date: 14 January 2001

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1999.0271

zbMATH Keywords

permutationsBruhat orderpatternautomaton

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetric functions and P-recursiveness
• A \(q\)-analogue of \(U(\mathfrak{gl}(N+1))\), Hecke algebra, and the Yang-Baxter equation
• Noncommutative symmetric functions. IV: Quantum linear groups and Hecke algebras at \(q=0\)
• Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences
• Asymptotic values for degrees associated with strips of Young diagrams
• Euler-Poincaré characteristic and polynomial representations of Iwahori-Hecke algebras
• Permutations with forbidden subsequences and nonseparable planar maps
• Longest Increasing and Decreasing Subsequences
• Quantum GL_n
• Pattern matching for permutations
• Restricted permutations

This page was built for publication: On extremal permutations avoiding \(\omega_N=NN-1\dots 1\)