On extremal permutations avoiding \(\omega_N=NN-1\dots 1\)
type: Item
instance of: scholarly article
title: On extremal permutations avoiding \(\omega_N=NN-1\dots 1\)
zbMATH Open document ID: 0952.05001
author: J.-Y. Fourré
author: Jean-Christophe Novelli
author: Daniel Krob
published in: European Journal of Combinatorics
publication date: 2001-01-14T00:00:00Z
review text: This paper studies permutations avoiding the pattern \(\omega_N= NN- 1\dots 1\). The authors show that the set of these permutations is an ideal in the weak Bruhat order and its maximal elements can be obtained from an automaton.
reviewed by: Du Ding-Zhu
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 1417654
zbMATH Keywords: permutations
zbMATH Keywords: pattern
zbMATH Keywords: Bruhat order
zbMATH Keywords: automaton
MaRDI profile type: Publication
full work available at URL: eujc.1999.0271
OpenAlex ID: W153404930
cites work: Pattern matching for permutations
cites work: Quantum GLn
cites work: Euler-Poincaré characteristic and polynomial representations of Iwahori-Hecke algebras
cites work: Permutations with forbidden subsequences and nonseparable planar maps
cites work: Symmetric functions and P-recursiveness
cites work: Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences
cites work: A \(q\)-analogue of \(U(\mathfrak{gl}(N+1))\), Hecke algebra, and the Yang-Baxter equation
cites work: Q5585020
cites work: Noncommutative symmetric functions. IV: Quantum linear groups and Hecke algebras at \(q=0\)
cites work: Q3975127
cites work: Asymptotic values for degrees associated with strips of Young diagrams
cites work: Longest Increasing and Decreasing Subsequences
cites work: Restricted permutations
DOI: 10.1006/EUJC.1999.0271
description: scientific article; zbMATH DE number 1417654