Existence conjecture for divisible design Cayley digraphs with prime-power parameters

Let nn be an odd prime power. A divisible design Cayley digraph is a Cayley digraph that forms a divisible design with parameters (v,k,λ1,λ2,m,n)(v,k,\lambda_1,\lambda_2,m,n), where the parameters specify its order, valency, within-class and between-class common-neighbour counts, and the number and size of the classes. Existence conjecture. There exists a divisible design Cayley digraph with parameters

(n21,n,0,1,n+1,n1).(n^2-1,n,0,1,n+1,n-1).

The construction is known in the cases checked by computer, and the conjecture asks whether it exists for every odd prime power nn.

Sources & referencesView supporting material

Primary source

Dean Crnkovic, Hadi Kharaghani and Andrea Svob, “Divisible design Cayley digraphs”, arXiv:1910.10991 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.