On a question of Sidorenko

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…