On permutations of \1, ,n\ and related topics

Abstract: In this paper we study combinatorial aspects of permutations of

1, l d o t s, n

and related topics. In particular, we prove that there is a unique permutation

p i

of

1, l d o t s, n

such that all the numbers

k + p i (k)

(

k = 1, l d o t s, n

) are powers of two. We also show that

n m i d e x t p e r [i^{j - 1}]_{1 l e i, j l e n}

for any integer

n > 2

. We conjecture that if a group

G

contains no element of order among

2, l d o t s, n + 1

then any

A s u b s e t e q G

with

| A | = n

can be written as

a_{1}, l d o t s, a_{n}

with

a_{1}, a_{2}^{2}, l d o t s, a_{n}^{n}

pairwise distinct. This conjecture is confirmed when

G

is a torsion-free abelian group. We also prove that for any finite subset

A

of a torsion-free abelian group

G

with

| A | = n > 3

, there is a numbering

a_{1}, l d o t s, a_{n}

of all the elements of

A

such that all the

n

sums

a_1+a_2+a_3, a_2+a_3+a_4, ldots, a_{n-2}+a_{n-1}+a_n, a_{n-1}+a_n+a_1, a_n+a_1+a_2

are pairwise distinct.

Recommendations

Cites Work

Cited In (21)

Uses Software

This page was built for publication: On permutations of \(\{1,\ldots ,n\}\) and related topics