SOURCE-LINKED INTELLIGENCE

Representation Redundancy and Structural Complexity in Finite-Field Inversion

arXiv · AI, language, vision and robotics · article · Sep 4, 2026 · UTC

The representation chosen for a mathematical operation can affect both its algebraic form and its empirical learning difficulty. We study this phenomenon for inversion over \(\mathbb F_{2^n}\), with field elements expressed in varying ordered \(\mathbb F_2\)-bases. We prove that two ordered bases induce the same coordinate inversion map if and only if they belong to the same Galois orbit. Since every orbit has size \(n\), the correspondence between ordered bases and distinct inversion maps is exactly \(n\)-to-one. We then analyze three Boolean formulations of inversion. The reference formulati

Read original source ↗ Open in workspace

recordType

paper

region

Global