{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article8984","name":"Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits","abstract":"The motivation for this work comes from two problems--test algebraic independence of arithmetic circuits over a field of small characteristic, and generalize the structural property of algebraic dependence used by (Kumar, Saraf CCC'16) to arbitrary fields. \r\n \r\nIt is known that in the case of zero, or large characteristic, using a classical criterion based on the Jacobian, we get a randomized poly-time algorithm to test algebraic independence. Over small characteristic, the Jacobian criterion fails and there is no subexponential time algorithm known. This problem could well be conjectured to be in RP, but the current best algorithm puts it in NP^#P (Mittmann, Saxena, Scheiblechner Trans.AMS'14). Currently, even the case of two bivariate circuits over F_2 is open. We come up with a natural generalization of Jacobian criterion, that works over all characteristic. The new criterion is efficient if the underlying inseparable degree is promised to be a constant. This is a modest step towards the open question of fast independence testing, over finite fields, posed in (Dvir, Gabizon, Wigderson FOCS'07).\r\n \r\nIn a set of linearly dependent polynomials, any polynomial can be written as a linear combination of the polynomials forming a basis. The analogous property for algebraic dependence is false, but a property approximately in that spirit is named as ``functional dependence'' in (Kumar, Saraf CCC'16) and proved for zero or large characteristic. We show that functional dependence holds for arbitrary fields, thereby answering the open questions in (Kumar, Saraf CCC'16). Following them we use the functional dependence lemma to prove the first exponential lower bound for locally low algebraic rank circuits for arbitrary fields (a model that strongly generalizes homogeneous depth-4 circuits). We also recover their quasipoly-time hitting-set for such models, for fields of characteristic smaller than the ones known before.\r\n \r\nOur results show that approximate functional dependence is indeed a more fundamental concept than the Jacobian as it is field independent. We achieve the former by first picking a ``good'' transcendence basis, then translating the circuits by new variables, and finally approximating them by truncating higher degree monomials. We give a tight analysis of the ``degree'' of approximation needed in the criterion. To get the locally low algebraic rank circuit applications we follow the known shifted partial derivative based methods.","keywords":["independence","transcendence","finite field","Hasse-Schmidt","Jacobian","differential","inseparable","circuit","identity testing","lower bound","depth-4","shifte"],"author":[{"@type":"Person","name":"Pandey, Anurag","givenName":"Anurag","familyName":"Pandey"},{"@type":"Person","name":"Saxena, Nitin","givenName":"Nitin","familyName":"Saxena"},{"@type":"Person","name":"Sinhababu, Amit","givenName":"Amit","familyName":"Sinhababu"}],"position":74,"pageStart":"74:1","pageEnd":"74:15","dateCreated":"2016-08-19","datePublished":"2016-08-19","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Pandey, Anurag","givenName":"Anurag","familyName":"Pandey"},{"@type":"Person","name":"Saxena, Nitin","givenName":"Nitin","familyName":"Saxena"},{"@type":"Person","name":"Sinhababu, Amit","givenName":"Amit","familyName":"Sinhababu"}],"copyrightYear":"2016","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2016.74","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":"http:\/\/eccc.hpi-web.de\/report\/2015\/194","isPartOf":{"@type":"PublicationVolume","@id":"#volume6261","volumeNumber":58,"name":"41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)","dateCreated":"2016-08-19","datePublished":"2016-08-19","editor":[{"@type":"Person","name":"Faliszewski, Piotr","givenName":"Piotr","familyName":"Faliszewski"},{"@type":"Person","name":"Muscholl, Anca","givenName":"Anca","familyName":"Muscholl"},{"@type":"Person","name":"Niedermeier, Rolf","givenName":"Rolf","familyName":"Niedermeier"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article8984","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6261"}}}