Constructing Faithful Homomorphisms over Fields of Finite Characteristic

12/26/2018
by   Prerona Chatterjee, et al.
0

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 (Information and Computing, 2013), and exploited by them, and Agrawal, Saha, Saptharishi and Saxena (Journal of Computing, 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 (MFCS, 2016), 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2020

Algebraic Hardness versus Randomness in Low Characteristic

We show that lower bounds for explicit constant-variate polynomials over...
research
04/04/2023

Determinantal Sieving

We introduce determinantal sieving, a new, remarkably powerful tool in t...
research
10/22/2020

Gaussoids are two-antecedental approximations of Gaussian conditional independence structures

The gaussoid axioms are conditional independence inference rules which c...
research
07/14/2021

A class of APcN power functions over finite fields of even characteristic

In this paper, we investigate the power functions F(x)=x^d over the fini...
research
11/28/2018

Constructions of involutions over finite fields

An involution over finite fields is a permutation polynomial whose inver...
research
01/02/2023

Computing square roots in quaternion algebras

We present an explicit algorithmic method for computing square roots in ...
research
02/06/2017

Characteristic polynomials of p-adic matrices

We analyze the precision of the characteristic polynomial of an n× n p-a...

Please sign up or login with your details

Forgot password? Click here to reset