Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 77 tok/s
Gemini 2.5 Pro 54 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 175 tok/s Pro
GPT OSS 120B 454 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

Diameter of Some Monomial Digraphs (1807.11360v1)

Published 30 Jul 2018 in math.CO

Abstract: Let $p$ be a prime, $e$ a positive integer, $q = pe$, and let $\mathbb{F}q$ denote the finite field of $q$ elements. Let $f_i : \mathbb{F}_q2\to\mathbb{F}_q$ be arbitrary functions, where $1\le i\le l$, $i$ and $l$ are integers. The digraph $D = D(q;\bf{f})$, where ${\bf f}=(f_1,\dotso,f_l) : \mathbb{F}_q2\to\mathbb{F}_ql$, is defined as follows. The vertex set of $D$ is $\mathbb{F}_q{l+1}$. There is an arc from a vertex ${\bf x} = (x_1,\dotso,x{l+1})$ to a vertex ${\bf y} = (y_1,\dotso,y_{l+1})$ if $ x_i + y_i = f_{i-1}(x_1,y_1) $ for all $i$, $2\le i \le l+1$. In this paper we study the diameter of $D(q; {\bf f})$ in the special case of monomial digraphs $D(q; m,n)$: ${\bf f} = f_1$ and $f_1(x,y) = xm yn$ for some nonnegative integers $m$ and $n$.

Citations (4)

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube