CAYLEY GRAPHS GENERATED BY SMALL DEGREE POLYNOMIALS OVER FINITE FIELDS

被引：4

作者：

Shparlinski, Igor F. ^{[1
]}

机构：

[1] Univ New S Wales, Dept Pure Math, Sydney, NSW 2052, Australia

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 2015年 / 29卷 / 01期

关键词：

Cayley graphs; finite fields; polynomials; character sums;

D O I：

10.1137/14095813X

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We introduce and use some new arguments to improve upper bounds of Chung and of Lu, Wan, Wang, and Zhang on the diameter of some Cayley graphs constructed from polynomials over a finite field.

引用

页码：376 / 381

页数：6

共 7 条

[1]

Chung F. R. K., 1989, J. Amer. Math. Soc, V2, P187, DOI [DOI 10.1090/S0894-0347-1989-0965008-X, DOI 10.2307/1990973.MR965008]

[2]

Cohen S. D., 1998, Finite Fields and their Applications, V4, P316, DOI 10.1006/ffta.1998.0219

[3]

Iwaniec H., 2004, ANAL NUMBER THEORY

[4] FACTORING POLYNOMIALS IN FINITE-FIELDS - AN APPLICATION OF LANG-WEIL TO A PROBLEM IN GRAPH-THEORY [J].

KATZ, NM .

MATHEMATISCHE ANNALEN, 1990, 286 (04) :625-637

[5]

Lidl R., 1997, Encyclopedia of Mathematics and Its Applications, V20

[6] Algebraic Cayley graphs over finite fields [J].

Lu, M. ;

Wan, D. ;

Wang, L. -P. ;

Zhang, X. -D. .

FINITE FIELDS AND THEIR APPLICATIONS, 2014, 28 :43-56

[7] Generators and irreducible polynomials over finite fields [J].

Wan, DQ .

MATHEMATICS OF COMPUTATION, 1997, 66 (219) :1195-1212

← 1 →