Schur polynomials do not have small formulas if the determinant does not
From MaRDI portal
Publication:6113104
DOI10.1007/s00037-023-00236-xMaRDI QIDQ6113104
Nutan Limaye, Prasad Chaugule, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan, Mrinal Kumar
Publication date: 10 July 2023
Published in: Computational Complexity (Search for Journal in Brave)
JacobianSchur polynomiallower boundTaylor expansiongeneralized Vandermonde determinantalgebraic independenceformula complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Homogeneous formulas and symmetric polynomials
- Complexity of tropical Schur polynomials
- On the ranks and border ranks of symmetric tensors
- On the number of reduced decompositions of elements of Coxeter groups
- Lower bounds on arithmetic circuits via partial derivatives
- Completeness and reduction in algebraic complexity theory
- On semiring complexity of Schur polynomials
- On the relative power of reduction notions in arithmetic circuit complexity
- On immanants of Jacobi-Trudi matrices and permutations with restricted position
- A symmetric function generalization of the chromatic polynomial of a graph
- Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
- Quantum spectrum testing
- On computing Schur functions and series thereof
- Rectangular Kronecker coefficients and plethysms in geometric complexity theory
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
- Arithmetic Circuits: A Chasm at Depth 3
- Fast Parallel Computation of Polynomials Using Few Processors
- Arithmetic Circuits: A survey of recent results and open questions
- Normal subgroup reconstruction and quantum computation using group representations
- Accurate Computations with Totally Nonnegative Matrices
- Diagonal Circuit Identity Testing and Lower Bounds
- Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
- Factorization of polynomials given by arithmetic branching programs
- Discovering the roots: uniform closure results for algebraic classes under factoring
- Accurate and efficient evaluation of Schur and Jack functions
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Depth-3 arithmetic circuits over fields of characteristic zero
- Subtraction-free complexity, cluster transformations, and spanning trees
This page was built for publication: Schur polynomials do not have small formulas if the determinant does not