License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2019.11
URN: urn:nbn:de:0030-drops-115733
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11573/
Go to the corresponding LIPIcs Volume Portal


Chatterjee, Prerona ; Saptharishi, Ramprasad

Constructing Faithful Homomorphisms over Fields of Finite Characteristic

pdf-format:
LIPIcs-FSTTCS-2019-11.pdf (0.5 MB)


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. [Malte Beecken et al., 2013] and exploited by them and Agrawal et al. [Manindra Agrawal et al., 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 were unknown due to the failure of the Jacobian criterion over finite characteristic fields.
Building on a recent criterion of Pandey, Saxena and Sinhababu [Anurag Pandey et al., 2018], we construct explicit faithful maps for some natural classes of polynomials in fields of positive characteristic, 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, Mittmann and Saxena [Malte Beecken et al., 2013] and Agrawal, Saha, Saptharishi, Saxena [Manindra Agrawal et al., 2016] in the positive characteristic setting.

BibTeX - Entry

@InProceedings{chatterjee_et_al:LIPIcs:2019:11573,
  author =	{Prerona Chatterjee and Ramprasad Saptharishi},
  title =	{{Constructing Faithful Homomorphisms over Fields of Finite Characteristic}},
  booktitle =	{39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
  pages =	{11:1--11:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-131-3},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{150},
  editor =	{Arkadev Chattopadhyay and Paul Gastin},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2019/11573},
  URN =		{urn:nbn:de:0030-drops-115733},
  doi =		{10.4230/LIPIcs.FSTTCS.2019.11},
  annote =	{Keywords: Faithful Homomorphisms, Identity Testing, Algebraic Independence, Finite characteristic fields}
}

Keywords: Faithful Homomorphisms, Identity Testing, Algebraic Independence, Finite characteristic fields
Collection: 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)
Issue Date: 2019
Date of publication: 04.12.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI