The exact number of roots of one equation is settled by moving to a cyclic group.

Mathematicians wanted to solve an algebraic question linked to open problems by Ding and Helleseth about optimal ternary cyclic codesternary cyclic codesTernary cyclic codes are a type of algebraic code used in coding theory; optimal means best possible under given parameters., which are special error-correcting codes. The challenge was to count how many solutions, called roots, exist for the specific formula x^(3^s+1) - x^2 + 1 = 0 inside a finite number system called F_q. Here, q equals 3^m with an odd m, and s is greater than or equal to 1. To solve this, the researchers used a mathematical tool called a Cayley transformCayley transformA Cayley transform is a change of variables that rewrites a problem in a different form, often making it easier to solve.. This tool maps the original equation into a cyclic groupcyclic groupA cyclic group is a group in which every element is a power of one fixed element, like the hours on a clock., which is a neat, looping algebraic structure inside the norm-one subgroupnorm-one subgroupThe norm-one subgroup is the set of nonzero elements whose norm is 1; it forms a structured group inside a larger field. of F_q^2*. By doing this calculation, they determined the exact count of roots for the equation.

Why it matters

The equation is a known piece of an open problem about optimal ternary cyclic codes. Determining its exact root count removes one obstacle for researchers studying those codes. That brings the field one step closer to knowing when such codes are optimal.

Questions answered