Papers
Topics
Authors
Recent
Search
2000 character limit reached

Isomorphism Criterion of Monomial Digraphs over Prime Fields

Published 5 Oct 2026 in math.CO | (2610.06735v1)

Abstract: For any Galois field Fq\mathbb{F}_q with qq elements and any positive integers mm and nn, the directed graph D(q;m,n)D(q;m,n) has vertex set Fq×Fq\mathbb{F}_q\times\mathbb{F}_q, and there is an arc from vertex (x1,x2)(x_1,x_2) to vertex (y1,y2)(y_1,y_2) if and only if x2+y2=x1<sup>my1<sup>nx_2+y_2=x_1<sup>my_1<sup>n. It was conjectured in earlier work that two digraphs D(q;m1,n1)D(q;m_1,n_1) and D(q;m2,n2)D(q;m_2,n_2) are isomorphic if and only if there exists an integer kk relatively prime to q−1q-1 such that m2≡km1m_2\equiv km_1 and n2≡kn1n_2 \equiv kn_1, where both congruences are modulo q−1q-1. We prove this conjecture over prime fields and construct an infinite family of counterexamples over extension fields.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.