Generating sets for the multiplicative groups of algebras over finite fields and expander graphs

DOI10.1016/j.jsc.2017.07.008zbMath1378.68201OpenAlexW2735550002MaRDI QIDQ2409015

Ming-Deh A. Huang, Lian Liu

Publication date: 10 October 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2017.07.008

zbMATH Keywords

Cayley graphcharacter sumalgebragenerating setexpander graph

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite fields (field-theoretic aspects) (12E20)

Cites Work

• Algebraic Cayley graphs over finite fields
• On primitive elements in finite fields of low characteristic
• Ramanujan graphs
• Several generalizations of Weil sums
• Orders of Gauss periods in finite fields
• Function field sieve method for discrete logarithms over finite fields
• Handbook of Finite Fields
• On the Function Field Sieve and the Impact of Higher Splitting Probabilities
• Constructing Small Generating Sets for the Multiplicative Groups of Algebras over Finite Fields
• Expander graphs and their applications
• Better expanders and superconcentrators
• An Estimate for Character Sums
• Diameters and Eigenvalues
• Searching for Primitive Roots in Finite Fields
• Primitive points on constant elliptic curves over function fields
• Elements of provable high orders in finite fields
• Generators and irreducible polynomials over finite fields
• On Orders of Optimal Normal Basis Generators
• Cayley Graphs Generated by Small Degree Polynomials over Finite Fields
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• The PCP theorem by gap amplification