Combinatorics of Fulton's essential set
type: Item
instance of: scholarly article
title: Combinatorics of Fulton's essential set
zbMATH Open document ID: 0859.05003
DOI: 10.1215/S0012-7094-96-08502-6
author: Kimmo Eriksson
author: Svante Linusson
published in: Duke Mathematical Journal
publication date: 1997-04-07T00:00:00Z
review text: Our first result, in Section 3, is an elementary algorithm that retrieves a permutation from its ranked essential set. The algorithm is flexible, in that the input set may be bigger and include any other squares, as well as be smaller as long as it contains a certain ``core'' of the essential set. By this flexibility, the algorithm ought to be useful as a practical tool. In general, the core is much smaller than the essential set, so this is a significant strengthening. \textit{W. Fulton} [Duke Math. J. 65, No. 3, 381-420 (1992; Zbl 0788.14044)] used the essential sets mainly for vexillary (2143-avoiding) permutations. He gave a characterization of the ranked essential set for vexillary permutations, which may be expressed by three simple conditions, and he pointed out that it might be useful to have an analogous characterization of the ranked sets of squares that arise as ranked essential sets of all permutations. As an application of the algorithm, we are able to state such a characterization, which keeps two of Fulton's three conditions for the vexillary case and replaces the third one with a new and, alas, more complicated condition. We also remark on how the algorithm can be used directly to determine if a given ranked set contains the essential set of a permutation. This is done in Section 4. In Section 5, we use a combinatorial technique to describe several classes of permutations in terms of their essential set. For example, the Baxter permutations are precisely those whose essential set has at most one square in each row and column. Another example is 321-avoiding vexillary permutations, which can be described as having the essential set entirely contained in one row or in one column. As a corollary we obtain a direct interpretation of the formula for the number of 321-avoiding vexillary permutations of \textit{S. C. Billey}, \textit{W. Jockusch} and \textit{R. P. Stanley} [J. Algebr. Comb. 2, No. 4, 345-374 (1993; Zbl 0790.05093)]. In Section 6 we discuss …
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05B20
Mathematics Subject Classification ID: 14M15
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 949884
zbMATH Keywords: algorithm
zbMATH Keywords: ranked essential set
zbMATH Keywords: Baxter permutations
zbMATH Keywords: vexillary permutations
zbMATH Keywords: matrices
zbMATH Keywords: arrays
zbMATH Keywords: minors
MaRDI profile type: Publication
cites work: On Fixed Points of the Composite of Commuting Functions
cites work: Some combinatorial properties of Schubert polynomials
cites work: The number of Baxter permutations
cites work: Shuffle of parenthesis systems and Baxter permutations
cites work: The size of Fulton's essential set
cites work: Flags, Schubert polynomials, degeneracy loci, and determinantal formulas
cites work: Q3129746
cites work: Q4293510
cites work: Q3975127
cites work: Q4170734
full work available at URL: s0012-7094-96-08502-6
OpenAlex ID: W2001982243
Recommended article: More combinatorics of Fulton's essential set
Recommended article: Elementary characterization of essential \({\mathscr{F}} \)-sets and its combinatorial consequences
Recommended article: Q4648771
Recommended article: Q4764111
Recommended article: Q3741626
Recommended article: Combinatorial Dichotomies in Set Theory
Recommended article: Q4383903
Recommended article: Combinatorial set theory
Recommended article: Q4440997
Recommended article: Basis problems in combinatorial set theory
description: scientific article; zbMATH DE number 949884