Counting signed vexillary permutations
From MaRDI portal
Abstract: We show that the number of signed permutations avoiding 1234 equals the number of signed permutations avoiding 2143 (also called vexillary signed permutations), resolving a conjecture by Anderson and Fulton. The main tool that we use is the generating tree developed by West. Many further directions are mentioned in the end.
Recommendations
Cites work
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- Enumerating \(r\)c-invariant permutations with no long decreasing subsequences
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Generating trees and the Catalan and Schröder numbers
- Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences
- Mahonian pairs
- Smoothness of Schubert varieties via patterns in root subsystems
- Symmetric functions and P-recursiveness
- Symmetric functions, Schubert polynomials and degeneracy loci. Transl. from the French by John R. Swallow
- Vexillary elements in the hyperoctahedral group
Cited in
(6)- Counting involutory, unimodal, and alternating signed permutations
- Vexillary signed permutations revisited
- Theta-vexillary signed permutations
- Signed countings of types B and D permutations and \(t,q\)-Euler numbers
- Enumeration of vexillary involutions which are equal to their mirror/complement
- Vexillary involutions are enumerated by Motzkin numbers
This page was built for publication: Counting signed vexillary permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221776)