Abstract
We study the question of algebraic rank or transcendence degree preserving homomorphisms over finite fields. This concept was first introduced by Beecken et al. [3] and exploited by them, and Agrawal et al. [2] to design algebraic independence–based identity tests using the Jacobian criterion over characteristic zero fields. An analogue of such constructions over finite characteristic fields was unknown due to the failure of the Jacobian criterion over finite characteristic fields.
Building on a recent criterion of Pandey et al. [15], we construct explicit faithful maps for some natural classes of polynomials in the positive characteristic field setting, when a certain parameter called the inseparable degree of the underlying polynomials is bounded (this parameter is always 1 in fields of characteristic zero). This presents the first generalisation of some of the results of Beecken et al. [3] and Agrawal et al. [2] in the positive characteristic setting.
- [1] . 2003. Primality and identity testing via Chinese remaindering. J. ACM 50, 4 (2003), 429–443. Google Scholar
Digital Library
- [2] . 2016. Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits. SIAM J. Comput. 45, 4 (2016), 1533–1562. Google Scholar
Digital Library
- [3] . 2013. Algebraic independence and blackbox identity testing. Inf. Comput. 222 (2013), 2–19. Google Scholar
Digital Library
- [4] . 1978. A Probabilistic Remark on Algebraic Program Testing. Inf. Process. Lett. 7, 4 (1978), 193–195. Google Scholar
Cross Ref
- [5] . 2008. Deterministic extractors for affine sources over large fields. Comb. 28, 4 (2008), 415–440. Google Scholar
Digital Library
- [6] . 2019. Algebraic dependencies and PSPACE algorithms in approximative complexity over any field. Theory Comput. 15 (2019), 1–30. Google Scholar
Cross Ref
- [7] . 1993. Algebra: A Graduate Course, Vol. 100. American Mathematical Society.Google Scholar
- [8] . 1841. De determinantibus functionalibus. Journal für die reine und angewandte Mathematik 22 (1841), 319–359. http://eudml.org/doc/147138.Google Scholar
Cross Ref
- [9] . 2009. The complexity of the annihilating polynomial. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009. 184–193. Google Scholar
Digital Library
- [10] . 2001. Randomness efficient identity testing of multivariate polynomials. In Proceedings of 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, , , and (Eds.). ACM, 216–223. Google Scholar
Digital Library
- [11] . 2007. Advanced Algebra. Springer Science & Business Media.Google Scholar
Digital Library
- [12] . 2017. Arithmetic circuits with locally low algebraic rank. Theory of Computing 13, 1 (2017), 1–33. Google Scholar
Cross Ref
- [13] . 1922. Über höhere Kongruenzen. Norsk Mat. Forenings Skrifter 1, 7 (1922), 15.Google Scholar
- [14] . 1992. Matroid theory. Oxford University Press.Google Scholar
- [15] . 2018. Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits. Comput. Complex. 27, 4 (2018), 617–670. Google Scholar
Digital Library
- [16] . 1980. Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 4 (1980), 701–717. Google Scholar
Digital Library
- [17] . 1979. Probabilistic algorithms for sparse polynomials. In Symbolic and Algebraic Computation, EUROSAM’79, An International Symposium on Symbolic and Algebraic Computation, Marseille, France, June 1979, Proceedings(
Lecture Notes in Computer Science , Vol. 72), (Ed.). Springer, 216–226. Google ScholarCross Ref
Index Terms
Constructing Faithful Homomorphisms over Fields of Finite Characteristic
Recommendations
Schur Polynomials Do Not Have Small Formulas If the Determinant does not
AbstractSchur Polynomials are families of symmetric polynomials that have been classically studied in Combinatorics and Algebra alike. They play a central role in the study of symmetric functions, in Representation theory Stanley (1999), in Schubert calculus ...
Computing split maximal toral subalgebras of Lie algebras over fields of small characteristic
Important subalgebras of a Lie algebra of an algebraic group are its toral subalgebras, or equivalently (over fields of characteristic 0) its Cartan subalgebras. Of great importance among these are ones that are split: their action on the Lie algebra ...
Schur polynomials do not have small formulas if the determinant doesn't
CCC '20: Proceedings of the 35th Computational Complexity ConferenceSchur Polynomials are families of symmetric polynomials that have been classically studied in Combinatorics and Algebra alike. They play a central role in the study of Symmetric functions, in Representation theory [39], in Schubert calculus [26] as well ...






Comments