The equal-order correspondence conjecture for polycyclic codes associated with trinomials

Let t1(x)=xnaxibt_1(x)=x^n-ax^i-b and t2(x)=xnaxnibt_2(x)=x^n-a'x^{n-i}-b' satisfy

Ord(t1(x))=Ord(t2(x)).\operatorname{Ord}(t_1(x))=\operatorname{Ord}(t_2(x)).

Let S1S_1 be the set of all polycyclic codes of length nn over Fq\mathbb{F}_q associated with t1(x)t_1(x), and let S2S_2 be the corresponding set for t2(x)t_2(x). The equal-order correspondence conjecture. The sets S1S_1 and S2S_2 are in one-to-one correspondence, with corresponding codes equivalent to each other. The source paper states that the original conjecture is incorrect and gives a counterexample, so this claim is refuted in the source context.

Sources & referencesView supporting material

Primary source

Minjia Shi, Haodong Lu, Shuang Zhou, Jiarui Xu and Yuhang Zhu, “Equivalence and Duality of Polycyclic Codes Associated with Trinomials over Finite Fields”, arXiv:2204.12433 (2022).

Progress summary

Refreshed
Solved

The conjecture is false: a published counterexample shows that equal polynomial order does not guarantee the proposed correspondence.

The conjecture appeared as Conjecture 3.53.5 in a 20212021 paper on polycyclic codes associated with trinomials, motivated by computational evidence. It asserted a one-to-one correspondence between the two code families, preserving code equivalence, whenever the defining trinomials have equal order.

Known results

  • The original equal-order condition was proposed as a conjecture, not proved, in 20212021.
  • A corrected theorem replaces equal order by the reciprocal relation t2(x)=t1(0)1t1(x)t_2(x)=t_1(0)^{-1}t_1^*(x) and establishes the desired correspondence under that stronger hypothesis.

2022 counterexample

The later paper states that Conjecture 3.53.5 is incorrect. Over F3\mathbb{F}_3, it uses t1(x)=x10+x8+1t_1(x)=x^{10}+x^8+1 and t2(x)=x10+x2+2t_2(x)=x^{10}+x^2+2, both of order 156156, but their associated families contain respectively 1818 and 1212 linear codes; hence the conjectured correspondence cannot exist. The work was listed with 20232023 metadata and later publication information.

Current status (as of August 2026): The original equal-order correspondence conjecture is settled as false, while the stronger reciprocal-polynomial correspondence is the valid replacement.

Sources

Solutions 0

No solutions have been posted yet.