Sublinear-rank motion conjecture for primitive coherent configurations

Fix 0<δ<10<\delta<1. Let X\mathfrak{X} be a primitive coherent configuration on nn vertices, and suppose every constituent has degree at most δn\delta n. Sublinear-rank motion conjecture. Then

motion(X)=Ω(nlog(n)).\operatorname{motion}(\mathfrak{X})=\Omega\left(\frac{n}{\log(n)}\right).

For bounded rank, the stronger linear bound follows from the paper's proposition. The conjecture concerns unbounded rank, where that argument does not apply; the stated Ω(n/log(n))\Omega(n/\log(n)) bound remains open.

Sources & referencesView supporting material

Primary source

Bohdan Kivva, “On the automorphism groups of distance-regular graphs and rank-4 primitive coherent configurations”, arXiv:1802.06959 (2018).

Additional references

2 papers in this index state this conjecture (2015–2018). The statement above is taken from the most recent of them; the others are arXiv:1509.01711.

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.