English

A New Family of Algebraically Defined Graphs With Small Automorphism Group

Combinatorics 2021-09-08 v1

Abstract

Let pp be an odd prime, q=peq=p^e, e1e\ge 1, and F=Fq\mathbb{F} = \mathbb{F_q} denote the finite field of qq elements. Let f:F2Ff: \mathbb{F}^2\to \mathbb{F} and g:F3Fg: \mathbb{F}^3\to \mathbb{F} be functions, and let PP and LL be two copies of the 3-dimensional vector space F3\mathbb{F}^3. Consider a bipartite graph ΓF(f,g)\Gamma _\mathbb{F} (f, g) with vertex partitions PP and LL and with edges defined as follows: for every (p)=(p1,p2,p3)P(p)=(p_1,p_2,p_3)\in P and every [l]=[l1,l2,l3]L[l]= [l_1,l_2,l_3]\in L, {(p),[l]}=(p)[l]\{(p), [l]\} = (p)[l] is an edge in ΓF(f,g)\Gamma _\mathbb{F} (f, g) if p2+l2=f(p1,l1)      and      p3+l3=g(p1,p2,l1).p_2+l_2 =f(p_1,l_1) \;\;\;\text{and}\;\;\; p_3 + l_3 = g(p_1,p_2,l_1). Given ΓF(f,g)\Gamma _\mathbb{F} (f, g), is it always possible to find a function h:F2Fh:\mathbb{F}^2\to \mathbb{F} such that the graph ΓF(f,h)\Gamma _\mathbb{F} (f, h) with the same vertex set as ΓF(f,g)\Gamma _\mathbb{F} (f, g) and with edges (p)[l](p)[l] defined in a similar way by the system p2+l2=f(p1,l1)      and      p3+l3=h(p1,l1),p_2+l_2 =f(p_1,l_1) \;\;\;\text{and}\;\;\; p_3 + l_3 = h(p_1,l_1), is isomorphic to ΓF(f,g)\Gamma _\mathbb{F} (f, g) for infinitely many qq? In this paper we show that the answer to the question is negative and the graphs ΓFp(p11,p11p2(p1+p2+p1p2))\Gamma_{\mathbb{F}_p}(p_1\ell_1, p_1\ell_1p_2(p_1 + p_2 + p_1p_2)) provide such an example for p1(mod3)p \equiv 1 \pmod{3}. Our argument is based on proving that the automorphism group of these graphs has order pp, which is the smallest possible order of the automorphism group of graphs of the form ΓF(f,g)\Gamma_{\mathbb{F}}(f, g).

Keywords

Cite

@article{arxiv.2109.03130,
  title  = {A New Family of Algebraically Defined Graphs With Small Automorphism Group},
  author = {Felix Lazebnik and Vladislav Taranchuk},
  journal= {arXiv preprint arXiv:2109.03130},
  year   = {2021}
}

Comments

25 pages