2018/12/26 by Prerona Chatterjee, Chatterjee, Prerona, Ramprasad Saptharishi +1
Computer Science · Mathematics · #Advanced Differential Equations and Dynamical Systems #Algebraic Geometry and Number Theory #Coding theory and cryptography #Computational Complexity (cs.CC) #FOS: Computer and information sciences #I.1
paper · pdf · doi:10.48550/arxiv.1812.10249
openalex publication_date 2018/12/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the question of algebraic rank or transcendence degree preserving homomorphisms over finite fields. This concept was first introduced by Beecken, Mittmann and Saxena (2013), and exploited by them, and Agrawal, Saha, Saptharishi and Saxena (2016) 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, Sinhababu and Saxena (2018), 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. and Agrawal et al. in the positive characteristic setting.