English

On a question of Sidorenko

Combinatorics 2019-01-03 v1

Abstract

For a positive integer n>1n>1 denote by ω(n)\omega(n) the maximal possible number kk of different functions f1,,fk:Z/nZZ/nZf_1,\dots,f_k:\mathbb{Z}/n\mathbb{Z}\mapsto \mathbb{Z}/n\mathbb{Z} such that each function fifj,i<jf_i-f_j,i<j, is bijective. Recently A. Sidorenko conjectured that ω(n)\omega(n) equals to the minimal prime divisor of nn. We disprove it for n=15,21,27n=15,21,27 by several counterexamples found by computer.

Keywords

Cite

@article{arxiv.1901.00440,
  title  = {On a question of Sidorenko},
  author = {D. Cherkashin and F. Petrov and V. Sokolov},
  journal= {arXiv preprint arXiv:1901.00440},
  year   = {2019}
}
R2 v1 2026-06-23T07:01:35.019Z