On some bounds for symmetric tensor rank of multiplication in finite\n fields

2016/01/01 by Stéphane Ballet, Ballet, Stéphane, Julia Pieltant +5
Computer Science · Mathematics · #Coding theory and cryptography #Cryptography and Residue Arithmetic #FOS: Computer and information sciences #Information Theory (cs.IT) #Mathematical Approximation and Integration

paper · pdf · doi:10.48550/arxiv.1601.00126

openalex publication_date 2016/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We establish new upper bounds about symmetric bilinear complexity in any\nextension of finite fields. Note that these bounds are not asymptotical but\nuniform.\n Moreover we give examples of Shimura curves that do not descend over their\nfield of moduli, which discusses the validity of certain published bounds.\n

Related

• Gaps between prime numbers and tensor rank of multiplication in finite\n fields
• Automated Lower Bounds for Bilinear Complexity over Finite Fields
• Dense families of modular curves, prime numbers and uniform symmetric tensor rank of multiplication in certain finite fields
• On the tensor rank of multiplication in finite extensions of finite fields
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry