加载中…
We prove an asymptotic for the number of additive triples of bijections , that is, the number of pairs of bijections such that the pointwise sum is also a bijection. This problem is equivalent to counting the number of orthomorphisms or complete mappings of , to counting the number of arrangements of mutually nonattacking semiqueens on an toroidal chessboard, and to counting the number of transversals in a cyclic Latin square. The method of proof is a version of the Hardy–Littlewood circle method from analytic number theory, adapted to the group .

生成讲解博客的中文版本

生成AI智能校验的中文版本