On a question of Sidorenko
Combinatorics
2019-01-03 v1
Abstract
For a positive integer denote by the maximal possible number of different functions such that each function , is bijective. Recently A. Sidorenko conjectured that equals to the minimal prime divisor of . We disprove it for by several counterexamples found by computer.
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}
}