Quasirandom Arithmetic Permutations

dc.creatorCooper, Joshua N.
dc.date2003-10-24
dc.date2006-02-28
dc.date.accessioned2026-07-07T06:35:46Z
dc.date.available2026-07-07T06:35:46Z
dc.descriptionPreviously, the author introduced quasirandom permutations, permutations of $\mathbb{Z}_n$ which map intervals to sets with low discrepancy. Here we show that several natural number-theoretic permutations are quasirandom, some very strongly so. Quasirandomness is established via discrete Fourier analysis and the Erdos-Turan inequality, as well as by other means. We apply our results on Sos permutations to make progress on a number of questions relating to the sequence of fractional parts of multiples of an irrational. Several intriguing new open problems are presented throughout the discussion.
dc.description19 pages, 0 figures; title change and minor modifications; final version appeared in JNT
dc.identifierhttps://arxiv.org/abs/math/0310384
dc.identifierhttp://arxiv.org/abs/math/0310384
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/99896
dc.subjectNumber Theory
dc.subjectCombinatorics
dc.subject11K45; 11K38; 11L07
dc.titleQuasirandom Arithmetic Permutations
dc.typetext

Files

Collections