On the DLW conjectures
From MaRDI portal
Abstract: In 2007, Dmytrenko, Lazebnik and Williford posed two related conjectures about polynomials over finite fields. Conjecture~1 is a claim about the uniqueness of certain monomial graphs. Conjecture~2, which implies Conjecture~1, deals with certain permutation polynomials of finite fields. Two natural strengthenings of Conjecture~2, referred to as Conjectures~A and B in the present paper, were also insinuated. In a recent development, Conjecture~2 and hence Conjecture~1 have been confirmed. The present paper gives a proof of Conjecture~A.
Recommendations
- On a conjecture concerning Kloosterman polynomials
- scientific article; zbMATH DE number 4033866
- Proof of a conjecture on permutation polynomials over finite fields
- Further results on complete permutation monomials over finite fields
- Permutation Polynomials and Resolution of Singularities over Finite Fields
Cites work
- scientific article; zbMATH DE number 1943958 (Why is no real title available?)
- Monomial graphs and generalized quadrangles
- New examples of graphs without small cycles and of large size
- On monomial graphs of girth eight
- Proof of a conjecture on monomial graphs
- Some families of graphs, hypergraphs and digraphs defined by systems of equations: a survey
- The history of degenerate (bipartite) extremal graph problems
Cited in
(4)
This page was built for publication: On the DLW conjectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747228)
