English

Jacobi polynomials, invariant rings, and generalized $t$-designs

Combinatorics 2025-02-13 v2 Group Theory Number Theory

Abstract

In the present paper, we provide results that relate the Jacobi polynomials in genus gg. We show that if a code is tt-homogeneous that is, the codewords of the code for every given weight hold a tt-design, then its Jacobi polynomial in genus gg with composition TT with Tt|T|\leq t can be obtained from its weight enumerator in genus~gg using the polarization operator. Using this fact, we investigate the invariant ring, which relates the homogeneous Jacobi polynomials of the binary codes in genus gg. Specifically, the generators of the invariant ring appearing for g=1g=1 are obtained. Moreover, we define the split Jacobi polynomials in genus~gg and obtain the MacWilliams type identity for it. A split generalization for higher genus cases of the relation between the Jacobi polynomials and weight enumerator of a tt-homogeneous code also given.

Keywords

Cite

@article{arxiv.2408.02229,
  title  = {Jacobi polynomials, invariant rings, and generalized $t$-designs},
  author = {Himadri Shekhar Chakraborty and Nur Hamid and Tsuyoshi Miezaki and Manabu Oura},
  journal= {arXiv preprint arXiv:2408.02229},
  year   = {2025}
}

Comments

24 pages

R2 v1 2026-06-28T18:03:50.683Z