Diameter of Some Monomial Digraphs
Alex Kodess, Felix Lazebnik, Stephen Smith, Joshua Sporre

TL;DR
This paper investigates the diameter of monomial digraphs defined over finite fields, providing new bounds and properties for these graphs based on the exponents m and n.
Contribution
It introduces a detailed analysis of the diameter of monomial digraphs over finite fields, extending previous work to include new bounds and structural insights.
Findings
Derived bounds for the diameter of monomial digraphs
Identified conditions affecting the diameter based on m and n
Provided explicit examples illustrating the diameter behavior
Abstract
Let be a prime, a positive integer, , and let denote the finite field of elements. Let be arbitrary functions, where , and are integers. The digraph , where , is defined as follows. The vertex set of is . There is an arc from a vertex to a vertex if for all , . In this paper we study the diameter of in the special case of monomial digraphs : and for some nonnegative integers and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Graph theory and applications · Commutative Algebra and Its Applications
