Jacobi polynomials, invariant rings, and generalized t-designs

IF 0.7 3区 数学 Q2 MATHEMATICS
Himadri Shekhar Chakraborty , Nur Hamid , Tsuyoshi Miezaki , Manabu Oura
{"title":"Jacobi polynomials, invariant rings, and generalized t-designs","authors":"Himadri Shekhar Chakraborty ,&nbsp;Nur Hamid ,&nbsp;Tsuyoshi Miezaki ,&nbsp;Manabu Oura","doi":"10.1016/j.disc.2025.114447","DOIUrl":null,"url":null,"abstract":"<div><div>In the present paper, we provide results that relate the Jacobi polynomials in genus <em>g</em>. We show that if a code is <em>t</em>-homogeneous that is, the codewords of the code for every given weight hold a <em>t</em>-design, then its Jacobi polynomial in genus <em>g</em> with composition <em>T</em> with <span><math><mo>|</mo><mi>T</mi><mo>|</mo><mo>≤</mo><mi>t</mi></math></span> can be obtained from its weight enumerator in genus <em>g</em> using the polarization operator. Using this fact, we investigate the invariant ring, which relates the homogeneous Jacobi polynomials of the binary codes in genus <em>g</em>. Specifically, the generators of the invariant ring appearing for <span><math><mi>g</mi><mo>=</mo><mn>1</mn></math></span> are obtained. Moreover, we define the split Jacobi polynomials in genus <em>g</em> 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 <em>t</em>-homogeneous code also given.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 6","pages":"Article 114447"},"PeriodicalIF":0.7000,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X2500055X","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

In the present paper, we provide results that relate the Jacobi polynomials in genus g. We show that if a code is t-homogeneous that is, the codewords of the code for every given weight hold a t-design, then its Jacobi polynomial in genus g with composition T with |T|t can be obtained from its weight enumerator in genus g using the polarization operator. Using this fact, we investigate the invariant ring, which relates the homogeneous Jacobi polynomials of the binary codes in genus g. Specifically, the generators of the invariant ring appearing for g=1 are obtained. Moreover, we define the split Jacobi polynomials in genus g 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 t-homogeneous code also given.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Discrete Mathematics
Discrete Mathematics 数学-数学
CiteScore
1.50
自引率
12.50%
发文量
424
审稿时长
6 months
期刊介绍: Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信