Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient

Abstract

This article has been withdrawn because it has been merged with the earlier article GCT3 (arXiv: CS/0501076 [cs.CC]) in the series. The merged article is now available as: Geometric Complexity Theory III: on deciding nonvanishing of a Littlewood-Richardson Coefficient, Journal of Algebraic Combinatorics, vol. 36, issue 1, 2012, pp. 103-110. (Authors: Ketan Mulmuley, Hari Narayanan and Milind Sohoni) The new article in this GCT5 slot in the series is: Geometric Complexity Theory V: Equivalence between blackbox derandomization of polynomial identity testing and derandomization of Noether's Normalization Lemma, in the Proceedings of FOCS 2012 (abstract), arXiv:1209.5993 [cs.CC] (full version) (Author: Ketan Mulmuley)

This article has been withdrawn because it has been merged with the earlier article (GCT3) in the series, and a new article appears in this GCT5 slot now as shown in the abstract

References in corpus (1)

• Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients

Cited by in corpus (7)

• Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH
• Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry
• An overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP
• An introduction to geometric complexity theory
• On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view
• Geometric Complexity Theory: Introduction
• On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier