# A result on polynomials derived via graph theory

**Authors:** Robert S. Coulter, Stefaan De Winter, Alex Kodess, Felix Lazebnik

arXiv: 1904.09657 · 2019-04-23

## TL;DR

This paper demonstrates how a graph theory result can be applied to establish properties of polynomials over finite fields, linking two mathematical areas through graph isomorphism.

## Contribution

It introduces a novel application of directed graph isomorphism to derive properties of polynomials over finite fields.

## Key findings

- Directed graph isomorphism implies equal number of roots for certain trinomials
- Bridges graph theory and finite field polynomial properties
- Provides a new method to analyze polynomial roots using graph structures

## 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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1904.09657/full.md

## Figures

17 figures with captions in the complete paper: https://tomesphere.com/paper/1904.09657/full.md

## References

25 references — full list in the complete paper: https://tomesphere.com/paper/1904.09657/full.md

---
Source: https://tomesphere.com/paper/1904.09657