More on additive triples of bijections

arXiv1704.02407MaRDI QIDQ6285282FDOQ6285282

Authors: Sean Eberhard 

Publication date: 7 April 2017

Abstract: We study additive properties of the set $S$ of bijections (or permutations) $1,dots,noG$, thought of as a subset of $G^n$, where $G$ is an arbitrary abelian group of order $n$. Our main result is an asymptotic for the number of solutions to $p{i}_1+p{i}_2+p{i}_3=f$ with $p{i}_1,p{i}_2,p{i}_{3}inS$, where $f:1,dots,noG$ is an arbitary function satisfying $su{m}_{i=1}^{n}f(i)=sumG$. This extends recent work of Manners, Mrazovi'c, and the author. Using the same method we also prove a less interesting asymptotic for solutions to $p{i}_1+p{i}_2+p{i}_3+p{i}_4=f$, and we also show that the distribution $p{i}_1+p{i}_2$ is close to flat in $L^2$. As in the previous paper, our method is based on Fourier analysis, and we prove our results by carefully carving up $widehat{G}^n$ and bounding various character sums. This is most complicated when $G$ has even order, say when $G=mathbf{F}_2^d$. At the end of the paper we explain two applications, one coming from the Latin squares literature (counting transversals in Latin hypercubes) and one from cryptography (PRP-to-PRF conversion).

This page was built for publication: More on additive triples of bijections

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