Quasirandom Arithmetic Permutations
نویسنده
چکیده
In [9], the author introduced quasirandom permutations, permutations of Zn 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 ErdősTurán inequality, as well as by other means. We apply our results on Sós permutations to make progress on a number of questions relating to the sequence of fractional parts of multiples of an irrational. Several intriguing open problems are presented throughout the discussion.
منابع مشابه
Survey of Quasirandomness in Number Theory
In [9], the author introduced quasirandom permutations, permutations of Zn 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 ErdősTurán inequality, as well as by other means. We apply our results on Sós permutations to make ...
متن کاملQuasirandom permutations are characterized by 4-point densities
For permutations π and τ of lengths |π| ≤ |τ |, let t(π, τ) be the probability that the restriction of τ to a random |π|-point set is (order) isomorphic to π. We show that every sequence {τj} of permutations such that |τj| → ∞ and t(π, τj) → 1/4! for every 4-point permutation π is quasirandom (that is, t(π, τj) → 1/|π|! for every π). This answers a question posed by Graham.
متن کاملAN ARITHMETIC OF COMPLETE PERMUTATIONS CONSl?RAMRi, I: AN EXPOSITION OF THE GENERAL THEORY
We develop an arithrretic of complete permutations of sy-ilmetric, integral bases; this arithmetic is comparable to that of perfect systems of difference sets with which there are several interrelations. Super-position of permutations provides the addition of this arithmetic. Addition if facilitated by complete permutations with a certain “rplitting” property, allowing them to be pulled apart a...
متن کاملForbidden arithmetic progressions in permutations of subsets of the integers
Permutations of the positive integers avoiding arithmetic progressions of length 5 were constructed in (Davis et al, 1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length 7. We construct a permutation of the integers avoiding arithmetic progressions of length 6. We also prove a lower bound of 1 2 on the lower density of subsets of positive inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005