arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1807.11362math.CO
收藏

关于单目有向图同构问题的注记

A Note on the Isomorphism Problem for Monomial Digraphs

Alex Kodess, Felix Lazebnik

摘要:

设$p$是一个素数,$e$是一个正整数,$q = p^e$,并设$\mathbb{F}_q$表示$q$元素的有限域。令$m,n$、$1\le m,n\le q-1$为整数。单项式有向图$D= D(q;m,n)$定义如下:$D$的顶点集是$\mathbb{F}_q^2$,如果$ x_2 + y_2 = x_1^m y_1^n $,则$((x_1,x_2),(y_1,y_2))$是$D$中的弧.本文研究了单项有向图$D(q;m_1,n_1)$和$D(q;m_2,n_2)$的同构问题。得到了同构的几个必要条件和几个充分条件,并猜想一个简单的充分条件也是同构的必要条件。

英文摘要:

Let $p$ be a prime $e$ be a positive integer, $q = p^e$, and let $\mathbb{F}_q$ denote the finite field of $q$ elements. Let $m,n$, $1\le m,n\le q-1$, be integers. The monomial digraph $D= D(q;m,n)$ is defined as follows: the vertex set of $D$ is $\mathbb{F}_q^2$, and $((x_1,x_2),(y_1,y_2))$ is an arc in $D$ if $ x_2 + y_2 = x_1^m y_1^n $. In this note we study the question of isomorphism of monomial digraphs $D(q;m_1,n_1)$ and $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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑