Reduced word enumeration, complexity, and randomization

DOI10.37236/8560zbMath1491.05190arXiv1901.03247OpenAlexW2911153643MaRDI QIDQ2144333

Cara Monical, Alexander Yong, Benjamin Pankow

Publication date: 13 June 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.03247

zbMATH Keywords

set-valued tableauxBrill-Noether varietiesgeneral genus \(g\) curve

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Grassmannians, Schubert varieties, flag manifolds (14M15) Combinatorial aspects of algebraic geometry (05E14)

Related Items (3)

Bijecting hidden symmetries for skew staircase shapes ⋮ On the \(q\)-enumeration of barely set-valued tableaux and plane partitions ⋮ Approximate counting of standard set-valued tableaux

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutation patterns, Stanley symmetric functions, and generalized Specht modules
• The complexity of computing the permanent
• Poset edge densities, nearly reduced words, and barely set-valued tableaux
• Schubert polynomials and the Littlewood-Richardson rule
• On the number of reduced decompositions of elements of Coxeter groups
• Flags, Schubert polynomials, degeneracy loci, and determinantal formulas
• Some combinatorial properties of Schubert polynomials
• Noncommutative Schur functions and their applications
• Transition equations for isotropic flag manifolds.
• The sample size required in importance sampling
• Factorization of the Robinson-Schensted-Knuth correspondence
• Balanced tableaux
• A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians.
• Combinatorial aspects of the \(K\)-theory of Grassmannians
• An efficient algorithm for deciding vanishing of Schubert polynomial coefficients
• On the asymptotic statistics of the number of occurrences of multiple permutation patterns
• Stable Grothendieck polynomials and \(K\)-theoretic factor sequences
• On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• Mathematics and Computer Science: Coping with Finiteness
• Gröbner geometry of vertex decompositions and of flagged tableaux
• Approximating the permanent: A simple approach
• Quantum cohomology of partial flag manifolds
• Euler characteristics of Brill-Noether varieties
• The Hook Graphs of the Symmetric Group

This page was built for publication: Reduced word enumeration, complexity, and randomization