Cayley Graphs Generated by Small Degree Polynomials over Finite Fields

DOI10.1137/14095813XzbMath1311.05083arXiv1402.3492OpenAlexW2014055166MaRDI QIDQ5251594

Igor E. Shparlinski

Publication date: 20 May 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.3492

zbMATH Keywords

finite fieldscharacter sumsCayley graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Polynomials over finite fields (11T06) Jacobsthal and Brewer sums; other complete character sums (11L10)

Related Items (3)

Generating sets for the multiplicative groups of algebras over finite fields and expander graphs ⋮ Energy bounds, bilinear forms and their applications in function fields ⋮ Moment subset sums over finite fields

Cites Work

• Algebraic Cayley graphs over finite fields
• Factoring polynomials in finite fields: An application of Lang-Weil to a problem in graph theory
• Polynomial factorisation and an application to regular directed graphs
• Diameters and Eigenvalues
• Generators and irreducible polynomials over finite fields
• Unnamed Item
• Unnamed Item

This page was built for publication: Cayley Graphs Generated by Small Degree Polynomials over Finite Fields