Computational complexity, Newton polytopes, and Schubert polynomials
From MaRDI portal
Publication:2306519
zbMath1436.05115arXiv1810.10361MaRDI QIDQ2306519
Robichaux Colleen, Yong Alexander, Anshul Adve
Publication date: 23 March 2020
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.10361
Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Grassmannians, Schubert varieties, flag manifolds (14M15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Classification of Levi-spherical Schubert varieties ⋮ An efficient algorithm for deciding vanishing of Schubert polynomial coefficients ⋮ Lattice polytopes from Schur and symmetric Grothendieck polynomials ⋮ The A-B-C-Ds of Schubert calculus ⋮ Computational complexity, Newton polytopes, and Schubert polynomials ⋮ Newton polytopes in algebraic combinatorics ⋮ Generalized permutahedra and Schubert calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- The complexity of stochastic games
- Some combinatorial properties of Schubert polynomials
- Balanced labellings and Schubert polynomials
- Schubert polynomials as integer point transforms of generalized permutahedra
- PRIMES is in P
- A symmetric function generalization of the chromatic polynomial of a graph
- Computational complexity, Newton polytopes, and Schubert polynomials
- Newton polytopes in algebraic combinatorics
- P, NP, and NP-Completeness
- Lattice problems in NP ∩ coNP
- The NP-Completeness of Some Edge-Partition Problems
- Every Prime Has a Succinct Certificate
This page was built for publication: Computational complexity, Newton polytopes, and Schubert polynomials
