Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Preprint
Data sources: ZENODO
addClaim

Norm Folding and Explicit Root Finding for Artin–Schreier Equations over Finite Fields

Authors: Chuangao, Ni;

Norm Folding and Explicit Root Finding for Artin–Schreier Equations over Finite Fields

Abstract

Addressing the long-standing reliance on a priori trace determination and the absence of explicit unified root-finding formulas for Artin–Schreier equations $\wp(x) = \Delta$ over finite fields, this paper reveals the profound algebraic asymmetry with Kummer extensions and establishes a strictly dual unified explicit root-finding theory. We show that under the additive translation of the Galois group, the field norm undergoes an "orthogonal collapse" into the $\wp$-map (Theorem 1), forming a perfect duality with the "expansion" of the field norm in Kummer extensions. Based on this folding mechanism, we establish an unconditional $\wp$-homomorphism bridging identity (Theorem 2), and by introducing the trace scalar $\tau$ as a linear compensator, we derive the first unified explicit root-finding formula $x = \mathcal{L}_F(z) + \tau\omega$ (Theorem 3) parallel to the Kummer paradigm for characteristic $p$. This paradigm internalizes the traditional a priori discrete determination into the logic of algebraic operations, achieving an intrinsic unity of "determination as construction," and realizes a dimensional reduction from nonlinear exponent extraction to linear operator extraction in computational complexity.

Powered by OpenAIRE graph
Found an issue? Give us feedback