arXiv Analytics

Sign in

arXiv:1811.10503 [math.CO]AbstractReferencesReviewsResources

On restricted permutations of $\{1,\ldots,n\}$

Zhi-Wei Sun

Published 2018-11-26Version 1

In this paper we study permutations of $\{1,\ldots,n\}$ with certain restrictions. In particular, we show that there is a unique permutation $\pi$ of $\{1,\ldots,n\}$ such that all the numbers $k+\pi(k)$ ($k=1,\ldots,n$) are powers of two. We also pose some conjectures for further research; for example, we conjecture that for any integer $n>5$ there is a permutation $\pi$ of $\{1,\ldots,n\}$ such that $$\sum_{k=1}^{n-1}\frac1{\pi(k)\pi(k+1)}=1.$$

Comments: 7 pages
Categories: math.CO, math.NT
Subjects: 05A05, 11B39, 11B75, 11C20
Related articles: Most relevant | Search more
arXiv:math/0211213 [math.CO] (Published 2002-11-13)
Restricted permutations and queue jumping
arXiv:math/0301033 [math.CO] (Published 2003-01-05, updated 2003-03-02)
A generalization of the Simion-Schmidt bijection for restricted permutations
arXiv:math/0505094 [math.CO] (Published 2005-05-05)
Enumerating Segmented Patterns in Compositions and Encoding by Restricted Permutations