Treffer: Refining the search space of Alltop monomials.

Alltop functions have applications to code-division multiple access (CDMA) systems and mutually unbiased bases (MUBs). Alltop functions construct MUBs and CDMA signal sets, and this motivates the continued search for further Alltop functions. The discovery of further Alltop functions is hindered by the computational complexity of verification. This paper narrows the search space through the introduction of a characteristic cubic polynomial and provides a verification process for Alltop monomials with a reduced computational complexity. Computational results lead to the conjecture that there are no further Alltop monomials. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Algebraic Combinatorics is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)