On a question of Sidorenko

From MaRDI portal




Abstract: For a positive integer n>1 denote by omega(n) the maximal possible number k of different functions f1,dots,fk:mathbbZ/nmathbbZmapstomathbbZ/nmathbbZ such that each function fi−fj,i<j, is bijective. Recently A. Sidorenko conjectured that omega(n) equals to the minimal prime divisor of n. We disprove it for n=15,21,27 by several counterexamples found by computer.














This page was built for publication: On a question of Sidorenko

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6311931)