• Corpus ID: 2439011

Permanent versus determinant, obstructions, and Kronecker coefficients

@inproceedings{Burgisser2015PermanentVD,
  title={Permanent versus determinant, obstructions, and Kronecker coefficients},
  author={Peter Burgisser},
  year={2015}
}
We give an introduction to some of the recent ideas that go under the name “geometric complexity theory”. We first sketch the proof of the known upper and lower bounds for the determinantal complexity of the permanent. We then introduce the concept of a representation theoretic obstruction, which has close links to algebraic combinatorics, and we explain some of the insights gained so far. In particular, we address very recent insights on the complexity of testing the positivity of Kronecker… 

Figures from this paper

Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity Theory
TLDR
It is proved that the vanishing of rectangular Kronecker coefficients cannot be used to prove superpolynomial lower bounds on dc(perm), the determinantal complexity of the permanent polynomial.
No Occurrence Obstructions in Geometric Complexity Theory
TLDR
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP ws and VNP and it is proved that the approach to separating these orbit closures by exhibiting occurrence obstructions is impossible.
A Determinantal Identity for the Permanent of a Rank 2 Matrix
We prove an identity relating the permanent of a rank 2 matrix and the determinants of its Hadamard powers. When viewed in the right way, the resulting formula looks strikingly similar to an identity
The Computational Complexity of Plethysm Coefficients
TLDR
This work is the first to apply techniques from discrete tomography to the study of plethysm coefficients and derive new lower and upper bounds and in special cases even combinatorial descriptions for plethYSm coefficients, which the authors consider to be of independent interest.
POLYNOMIAL-TIME PLAINTEXT-RECOVERY ATTACK ON THE MATRIX-BASED KNAPSACK CIPHER
TLDR
The aim of the present paper is to propose a polynomial-time plaintext-recovery attack on the matrix-based knapsack cipher, a novel additively homomorphic asymmetric encryption scheme that can be considered broken and should not be used as a privacy tool.

References

SHOWING 1-10 OF 75 REFERENCES
Padded Polynomials, Their Cousins, and Geometric Complexity Theory
TLDR
This work establishes basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and proves asymptotic injectivity of the Foulkes–Howe map.
No Occurrence Obstructions in Geometric Complexity Theory
TLDR
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP ws and VNP and it is proved that the approach to separating these orbit closures by exhibiting occurrence obstructions is impossible.
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems
TLDR
The notion of a partially stable point in a reductive-group representation is introduced, which generalizes the notion of stability in geometric invariant theory due to Mumford and reduces fundamental lower bound problems in complexity theory to problems concerning infinitesimal neighborhoods of the orbits of partially stable points.
An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP≠VNP
We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant's algebraic
Explicit lower bounds via geometric complexity theory
We prove the lower bound R Mm) ≥ 3/2 m2-2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of Mulmuley and
On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect
TLDR
The experiments show that the lattice point algorithm is superior in practice to the standard techniques for computing multiplicities when the weights have large entries but small rank, and provide experimental evidence for two conjectured generalizations of the saturation property of Littlewood–Richardson coefficients.
Fundamental invariants of orbit closures
A quadratic bound for the determinant and permanent problem
The determinantal complexity of a polynomial f is defined here as the minimal size of a matrix M with affine entries such that f = det M. This function gives a minoration of the more traditional size
Geometric Complexity Theory VI : The flip via positivity Dedicated to Sri
TLDR
An approach based on positivity hypotheses in algebraic geometry and representation theory to implement the flip and thereby resolve the self referential paradox when the underlying field of computation is of characteristic zero.
Binary Determinantal Complexity
...
...