Representation Redundancy and Structural Complexity in Finite-Field Inversion

• URL: http://arxiv.org/abs/2609.04583v1
• Date: Fri, 04 Sep 2026 00:33:03 GMT
• Title: Representation Redundancy and Structural Complexity in Finite-Field Inversion
• Abstract summary: We study the phenomenon for inversion over (mathbb F_2n) with field elements expressed in varying ordered (mathbb F)-bases.<n>We prove that two ordered bases induce the same coordinate inversion map if and only if they belong to the same Galois orbit.
• Score: 8.640569733631528
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 formulation has algebraic degree \(n-1\) and joint ANF leap \(1\), the mixed representation formulation has degree \(2(n-1)\) and joint ANF leap \(2\), and the complete raw formulation has degree at most \(3(n-1)\) and joint ANF leap at least \(n\). Exhaustive computations agree with the theoretical results and bounds in the cases considered. Controlled experiments with multilayer perceptrons show the same ordering in learning difficulty, while Galois orbit redundancy provides only a limited generalization benefit under the tested conditions. These results show that exact redundancy among representations can coexist with changes in Boolean structure and learning behavior when the representation is exposed as part of the input.

Related papers

• From Symmetry to Invariance: Learning Galois Equivalent Representations in Finite Fields [8.640569733631528]
  We study the question through multiplication in finite fields under changes of basis.<n>The Galois action organizes basis representations into orbits, and bases in the same orbit induce the same coordinate multiplication map.<n>We train a model to predict the Galois action between basis representations.<n>Repeated applications of the learned transformation are then used to construct a canonical representative for each orbit.
  arXiv  Detail & Related papers  (2026-08-23T17:19:54Z)
• Quantum Kolmogorov--Arnold representation theorem for continuous unitary-valued maps [0.0]
  We establish two quantum analogues of the Kolmogorov--Arnold representation theorem for continuous unitary-valued maps.<n>We provide a concrete topological counterexample based on the lifting property of (mathcalSU(2)) to demonstrate that these local representation theorems cannot be globally extended.
  arXiv  Detail & Related papers  (2026-07-03T10:46:32Z)
• DiffMath: Symbol- and Graph-Aware Latent Diffusion Transformer for Handwritten Mathematical Expression Generation [47.67907704295109]
  Handwritten Mathematical Expression Generation (HMEG) is challenging due to the complex two-dimensional layouts and long-range dependencies.<n>In this work, we propose DiffMath, a symbol-oriented graph-aware latent diffusion framework.<n> Experiments show that DiffMath produces structurally consistent handwritten expressions, superior performance over existing methods, and improves the accuracy of downstream models.
  arXiv  Detail & Related papers  (2026-06-18T08:37:02Z)
• Neural Networks Provably Learn Spectral Representations for Group Composition [51.637084292404616]
  We study how structured internal structure emerges during neural network training.<n>We prove that the training dynamics are governed by a gradient ascent on a representation-theoretic energy functional.<n>This framework provides a representation-theoretic account of feature learning and characterizes a novel low-rank compression phenomenon.
  arXiv  Detail & Related papers  (2026-06-02T01:04:21Z)
• Completeness for Prime-Dimensional Phase-Affine Circuits [0.0]
  We present a compact PROP for CNOT-dihedral picture from qubits to prime-dimensional qudits.<n>We derive uniform transport rules, establish unique phase-affine normal forms, and prove: semantic equality coincides with derivable equality.<n>This yields a prime-dimensional, phase-polynomial-aligned generalisation of the CNOT-dihedral equational theory.
  arXiv  Detail & Related papers  (2026-03-06T16:51:19Z)
• Rethinking Diffusion Models with Symmetries through Canonicalization with Applications to Molecular Graph Generation [56.361076943802594]
  CanonFlow achieves state-of-the-art performance on the challenging GEOM-DRUG dataset, and the advantage remains large in few-step generation.
  arXiv  Detail & Related papers  (2026-02-16T18:58:55Z)
• A Theoretical Framework for Discovering Groups and Unitary Representations via Tensor Factorization [9.572235167281685]
  We provide a rigorous theoretical explanation for this inductive bias by decomposing its objective into a term regulating factor scales.<n>We prove two key results: (1) the global minimum is achieved by the unitary regular representation for groups, and (2) non-group operations incur a strictly higher objective value.
  arXiv  Detail & Related papers  (2025-11-28T12:58:13Z)
• Bridging conformal field theory and parton approaches to SU(n)_k chiral spin liquids [21.876059213677966]
  We employ the $mathrmSU(n)_k$ Wess-Zumino-Witten (WZW) model in conformal field theory to construct lattice wave functions in both one and two dimensions.<n>The spins on all lattice sites are chosen to transform under the $mathrmSU(n)$ irreducible representation with a single row and $k$ boxes in the Young tableau.
  arXiv  Detail & Related papers  (2025-01-16T14:42:00Z)
• Unified Fourier-based Kernel and Nonlinearity Design for Equivariant Networks on Homogeneous Spaces [52.424621227687894]
  We introduce a unified framework for group equivariant networks on homogeneous spaces. We take advantage of the sparsity of Fourier coefficients of the lifted feature fields. We show that other methods treating features as the Fourier coefficients in the stabilizer subgroup are special cases of our activation.
  arXiv  Detail & Related papers  (2022-06-16T17:59:01Z)
• Finite-Function-Encoding Quantum States [52.77024349608834]
  We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions. We investigate some of their structural properties.
  arXiv  Detail & Related papers  (2020-12-01T13:53:23Z)
• Applying Lie Groups Approaches for Rigid Registration of Point Clouds [3.308743964406687]
  We use Lie groups and Lie algebras to find the rigid transformation that best register two surfaces represented by point clouds. The so called pairwise rigid registration can be formulated by comparing intrinsic second-order orientation tensors. We show promising results when embedding orientation tensor fields in Lie algebras.
  arXiv  Detail & Related papers  (2020-06-23T21:26:57Z)
• A refinement of Reznick's Positivstellensatz with applications to quantum information theory [72.8349503901712]
  In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares. Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
  arXiv  Detail & Related papers  (2019-09-04T11:46:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.