A result on polynomials derived via graph theory

2019/04/21 by Coulter, Robert S., De Winter, Stefaan, Kodess, Alex +1
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1904.09657

Abstract

We present an example of a result in graph theory that is used to obtain a result in another branch of mathematics. More precisely, we show that the isomorphism of certain directed graphs implies that some trinomials over finite fields have the same number of roots.

Related

• Functional Graphs of Polynomials over Finite Fields
• Bipartite Graphs as Polynomials, and Polynomials as Bipartite Graphs (with a view towards dividing in ℕ[x], ℕ[x,y])
• Isomorphism of graphs-a polynomial test
• An Analogue of the Gallai-Edmonds Structure Theorem for Nonzero Roots of the Matching Polynomial
• Graph polynomials: some questions on the edge