Neeraj Kayal
ABSTRACT
An m-variate polynomial f is said to be an affine projection of some n-variate polynomial g if there exists an nm matrix A and an n-dimensional vector b such that f(x)=g(Ax+b). In other words, if f can be obtained by replacing each variable of g by an affine combination of the variables occurring in f, then it is said to be an affine projection of g. Some well known problems (such as the determinant versus permanent and matrix multiplication for example) are instances of this problem. Given f and g can we determine whether f is an affine projection of g? The intention of this paper is to understand the complexity of the corresponding computational problem: given polynomials f and g find A and b such that f=g(Ax+b), if such an (Ab) exists. We first show that this is an NP-hard problem. We then focus our attention on instances where g is a member of some fixed, well known family of polynomials so that the input consists only of the polynomial f(x) having m variables and degree d. We consider the situation where f(x) is given to us as a blackbox (i.e. for any point aFm we can query the blackbox and obtain f(a) in one step) and devise randomized algorithms with running time poly(mnd) in the following special cases. Firstly where g is the Permanent (respectively the Determinant) of an nxn matrix and A is of rank n2. Secondly where g is the sum of powers polynomial (respectively the sum of products polynomial), and A is a random matrix of the appropriate dimensions (also d should not be too small).
Supplemental Material
- S. Aaronson. Arithmetic natural proofs theory is sought. available at http://scottaaronson.com/blog/?p=336, 2008.Google Scholar
- S. Aaronson and D. van Melkebeek. A note on circuit lower bounds from derandomization. Electronic Colloquium on Computational Complexity (ECCC), 17:105, 2010.Google Scholar
- M. Agrawal. Determinant versus permanent. In Proceedings of the International Congress of Mathematicians (ICM), pages 1409--1421, 2006.Google Scholar
- M. Agrawal and N. Saxena. Equivalence of F-algebras and cubic forms. In Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, pages 115--126, 2006. Google ScholarDigital Library
- B. Alexeev, M. Forbes, and J. Tsimerman. Tensor rank: Some lower and upper bounds. In CCC, 2011. Google ScholarDigital Library
- V. Arvind, P. Mukhopadhyay, and S. Srinivasan. New results on noncommutative and commutative polynomial identity testing. Computational Complexity, 19(4):521--558, 2010. Google ScholarDigital Library
- A. Bernardi, A. Gimigliano, and M. Idà. Computing symmetric rank for symmetric tensors. Journal of Symbolic Computation, 46:34--53, 2009. Google ScholarDigital Library
- P. Botta. Linear transformations that preserve the permanent. Proceedings of the American Mathematical Society, 18:566--569, 1967.Google ScholarCross Ref
- P. Burgisser. Completeness and Reduction in Algebraic Complexity Theory. Algorithms and Computation in Mathematics. Springer, 2000. Google ScholarDigital Library
- P. Burgisser and C. Ikenmeyer. Geometric complexity theory and tensor rank. In STOC, 2011. Google ScholarDigital Library
- J.-Y. Cai, X. Chen, and D. Li. A quadratic lower bound for the permanent and determinant problem over any characteristic $\ne$ 2. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pages 491--498, 2008. Google ScholarDigital Library
- X. Chen, N. Kayal, and A. Wigderson. Partial derivatives in arithmetic complexity. Foundations and Trends in Theoretical Computer Science, 2011. Google ScholarDigital Library
- P. Comon, G. Golub, L.-H. Lim, and B. Mourrain. Symmetric tensors and symmetric tensor rank. SIAM J. Matrix Anal. Appl., 30:1254--1279, September 2008. Google ScholarDigital Library
- J. Dieudonné. Sur une generalisation du groupe orthogonal a quatre variables. Archiv Der Math., 1:282--287, 1948.Google ScholarCross Ref
- R. Ehrenborg and G.-C. Rota. Apolarity and canonical forms for homogeneous polynomials. Eur. J. Comb., 14(3):157--181, 1993. Google ScholarDigital Library
- W. J. Ellison. A 'waring's problem' for homogeneous forms. Proceedings of the Cambridge Philosophical Society, 65:663--672, 1969.Google ScholarCross Ref
- G. Frobenius. Ueber die darstellung der endlichen gruppen durch linearc substitutionen. Sitzungber. der Berliner Akademie, 7:994--1015, 1897.Google Scholar
- D. Grigoriev and M. Karpinski. An exponential lower bound for depth 3 arithmetic circuits. In STOC, pages 577--582, 1998. Google ScholarDigital Library
- D. Grigoriev and A. A. Razborov. Exponential complexity lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. In FOCS, pages 269--278, 1998. Google ScholarDigital Library
- A. Gupta, N. Kayal, and S. Lokam. Reconstruction of depth-4 multilinear circuits with top fan-in 2. submitted.Google Scholar
- B. Hall. Lie Groups, Lie Algebras, and Representations. Springer-Verlag, NewYork, 2007.Google Scholar
- J. Håstad. Tensor rank is np-complete. J. Algorithms, 11:644--654, December 1990. Google ScholarDigital Library
- V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity, 13(1/2):1--46, 2004. Google ScholarDigital Library
- E. Kaltofen. Factorization of polynomials given by straight-line programs. Randomness and Computation, 5:375--412, 1989.Google Scholar
- S. Kantor. Théorie der aquivalenz von linearen ínfty lambda- scharen bilinearer formen. Sitzungber. der Münchener Akademie, 2:367--381, 1897.Google Scholar
- Z. S. Karnin and A. Shpilka. Reconstruction of generalized depth-3 arithmetic circuits with bounded top fan-in. In IEEE Conference on Computational Complexity, pages 274--285, 2009. Google ScholarDigital Library
- R. Karp. Reducibility among combinaorial problems. In Complexity of Computer Computations, pages 85--103, 1972.Google ScholarCross Ref
- N. Kayal. Efficient algorithms for some special cases of the polynomial equivalence problem. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1409--1421, 2011. Google ScholarDigital Library
- A. Kirillov. An introduction to Lie Groups and Lie Algebras. Cambridge University Press, Cambridge, 2008. Google ScholarDigital Library
- J. Kleppe. Representing a homogeneous polynomial as a sum of powers of linear forms. Master's thesis, University Of Oslo, 1999.Google Scholar
- E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, Cambridge, 1997. Google ScholarDigital Library
- J. M. Landsberg. The Geometry of Tensors, volume 128 of Graduate Studies in Mathematics. American Mathematical Society, 2012.Google Scholar
- M. Marcus and F. May. The permanent function. Canadian Journal of Math., 14:177--189, 1962.Google ScholarCross Ref
- M. Marcus and B. N. Moyls. Linear transformations on algebras of matrices. Canadian Journal of Math., 11:61--66, 1959.Google ScholarCross Ref
- M. Marcus and R. Purves. Linear transformations on algebras of matrices: the invariance of the elementary symmetric functions. Canadian Journal of Math., 11:383--396, 1959.Google ScholarCross Ref
- T. Mignon and N. Ressayre. A quadratic bound for the determinant and permanent problem. International Mathematics Research Notices, pages 4241--4253, 2004.Google Scholar
- K. Morita. Schwarz's lemma in a homogeneous space of higher dimensions. Japanese Journal of Math, 19:45--46, 1944.Google ScholarCross Ref
- K. Mulmuley and M. A. Sohoni. Geometric complexity theory i: An approach to the p vs. np and related problems. SIAM J. Comput., 31(2):496--526, 2001. Google ScholarDigital Library
- J. Patarin. Hidden field equations (HFE) and isomorphisms of polynomials (IP): Two new families of asymmetric algorithms. In Advances in Cryptology -- EUROCRYPT 1996, pages 33--48, 1996. Google ScholarDigital Library
- R. Raz. Tensor-rank and lower bounds for arithmetic formulas. In STOC, pages 659--666, 2010. Google ScholarDigital Library
- I. Schur. Einige bemerkungen zur determinantentheorie. der Preussischen Akademie der Wissenschaften zu Berlin, 25:454--463, 1925.Google Scholar
- A. Shpilka. Affine projections of symmetric polynomials. Journal of Computer and System Sciences, 65(4):639--659, 2002. Google ScholarDigital Library
- A. Shpilka. Interpolation of depth-3 arithmetic circuits with two multiplication gates. In STOC, pages 284--293, 2007. Google ScholarDigital Library
- A. Shpilka and A. Yehudayoff. Arithmetic circuits: A survey of recent results and open questions. Foundations and Trends in Theoretical Computer Science, 5:207--388, March 2010. Google ScholarDigital Library
- V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354--356, 1969.Google ScholarDigital Library
Index Terms
- Affine projections of polynomials: extended abstract
Recommendations
Homogeneous multivariate polynomials with the half-plane property
A polynomial P in n complex variables is said to have the ''half-plane property'' (or Hurwitz property) if it is nonvanishing whenever all the variables lie in the open right half-plane. Such polynomials arise in combinatorics, reliability theory, ...
Bivariate affine Gončarov polynomials
Bivariate Gončarov polynomials are a basis of the solutions of the bivariate Gončarov Interpolation Problem in numerical analysis. A sequence of bivariate Gončarov polynomials is determined by a set of nodes Z = { ( x i , j , y i , j ) ź R 2 } and is an ...
On Computing the Resultant of Generic Bivariate Polynomials
ISSAC '18: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic ComputationAn algorithm is presented for computing the resultant of two generic bivariate polynomials over a field K. For such p and q K[x,y] both of degree d in x and n in y , the algorithm computes the resultant with respect to y using (n2 - 1/ømega d) 1+o(1) ...
Comments