Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 4 min ago
PreprintarXiv licencearXiv

Affine Symmetries of Polynomial Roots with Multiplicities and Applications to Constacyclic Codes

Abstract

Let f(X) be a polynomial over a finite field, and let its defining function record the multiplicities of its roots. In this paper, we introduce the affine stabilizer group and the affine stabilizer group scheme of the defining function of f(X). These objects characterize the affine symmetries of the roots of f(X) together with their multiplicities. We establish structural descriptions of these affine stabilizers and relate them to the coefficient structure of f(X). In particular, the affine stabilizer group determines quotient structures of the defining function, which yield canonical descriptions of the corresponding semi-invariant polynomial spaces. The resulting coefficient constraints provide explicit restrictions on the possible supports of polynomials with prescribed affine symmetries. The affine stabilizer group scheme further captures infinitesimal symmetries arising from multiple roots and gives refined coefficient constraints beyond those obtained from ordinary affine transformations. We apply this framework to generator polynomials of constacyclic codes over finite fields. The affine stabilizer structure of a generator polynomial induces subcodes defined by semi-invariant conditions and provides constraints on their dimensions and Hamming distances. In the special case of multiplicative symmetries, the construction specializes to the support-primitive decomposition of constacyclic codes.

Related

  1. On the DML(1) property for regular endomorphisms of affine spaces: multiplicities of points at infinity
    She Yang, Aoyang Zheng
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryDynamical systemsarXiv
  2. Equal Hamming Weights at Fixed Root Order and Applications to Constacyclic MDS Codes
    Li Zhu, Hongfeng Wu
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. High-Order Predictor–Corrector Schemes for the Simultaneous Computation of Polynomial Roots with Known Multiplicities: Order Analysis and the Role of a Scalar-Derived Correction Factor
    Mudassir Shams, Bruno Carpentieri
    MathematicsPeer-reviewedCC BY 4.0Numerical analysis & scientific computingCrossref
  4. The Lie algebra of polynomial vector fields on the affine space with constant divergence is $1.5$-generated
    Ivan Beldiev, Gleb Pogudin
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  5. Moments of polynomial processes under affine resetting
    Johannes Assefa, Martin Keller-Ressel, Zbigniew Palmowski
    arXivPreprintarXiv licenceFull textProbabilityarXiv
BibTeX
@misc{zhu2026affine,
  title = {{Affine Symmetries of Polynomial Roots with Multiplicities and Applications to Constacyclic Codes}},
  author = {Li Zhu and Hongfeng Wu},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2609.26414},
  eprint = {2609.26414},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.26414},
}
RIS
TY  - UNPB
TI  - Affine Symmetries of Polynomial Roots with Multiplicities and Applications to Constacyclic Codes
AU  - Li Zhu
AU  - Hongfeng Wu
PY  - 2026
DA  - 2026/10/13
PB  - arXiv
DO  - 10.48550/arxiv.2609.26414
UR  - https://arxiv.org/abs/2609.26414
AB  - Let f(X) be a polynomial over a finite field, and let its defining function record the multiplicities of its roots. In this paper, we introduce the affine stabilizer group and the affine stabilizer group scheme of the defining function of f(X). These objects characterize the affine symmetries of the roots of f(X) together with their multiplicities. We establish structural descriptions of these affine stabilizers and relate them to the coefficient structure of f(X). In particular, the affine stabilizer group determines quotient structures of the defining function, which yield canonical descriptions of the corresponding semi-invariant polynomial spaces. The resulting coefficient constraints provide explicit restrictions on the possible supports of polynomials with prescribed affine symmetries. The affine stabilizer group scheme further captures infinitesimal symmetries arising from multiple roots and gives refined coefficient constraints beyond those obtained from ordinary affine transformations. We apply this framework to generator polynomials of constacyclic codes over finite fields. The affine stabilizer structure of a generator polynomial induces subcodes defined by semi-invariant conditions and provides constraints on their dimensions and Hamming distances. In the special case of multiplicative symmetries, the construction specializes to the support-primitive decomposition of constacyclic codes.
ER  -