Recognition: unknown
On a question of Sidorenko
classification
🧮 math.CO
keywords
mathbbomegasidorenkobijectivecomputerconjecturedcounterexamplesdenote
read the original abstract
For a positive integer $n>1$ denote by $\omega(n)$ the maximal possible number $k$ of different functions $f_1,\dots,f_k:\mathbb{Z}/n\mathbb{Z}\mapsto \mathbb{Z}/n\mathbb{Z}$ such that each function $f_i-f_j,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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.