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. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a strengthened version of this conjecture over the complex numbers that amounts to separating the orbit closures of the determinant and padded permanent polynomials. In that paper it was also proposed to separate these orbit closures by exhibiting occurrence obstructions, which are irreducible representations of GL_ n^2 (C), which occur in one coordinate ring of the orbit closure, but not in the other. We prove that this approach is impossible. However, we do not rule out the general approach to the permanent versus determinant problem via multiplicity obstructions as proposed by Mulmuley and Sohoni.
Clearly, @math is bounded from above by the multiplicity @math of the partition @math in the plethysm @math . Kumar @cite_39 ruled out asymptotic considerations for the GCT-coefficients: assuming the Alon-Tarsi Conjecture @cite_35 , Kumar derived that @math for all @math and even @math . A similar conclusion, unconditional, although with less information on the stretching factor, was obtained in @cite_15 .
@cite_35 @cite_15 @cite_39
2148706005 2797574323 2083308781 2807350215
We prove that for any partition ( 1;:::; d2) of size ‘d there exists k 1 such that the tensor square of the irreducible representation of the symmetric group Sk‘d with respect to the rectangular partition (k‘;:::;k‘) contains the irreducible representation corresponding to the stretched partition (k 1;:::;k d 2). We also prove a related approximate version of this statement in which the stretching factor k is eectively bounded in terms of d. We further discuss the consequences for geometric complexity theory which provided the motivation for this work. In this paper we consider the large genus asymptotics for Masur-Veech volumes of arbitrary strata of Abelian differentials. Through a combinatorial analysis of an algorithm proposed in 2002 by Eskin-Okounkov to exactly evaluate these quantities, we show that the volume @math of a stratum indexed by a partition @math is @math as @math tends to @math . This confirms a prediction of Eskin-Zorich and generalizes some of the recent results of Chen-Moeller-Zagier and Sauvaget, who established these limiting statements in the special cases @math and @math , respectively. We also include an Appendix by Anton Zorich that uses our main result to deduce the large genus asymptotics for Siegel-Veech constants that count certain types of saddle connections. Let @math be a geometrically bounded symplectic manifold, @math be a closed, regular coisotropic submanifold, and @math be a Hamiltonian diffeomorphism. The main result of this article is that the number of leafwise fixed points of @math is bounded below by the sum of the Betti numbers of @math , provided that the Hofer distance between @math and the identity is small enough and the pair @math is non-degenerate. As an application, I prove a presymplectic non-embedding result. A version of the Arnold-Givental conjecture for coisotropic submanifolds is also discussed. We show that any language in nondeterministic time @math , where the number of iterated exponentials is an arbitrary function @math , can be decided by a multiprover interactive proof system with a classical polynomial-time verifier and a constant number of quantum entangled provers, with completeness @math and soundness @math , where the number of iterated exponentials is @math and @math is a universal constant. The result was previously known for @math and @math ; we obtain it for any time-constructible function @math . The result is based on a compression technique for interactive proof systems with entangled provers that significantly simplifies and strengthens a protocol compression result of Ji (STOC'17). As a separate consequence of this technique we obtain a different proof of Slofstra's recent result (unpublished) on the uncomputability of the entangled value of multiprover games. Finally, we show that even minor improvements to our compression result would yield remarkable consequences in computational complexity theory and the foundations of quantum mechanics: first, it would imply that the class MIP* contains all computable languages; second, it would provide a negative resolution to a multipartite version of Tsirelson's problem on the relation between the commuting operator and tensor product models for quantum correlations.