English

A Note on the Isomorphism Problem for Monomial Digraphs

Combinatorics 2018-07-31 v1

Abstract

Let pp be a prime ee be a positive integer, q=peq = p^e, and let Fq\mathbb{F}_q denote the finite field of qq elements. Let m,nm,n, 1m,nq11\le m,n\le q-1, be integers. The monomial digraph D=D(q;m,n)D= D(q;m,n) is defined as follows: the vertex set of DD is Fq2\mathbb{F}_q^2, and ((x1,x2),(y1,y2))((x_1,x_2),(y_1,y_2)) is an arc in DD if x2+y2=x1my1n x_2 + y_2 = x_1^m y_1^n . In this note we study the question of isomorphism of monomial digraphs D(q;m1,n1)D(q;m_1,n_1) and D(q;m2,n2)D(q;m_2,n_2). Several necessary conditions and several sufficient conditions for the isomorphism are found. We conjecture that one simple sufficient condition is also a necessary one.

Keywords

Cite

@article{arxiv.1807.11362,
  title  = {A Note on the Isomorphism Problem for Monomial Digraphs},
  author = {Alex Kodess and Felix Lazebnik},
  journal= {arXiv preprint arXiv:1807.11362},
  year   = {2018}
}

Comments

12 pages

R2 v1 2026-06-23T03:19:02.456Z